./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/ifncomp.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06589e01-ef11-47cb-a00d-dca3b06ed16e/bin/ukojak-LBtLqBUTdQ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06589e01-ef11-47cb-a00d-dca3b06ed16e/bin/ukojak-LBtLqBUTdQ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06589e01-ef11-47cb-a00d-dca3b06ed16e/bin/ukojak-LBtLqBUTdQ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06589e01-ef11-47cb-a00d-dca3b06ed16e/bin/ukojak-LBtLqBUTdQ/config/KojakReach.xml -i ../../sv-benchmarks/c/array-fpi/ifncomp.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06589e01-ef11-47cb-a00d-dca3b06ed16e/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06589e01-ef11-47cb-a00d-dca3b06ed16e/bin/ukojak-LBtLqBUTdQ --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6359f1f4cb6aed42e13f4959731bd90b4ed828bda061bd22e3b91472b1893854 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 00:38:59,084 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 00:38:59,086 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 00:38:59,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 00:38:59,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 00:38:59,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 00:38:59,123 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 00:38:59,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 00:38:59,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 00:38:59,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 00:38:59,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 00:38:59,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 00:38:59,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 00:38:59,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 00:38:59,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 00:38:59,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 00:38:59,138 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 00:38:59,139 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 00:38:59,141 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 00:38:59,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 00:38:59,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 00:38:59,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 00:38:59,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 00:38:59,149 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 00:38:59,153 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 00:38:59,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 00:38:59,154 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 00:38:59,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 00:38:59,156 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 00:38:59,157 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 00:38:59,158 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 00:38:59,159 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 00:38:59,160 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 00:38:59,161 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 00:38:59,163 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 00:38:59,164 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 00:38:59,164 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 00:38:59,165 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 00:38:59,165 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 00:38:59,166 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 00:38:59,167 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 00:38:59,168 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06589e01-ef11-47cb-a00d-dca3b06ed16e/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-11-23 00:38:59,206 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 00:38:59,210 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 00:38:59,212 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 00:38:59,212 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-11-23 00:38:59,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 00:38:59,214 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 00:38:59,214 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 00:38:59,214 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 00:38:59,214 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 00:38:59,215 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 00:38:59,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 00:38:59,216 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 00:38:59,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 00:38:59,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 00:38:59,217 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 00:38:59,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 00:38:59,218 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 00:38:59,218 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 00:38:59,218 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-11-23 00:38:59,219 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-11-23 00:38:59,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 00:38:59,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 00:38:59,219 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 00:38:59,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 00:38:59,220 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 00:38:59,220 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-11-23 00:38:59,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 00:38:59,221 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 00:38:59,221 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_06589e01-ef11-47cb-a00d-dca3b06ed16e/bin/ukojak-LBtLqBUTdQ/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_06589e01-ef11-47cb-a00d-dca3b06ed16e/bin/ukojak-LBtLqBUTdQ 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak 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 -> 6359f1f4cb6aed42e13f4959731bd90b4ed828bda061bd22e3b91472b1893854 [2021-11-23 00:38:59,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 00:38:59,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 00:38:59,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 00:38:59,590 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 00:38:59,591 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 00:38:59,592 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06589e01-ef11-47cb-a00d-dca3b06ed16e/bin/ukojak-LBtLqBUTdQ/../../sv-benchmarks/c/array-fpi/ifncomp.c [2021-11-23 00:38:59,670 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06589e01-ef11-47cb-a00d-dca3b06ed16e/bin/ukojak-LBtLqBUTdQ/data/a8773f268/bc7d831c85b6430ea08f00ce39cc25be/FLAG56d5e1b07 [2021-11-23 00:39:00,223 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 00:39:00,224 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06589e01-ef11-47cb-a00d-dca3b06ed16e/sv-benchmarks/c/array-fpi/ifncomp.c [2021-11-23 00:39:00,238 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06589e01-ef11-47cb-a00d-dca3b06ed16e/bin/ukojak-LBtLqBUTdQ/data/a8773f268/bc7d831c85b6430ea08f00ce39cc25be/FLAG56d5e1b07 [2021-11-23 00:39:00,577 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06589e01-ef11-47cb-a00d-dca3b06ed16e/bin/ukojak-LBtLqBUTdQ/data/a8773f268/bc7d831c85b6430ea08f00ce39cc25be [2021-11-23 00:39:00,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 00:39:00,581 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 00:39:00,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 00:39:00,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 00:39:00,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 00:39:00,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:39:00" (1/1) ... [2021-11-23 00:39:00,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a7a090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:00, skipping insertion in model container [2021-11-23 00:39:00,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:39:00" (1/1) ... [2021-11-23 00:39:00,601 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 00:39:00,622 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 00:39:00,782 WARN L230 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_06589e01-ef11-47cb-a00d-dca3b06ed16e/sv-benchmarks/c/array-fpi/ifncomp.c[590,603] [2021-11-23 00:39:00,813 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 00:39:00,822 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 00:39:00,833 WARN L230 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_06589e01-ef11-47cb-a00d-dca3b06ed16e/sv-benchmarks/c/array-fpi/ifncomp.c[590,603] [2021-11-23 00:39:00,844 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 00:39:00,858 INFO L208 MainTranslator]: Completed translation [2021-11-23 00:39:00,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:00 WrapperNode [2021-11-23 00:39:00,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 00:39:00,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 00:39:00,861 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 00:39:00,861 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 00:39:00,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:00" (1/1) ... [2021-11-23 00:39:00,891 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:00" (1/1) ... [2021-11-23 00:39:00,915 INFO L137 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 92 [2021-11-23 00:39:00,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 00:39:00,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 00:39:00,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 00:39:00,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 00:39:00,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:00" (1/1) ... [2021-11-23 00:39:00,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:00" (1/1) ... [2021-11-23 00:39:00,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:00" (1/1) ... [2021-11-23 00:39:00,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:00" (1/1) ... [2021-11-23 00:39:00,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:00" (1/1) ... [2021-11-23 00:39:00,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:00" (1/1) ... [2021-11-23 00:39:00,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:00" (1/1) ... [2021-11-23 00:39:00,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 00:39:00,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 00:39:00,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 00:39:00,970 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 00:39:00,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:00" (1/1) ... [2021-11-23 00:39:00,983 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-23 00:39:00,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06589e01-ef11-47cb-a00d-dca3b06ed16e/bin/ukojak-LBtLqBUTdQ/z3 [2021-11-23 00:39:01,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06589e01-ef11-47cb-a00d-dca3b06ed16e/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-11-23 00:39:01,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06589e01-ef11-47cb-a00d-dca3b06ed16e/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-11-23 00:39:01,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 00:39:01,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 00:39:01,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-23 00:39:01,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-23 00:39:01,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 00:39:01,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 00:39:01,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-23 00:39:01,190 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 00:39:01,191 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 00:39:01,355 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 00:39:01,423 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 00:39:01,423 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-23 00:39:01,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:39:01 BoogieIcfgContainer [2021-11-23 00:39:01,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 00:39:01,427 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-11-23 00:39:01,427 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-11-23 00:39:01,437 INFO L275 PluginConnector]: CodeCheck initialized [2021-11-23 00:39:01,437 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:39:01" (1/1) ... [2021-11-23 00:39:01,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 00:39:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:01,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 12 states and 17 transitions. [2021-11-23 00:39:01,507 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2021-11-23 00:39:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-23 00:39:01,509 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:01,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:01,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:39:01,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:01,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 13 states and 18 transitions. [2021-11-23 00:39:01,862 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2021-11-23 00:39:01,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-23 00:39:01,862 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:01,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:01,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 00:39:01,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:39:02,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:39:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 14 states and 20 transitions. [2021-11-23 00:39:02,195 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2021-11-23 00:39:02,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-23 00:39:02,195 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:02,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 00:39:02,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:02,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 15 states and 22 transitions. [2021-11-23 00:39:02,415 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 22 transitions. [2021-11-23 00:39:02,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-23 00:39:02,416 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:02,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:02,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-23 00:39:02,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:39:02,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 00:39:02,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 00:39:02,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:02,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 18 states and 32 transitions. [2021-11-23 00:39:02,949 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 32 transitions. [2021-11-23 00:39:02,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-23 00:39:02,951 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:02,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:03,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-23 00:39:03,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:39:03,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:39:03,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:03,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 23 states and 43 transitions. [2021-11-23 00:39:03,902 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 43 transitions. [2021-11-23 00:39:03,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-23 00:39:03,903 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:03,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:03,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-23 00:39:03,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:39:04,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 00:39:04,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2021-11-23 00:39:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2021-11-23 00:39:04,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 00:39:04,512 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:04,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:04,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-23 00:39:04,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:39:04,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 00:39:04,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:39:04,889 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:39:04,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 39 [2021-11-23 00:39:05,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 00:39:06,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:06,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2021-11-23 00:39:06,320 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2021-11-23 00:39:06,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 00:39:06,321 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:06,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:06,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-23 00:39:06,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:39:06,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 00:39:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:06,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 30 states and 52 transitions. [2021-11-23 00:39:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 52 transitions. [2021-11-23 00:39:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-23 00:39:06,830 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:06,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:06,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-23 00:39:06,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:39:07,192 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 00:39:08,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 37 states and 65 transitions. [2021-11-23 00:39:08,902 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 65 transitions. [2021-11-23 00:39:08,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-23 00:39:08,903 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:08,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:08,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-23 00:39:08,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:39:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 00:39:09,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:09,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 38 states and 65 transitions. [2021-11-23 00:39:09,696 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 65 transitions. [2021-11-23 00:39:09,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:39:09,697 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:09,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:10,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-23 00:39:10,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:39:10,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 00:39:10,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:39:10,769 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:39:10,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 39 [2021-11-23 00:39:10,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:39:10,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:39:10,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:39:10,988 INFO L354 Elim1Store]: treesize reduction 112, result has 24.8 percent of original size [2021-11-23 00:39:10,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 8 case distinctions, treesize of input 64 treesize of output 82 [2021-11-23 00:39:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 00:39:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:12,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 39 states and 65 transitions. [2021-11-23 00:39:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 65 transitions. [2021-11-23 00:39:12,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:39:12,034 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:12,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:12,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:39:12,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:39:12,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:39:12,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:39:12,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:39:12,773 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:39:12,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:39:13,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:39:13,154 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:39:13,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:39:13,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:39:13,802 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:39:13,813 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:39:13,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:39:14,726 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:39:14,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:39:14,737 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:39:26,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:26,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 47 states and 96 transitions. [2021-11-23 00:39:26,641 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 96 transitions. [2021-11-23 00:39:26,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:39:26,642 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:26,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:26,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-23 00:39:26,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:39:26,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:39:27,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:39:27,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:39:27,887 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:39:27,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:39:28,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:39:29,353 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-11-23 00:39:29,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 36 [2021-11-23 00:39:29,977 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-11-23 00:39:29,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 36 [2021-11-23 00:39:29,989 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:39:57,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:39:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 49 states and 103 transitions. [2021-11-23 00:39:57,676 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 103 transitions. [2021-11-23 00:39:57,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:39:57,677 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:39:57,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:39:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:39:57,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 00:39:57,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:39:57,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:39:58,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:39:59,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:39:59,693 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:39:59,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:40:00,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:40:02,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:40:02,203 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:40:02,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 42 treesize of output 36 [2021-11-23 00:40:10,630 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:40:10,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 36 [2021-11-23 00:40:10,636 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:40:55,445 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= 1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse1 (= |c_ULTIMATE.start_main_~b~0#1.offset| 0))) (and .cse0 (= |c_ULTIMATE.start_main_~i~0#1| 1) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) .cse1 (not (and .cse0 .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) (< 1 c_~N~0) (<= c_~N~0 2) (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) is different from false [2021-11-23 00:40:59,943 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= 1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse1 (= |c_ULTIMATE.start_main_~b~0#1.offset| 0))) (and .cse0 (= |c_ULTIMATE.start_main_~i~0#1| 1) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) .cse1 (not (and .cse0 .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) (< 1 c_~N~0) (<= c_~N~0 2) (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|))))) is different from true [2021-11-23 00:41:00,696 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (not (and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse1)) (< 1 c_~N~0) (<= c_~N~0 2) (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) is different from false [2021-11-23 00:41:05,277 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (not (and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse1)) (< 1 c_~N~0) (<= c_~N~0 2) (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|))))) is different from true [2021-11-23 00:41:07,417 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) .cse1 (not (and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse1)) (< 1 c_~N~0) (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) is different from false [2021-11-23 00:41:14,129 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) .cse1 (not (and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse1)) (< 1 c_~N~0) (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|))))) is different from true [2021-11-23 00:41:16,719 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5 .cse6)) .cse5 (not (and (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (<= c_~N~0 1))) .cse6)) is different from false [2021-11-23 00:41:21,348 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5 .cse6)) .cse5 (not (and (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (<= c_~N~0 1))) .cse6))) is different from true [2021-11-23 00:41:23,346 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5 .cse6)) .cse5 (not (and (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (<= c_~N~0 1))) .cse6)) is different from false [2021-11-23 00:41:27,772 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5 .cse6)) .cse5 (not (and (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (<= c_~N~0 1))) .cse6))) is different from true [2021-11-23 00:41:33,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 55 states and 144 transitions. [2021-11-23 00:41:33,197 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 144 transitions. [2021-11-23 00:41:33,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:41:33,198 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:33,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:41:33,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-23 00:41:33,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:41:33,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:41:33,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:41:33,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:41:33,568 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:41:33,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:41:33,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:41:33,655 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-11-23 00:41:33,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 36 [2021-11-23 00:41:33,987 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-11-23 00:41:33,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 36 [2021-11-23 00:41:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:41:34,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:34,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 56 states and 146 transitions. [2021-11-23 00:41:34,021 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 146 transitions. [2021-11-23 00:41:34,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:41:34,022 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:34,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:41:34,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:41:34,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:41:34,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:41:34,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:41:34,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:41:34,463 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:41:34,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:41:34,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:41:34,710 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:41:34,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:41:34,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:41:34,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:41:34,762 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:41:34,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:41:35,323 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:41:35,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:41:35,333 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:41:35,902 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse2 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse3 (not (= |c_ULTIMATE.start_main_~c~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|))) (.cse0 (= 1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse4 (= |c_ULTIMATE.start_main_~b~0#1.offset| 0)) (.cse5 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))) (.cse6 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and .cse0 .cse1 .cse2 (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6)) .cse3 .cse4 (not (and .cse0 .cse4 .cse5)) (< 1 c_~N~0) (<= c_~N~0 2) .cse6)) is different from false [2021-11-23 00:41:36,448 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse2 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse3 (not (= |c_ULTIMATE.start_main_~c~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|))) (.cse0 (= 1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse4 (= |c_ULTIMATE.start_main_~b~0#1.offset| 0)) (.cse5 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))) (.cse6 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and .cse0 .cse1 .cse2 (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6)) .cse3 .cse4 (not (and .cse0 .cse4 .cse5)) (< 1 c_~N~0) (<= c_~N~0 2) .cse6))) is different from true [2021-11-23 00:41:37,132 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse5 (select .cse4 0))) (and (= (select .cse4 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse5 1) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse6 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse5 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse1 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse3 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (not (and .cse2 .cse1)) (not (and .cse2 .cse1 .cse3)) (< 1 c_~N~0) (<= c_~N~0 2) .cse3)) is different from false [2021-11-23 00:41:37,781 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse5 (select .cse4 0))) (and (= (select .cse4 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse5 1) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse6 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse5 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse1 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse3 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (not (and .cse2 .cse1)) (not (and .cse2 .cse1 .cse3)) (< 1 c_~N~0) (<= c_~N~0 2) .cse3))) is different from true [2021-11-23 00:41:38,427 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse5 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse6 (select .cse5 0))) (and (= (select .cse5 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse6 1) (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse7 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse6 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse3 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse4 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 .cse2 .cse3 .cse4)) .cse3 (not (and .cse2 .cse3)) (< 1 c_~N~0) .cse4)) is different from false [2021-11-23 00:41:39,085 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse5 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse6 (select .cse5 0))) (and (= (select .cse5 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse6 1) (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse7 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse6 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse3 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse4 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 .cse2 .cse3 .cse4)) .cse3 (not (and .cse2 .cse3)) (< 1 c_~N~0) .cse4))) is different from true [2021-11-23 00:41:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 57 states and 147 transitions. [2021-11-23 00:41:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 147 transitions. [2021-11-23 00:41:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:41:39,099 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:39,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:41:39,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-23 00:41:39,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:41:39,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:41:39,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:41:39,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:41:39,464 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:41:39,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:41:39,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:41:39,563 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-11-23 00:41:39,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 36 [2021-11-23 00:41:39,969 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-11-23 00:41:39,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 36 [2021-11-23 00:41:39,977 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:41:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:45,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 61 states and 184 transitions. [2021-11-23 00:41:45,969 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 184 transitions. [2021-11-23 00:41:45,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:41:45,970 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:45,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:41:46,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 00:41:46,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:41:46,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:41:46,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:41:46,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:41:46,333 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:41:46,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:41:46,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:41:46,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:41:46,414 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:41:46,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 42 treesize of output 36 [2021-11-23 00:41:48,576 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:41:48,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 36 [2021-11-23 00:41:48,581 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:41:49,251 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) (= |c_ULTIMATE.start_main_~i~0#1| 1) .cse1 (not (and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse1)) (< 1 c_~N~0) (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) is different from false [2021-11-23 00:41:50,628 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) (= |c_ULTIMATE.start_main_~i~0#1| 1) .cse1 (not (and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse1)) (< 1 c_~N~0) (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|))))) is different from true [2021-11-23 00:41:51,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:51,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 63 states and 196 transitions. [2021-11-23 00:41:51,439 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 196 transitions. [2021-11-23 00:41:51,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:41:51,440 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:51,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:41:51,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 00:41:51,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:41:51,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:41:51,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:41:51,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:41:51,800 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:41:51,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:41:51,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:41:51,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:41:51,887 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:41:51,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 42 treesize of output 36 [2021-11-23 00:41:54,144 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:41:54,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 36 [2021-11-23 00:41:54,152 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:41:54,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:54,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 64 states and 198 transitions. [2021-11-23 00:41:54,186 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 198 transitions. [2021-11-23 00:41:54,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:41:54,190 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:54,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:41:54,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:41:54,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:41:54,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:41:54,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:41:54,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:41:54,574 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:41:54,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:41:54,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:41:54,638 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:41:54,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:41:54,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:41:54,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:41:54,688 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:41:54,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:41:55,253 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:41:55,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:41:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:41:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 65 states and 200 transitions. [2021-11-23 00:41:55,301 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 200 transitions. [2021-11-23 00:41:55,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:41:55,310 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:55,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:41:55,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:41:55,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:41:55,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:41:55,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:41:55,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:41:55,661 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:41:55,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:41:55,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:41:55,729 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:41:55,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:41:55,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:41:55,764 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:41:55,776 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:41:55,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:41:56,307 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:41:56,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:41:56,314 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:41:56,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:56,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 66 states and 202 transitions. [2021-11-23 00:41:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 202 transitions. [2021-11-23 00:41:56,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:41:56,337 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:56,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:41:56,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:41:56,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:41:56,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:41:56,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:41:56,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:41:56,634 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:41:56,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:41:56,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:41:56,861 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:41:56,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:41:56,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:41:56,896 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:41:56,908 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:41:56,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:41:57,442 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:41:57,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:41:57,449 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:41:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 67 states and 204 transitions. [2021-11-23 00:41:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 204 transitions. [2021-11-23 00:41:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:41:57,503 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:57,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:41:57,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:41:57,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:41:57,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:41:57,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:41:57,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:41:57,860 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:41:57,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:41:57,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:41:57,917 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:41:57,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:41:57,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:41:57,955 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:41:57,968 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:41:57,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:41:58,270 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:41:58,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:41:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:41:58,966 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse5 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse6 (select .cse5 0))) (and (= (select .cse5 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse6 1) (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse7 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse6 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse3 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse4 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 .cse2 .cse3 .cse4)) .cse3 (not (and .cse2 .cse3)) (< 1 c_~N~0) .cse4)) is different from false [2021-11-23 00:41:59,596 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse5 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse6 (select .cse5 0))) (and (= (select .cse5 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse6 1) (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse7 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse6 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse3 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse4 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 .cse2 .cse3 .cse4)) .cse3 (not (and .cse2 .cse3)) (< 1 c_~N~0) .cse4))) is different from true [2021-11-23 00:41:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:41:59,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 68 states and 206 transitions. [2021-11-23 00:41:59,600 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 206 transitions. [2021-11-23 00:41:59,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:41:59,600 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:41:59,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:41:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:41:59,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-23 00:41:59,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:41:59,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:41:59,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:41:59,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:41:59,887 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:41:59,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:41:59,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:41:59,984 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-11-23 00:41:59,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 36 [2021-11-23 00:42:00,106 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-11-23 00:42:00,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 36 [2021-11-23 00:42:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:42:00,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:42:00,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 69 states and 208 transitions. [2021-11-23 00:42:00,137 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 208 transitions. [2021-11-23 00:42:00,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:42:00,139 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:42:00,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:42:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:42:00,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-23 00:42:00,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:42:00,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:42:00,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:42:00,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:42:00,492 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:42:00,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:42:00,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:42:00,589 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-11-23 00:42:00,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 36 [2021-11-23 00:42:00,949 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-11-23 00:42:00,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 36 [2021-11-23 00:42:00,954 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:42:00,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:42:00,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 70 states and 210 transitions. [2021-11-23 00:42:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 210 transitions. [2021-11-23 00:42:00,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:42:00,971 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:42:00,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:42:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:42:01,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-23 00:42:01,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:42:01,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:42:01,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:42:01,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:42:01,273 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:42:01,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:42:01,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:42:01,358 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-11-23 00:42:01,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 36 [2021-11-23 00:42:01,692 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-11-23 00:42:01,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 36 [2021-11-23 00:42:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:42:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:42:01,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 71 states and 212 transitions. [2021-11-23 00:42:01,718 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 212 transitions. [2021-11-23 00:42:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:42:01,719 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:42:01,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:42:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:42:02,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:42:02,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:42:02,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:42:02,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:42:02,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:42:02,162 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:42:02,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:42:02,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:42:02,374 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:42:02,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:42:02,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:42:02,404 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:42:02,416 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:42:02,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:42:02,857 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:42:02,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:42:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:42:02,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:42:02,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 72 states and 214 transitions. [2021-11-23 00:42:02,878 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 214 transitions. [2021-11-23 00:42:02,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:42:02,878 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:42:02,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:42:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:42:03,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:42:03,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:42:03,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:42:03,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:42:03,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:42:03,194 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:42:03,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:42:03,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:42:03,244 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:42:03,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:42:03,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:42:03,273 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:42:03,286 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:42:03,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:42:03,528 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:42:03,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:42:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:42:03,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:42:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 73 states and 216 transitions. [2021-11-23 00:42:03,584 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 216 transitions. [2021-11-23 00:42:03,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:42:03,585 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:42:03,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:42:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:42:03,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:42:03,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:42:03,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:42:03,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:42:03,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:42:03,840 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:42:03,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:42:04,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:42:04,033 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:42:04,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:42:04,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:42:04,060 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:42:04,069 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:42:04,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:42:04,466 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:42:04,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:42:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:42:04,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:42:04,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 74 states and 218 transitions. [2021-11-23 00:42:04,494 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 218 transitions. [2021-11-23 00:42:04,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:42:04,495 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:42:04,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:42:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:42:04,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 00:42:04,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:42:04,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:42:05,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:42:05,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:42:05,822 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:42:05,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:42:07,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:42:07,305 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-23 00:42:07,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:42:09,126 INFO L354 Elim1Store]: treesize reduction 156, result has 15.7 percent of original size [2021-11-23 00:42:09,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:42:23,952 INFO L354 Elim1Store]: treesize reduction 89, result has 8.2 percent of original size [2021-11-23 00:42:23,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 53 [2021-11-23 00:42:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:42:36,960 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse5 (select .cse4 0))) (and (= (select .cse4 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse5 1) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse6 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse5 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse3 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse2 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) (not (and .cse1 .cse2)) .cse3 (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (not (and .cse1 .cse3)) (not (and .cse1 .cse3 .cse2)) (< 1 c_~N~0) (<= c_~N~0 2) .cse2)) is different from false [2021-11-23 00:42:37,566 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse5 (select .cse4 0))) (and (= (select .cse4 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse5 1) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse6 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse5 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse3 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse2 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) (not (and .cse1 .cse2)) .cse3 (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (not (and .cse1 .cse3)) (not (and .cse1 .cse3 .cse2)) (< 1 c_~N~0) (<= c_~N~0 2) .cse2))) is different from true [2021-11-23 00:42:41,553 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse5 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5)) (not (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (< 1 c_~N~0) .cse5)) is different from false [2021-11-23 00:42:43,625 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse5 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5)) (not (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (< 1 c_~N~0) .cse5))) is different from true [2021-11-23 00:42:44,336 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse5 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5)) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (< 1 c_~N~0) .cse5)) is different from false [2021-11-23 00:42:45,799 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse5 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5)) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (< 1 c_~N~0) .cse5))) is different from true [2021-11-23 00:42:49,410 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse5 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5)) (not (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (< 1 c_~N~0) .cse5)) is different from false [2021-11-23 00:42:51,677 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse5 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5)) (not (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (< 1 c_~N~0) .cse5))) is different from true [2021-11-23 00:42:51,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:42:51,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 78 states and 255 transitions. [2021-11-23 00:42:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 255 transitions. [2021-11-23 00:42:51,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:42:51,681 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:42:51,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:42:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:42:51,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 00:42:51,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:42:51,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:42:51,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:42:51,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:42:51,924 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:42:51,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:42:51,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:42:51,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:42:51,983 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:42:51,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 42 treesize of output 36 [2021-11-23 00:42:54,150 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:42:54,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 36 [2021-11-23 00:42:54,155 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:42:54,803 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse7 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse7 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse7 c_~N~0)))))) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse6 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and .cse0 .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5)) (not (and .cse0 .cse1 .cse6 .cse5)) (not .cse6) (< 1 c_~N~0) .cse5)) is different from false [2021-11-23 00:42:55,439 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse0 (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse7 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse7 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse7 c_~N~0)))))) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse6 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and .cse0 .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5)) (not (and .cse0 .cse1 .cse6 .cse5)) (not .cse6) (< 1 c_~N~0) .cse5))) is different from true [2021-11-23 00:42:56,065 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse7 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse7 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse7 c_~N~0)))))) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse6 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and .cse0 .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5)) (not (and .cse0 .cse1 .cse6 .cse5)) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not .cse6) (< 1 c_~N~0) .cse5)) is different from false [2021-11-23 00:42:56,733 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse0 (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse7 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse7 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse7 c_~N~0)))))) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse6 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and .cse0 .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5)) (not (and .cse0 .cse1 .cse6 .cse5)) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not .cse6) (< 1 c_~N~0) .cse5))) is different from true [2021-11-23 00:42:57,373 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse7 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse7 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse7 c_~N~0)))))) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse2 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse3 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and .cse0 (not (and .cse0 .cse1 .cse2 .cse3)) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse5 (select .cse4 0))) (and (= (select .cse4 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse5 1) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse6 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse5 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse3)) (not .cse2) (< 1 c_~N~0) .cse3)) is different from false [2021-11-23 00:42:58,051 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse0 (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse7 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse7 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse7 c_~N~0)))))) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse2 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse3 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and .cse0 (not (and .cse0 .cse1 .cse2 .cse3)) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse5 (select .cse4 0))) (and (= (select .cse4 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse5 1) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse6 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse5 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse3)) (not .cse2) (< 1 c_~N~0) .cse3))) is different from true [2021-11-23 00:42:58,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:42:58,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 79 states and 258 transitions. [2021-11-23 00:42:58,054 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 258 transitions. [2021-11-23 00:42:58,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:42:58,055 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:42:58,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:42:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:42:58,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-23 00:42:58,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:42:58,311 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:42:58,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 19 [2021-11-23 00:42:58,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:42:58,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:42:58,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2021-11-23 00:42:59,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:42:59,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2021-11-23 00:42:59,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:42:59,420 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:42:59,430 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-23 00:42:59,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 48 [2021-11-23 00:43:00,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:00,106 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:43:00,114 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-23 00:43:00,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 60 [2021-11-23 00:43:00,363 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:43:00,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:00,381 INFO L354 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2021-11-23 00:43:00,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 83 treesize of output 74 [2021-11-23 00:43:03,577 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:43:11,380 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse11 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse13 (select .cse12 0))) (and (= (select .cse12 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse13 1) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse14 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse13 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse3 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse10 (= c_~N~0 .cse2))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) (not (and (= (select .cse1 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse2 1)) .cse3 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse7 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse6 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (select .cse9 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse4 (+ (select .cse7 8) .cse8))) (and (= .cse4 (+ .cse5 (select .cse6 0))) (= (select .cse6 8) 12) (= .cse5 (+ (select .cse7 0) .cse8)) (= (+ .cse5 6) .cse4)))))) .cse10)) (not (and .cse11 .cse10)) .cse3 (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (not (and .cse11 .cse3)) (not (and .cse11 .cse3 .cse10)) (< 1 c_~N~0) (<= c_~N~0 2) .cse10)))) is different from false [2021-11-23 00:43:12,110 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse11 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse13 (select .cse12 0))) (and (= (select .cse12 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse13 1) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse14 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse13 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse3 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse10 (= c_~N~0 .cse2))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) (not (and (= (select .cse1 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse2 1)) .cse3 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse7 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse8 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse6 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (select .cse9 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse4 (+ (select .cse7 8) .cse8))) (and (= .cse4 (+ .cse5 (select .cse6 0))) (= (select .cse6 8) 12) (= .cse5 (+ (select .cse7 0) .cse8)) (= (+ .cse5 6) .cse4)))))) .cse10)) (not (and .cse11 .cse10)) .cse3 (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (not (and .cse11 .cse3)) (not (and .cse11 .cse3 .cse10)) (< 1 c_~N~0) (<= c_~N~0 2) .cse10))))) is different from true [2021-11-23 00:43:13,718 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse0 (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse15 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse15 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse15 c_~N~0)))))) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse6 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (= c_~N~0 .cse8))) (and .cse0 .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5)) (not (and .cse0 .cse1 .cse6 .cse5)) (not (and .cse1 (= (select .cse7 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse8 1)) .cse6 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse13 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse11 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (select .cse14 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse9 (+ (select .cse12 8) .cse13))) (and (= .cse9 (+ .cse10 (select .cse11 0))) (= (select .cse11 8) 12) (= .cse10 (+ (select .cse12 0) .cse13)) (= (+ .cse10 6) .cse9)))))) .cse5)) (not .cse6) (< 1 c_~N~0) .cse5)))) is different from false [2021-11-23 00:43:14,383 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse0 (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse15 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse15 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse15 c_~N~0)))))) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse6 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (= c_~N~0 .cse8))) (and .cse0 .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5)) (not (and .cse0 .cse1 .cse6 .cse5)) (not (and .cse1 (= (select .cse7 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse8 1)) .cse6 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse13 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse11 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (select .cse14 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse9 (+ (select .cse12 8) .cse13))) (and (= .cse9 (+ .cse10 (select .cse11 0))) (= (select .cse11 8) 12) (= .cse10 (+ (select .cse12 0) .cse13)) (= (+ .cse10 6) .cse9)))))) .cse5)) (not .cse6) (< 1 c_~N~0) .cse5))))) is different from true [2021-11-23 00:43:15,045 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse0 (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse15 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse15 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse15 c_~N~0)))))) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse6 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (= c_~N~0 .cse8))) (and .cse0 .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5)) (not (and .cse0 .cse1 .cse6 .cse5)) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (and .cse1 (= (select .cse7 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse8 1)) .cse6 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse13 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse11 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (select .cse14 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse9 (+ (select .cse12 8) .cse13))) (and (= .cse9 (+ .cse10 (select .cse11 0))) (= (select .cse11 8) 12) (= .cse10 (+ (select .cse12 0) .cse13)) (= (+ .cse10 6) .cse9)))))) .cse5)) (not .cse6) (< 1 c_~N~0) .cse5)))) is different from false [2021-11-23 00:43:15,703 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse0 (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse15 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse15 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse15 c_~N~0)))))) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse6 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (= c_~N~0 .cse8))) (and .cse0 .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5)) (not (and .cse0 .cse1 .cse6 .cse5)) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (and .cse1 (= (select .cse7 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse8 1)) .cse6 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse13 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse11 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (select .cse14 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse9 (+ (select .cse12 8) .cse13))) (and (= .cse9 (+ .cse10 (select .cse11 0))) (= (select .cse11 8) 12) (= .cse10 (+ (select .cse12 0) .cse13)) (= (+ .cse10 6) .cse9)))))) .cse5)) (not .cse6) (< 1 c_~N~0) .cse5))))) is different from true [2021-11-23 00:43:16,731 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse0 (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse15 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse15 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse15 c_~N~0)))))) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse2 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse3 (= c_~N~0 .cse8))) (and .cse0 (not (and .cse0 .cse1 .cse2 .cse3)) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse5 (select .cse4 0))) (and (= (select .cse4 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse5 1) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse6 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse5 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse3)) (not (and (= (select .cse7 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse8 1)) .cse1 .cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse13 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse11 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (select .cse14 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse9 (+ (select .cse12 8) .cse13))) (and (= .cse9 (+ .cse10 (select .cse11 0))) (= (select .cse11 8) 12) (= .cse10 (+ (select .cse12 0) .cse13)) (= (+ .cse10 6) .cse9)))))) .cse3)) (not .cse2) (< 1 c_~N~0) .cse3)))) is different from false [2021-11-23 00:43:17,380 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse0 (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse15 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse15 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse15 c_~N~0)))))) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse2 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse3 (= c_~N~0 .cse8))) (and .cse0 (not (and .cse0 .cse1 .cse2 .cse3)) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse5 (select .cse4 0))) (and (= (select .cse4 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse5 1) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse6 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse5 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse3)) (not (and (= (select .cse7 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse8 1)) .cse1 .cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse13 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse11 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (select .cse14 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse9 (+ (select .cse12 8) .cse13))) (and (= .cse9 (+ .cse10 (select .cse11 0))) (= (select .cse11 8) 12) (= .cse10 (+ (select .cse12 0) .cse13)) (= (+ .cse10 6) .cse9)))))) .cse3)) (not .cse2) (< 1 c_~N~0) .cse3))))) is different from true [2021-11-23 00:43:17,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 80 states and 261 transitions. [2021-11-23 00:43:17,384 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 261 transitions. [2021-11-23 00:43:17,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:43:17,384 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:17,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:17,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 00:43:17,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:43:17,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:43:17,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:43:17,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:17,660 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:43:17,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:43:19,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:19,060 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-23 00:43:19,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:43:19,133 INFO L354 Elim1Store]: treesize reduction 156, result has 15.7 percent of original size [2021-11-23 00:43:19,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:43:28,057 INFO L354 Elim1Store]: treesize reduction 89, result has 8.2 percent of original size [2021-11-23 00:43:28,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 53 [2021-11-23 00:43:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:43:28,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 81 states and 276 transitions. [2021-11-23 00:43:28,092 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 276 transitions. [2021-11-23 00:43:28,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:43:28,093 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:28,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:28,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-23 00:43:28,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:43:28,267 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:43:28,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 19 [2021-11-23 00:43:28,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:43:28,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:28,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2021-11-23 00:43:28,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:28,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2021-11-23 00:43:28,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:28,399 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:43:28,406 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-23 00:43:28,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 48 [2021-11-23 00:43:28,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:28,835 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:43:28,845 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-23 00:43:28,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 60 [2021-11-23 00:43:29,115 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:43:29,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:29,133 INFO L354 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2021-11-23 00:43:29,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 83 treesize of output 74 [2021-11-23 00:43:31,114 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:43:31,845 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse7 (not (= |c_ULTIMATE.start_main_~c~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|))) (.cse10 (= 1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse8 (= |c_ULTIMATE.start_main_~b~0#1.offset| 0)) (.cse11 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))) (.cse9 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (not (and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse3 (select .cse4 0)) (.cse1 (select .cse4 8))) (and (= 1 .cse0) (= .cse1 12) (= (select .cse2 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (+ .cse3 .cse0)) (= (+ 6 .cse3) .cse1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5 .cse6 .cse7 .cse8 .cse9)) .cse10 .cse5 .cse6 (not (and .cse10 .cse5 .cse6 .cse7 .cse8 .cse11 .cse9)) .cse7 .cse8 (not (and .cse10 .cse8 .cse11)) (< 1 c_~N~0) (<= c_~N~0 2) .cse9)) is different from false [2021-11-23 00:43:32,463 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse5 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse7 (not (= |c_ULTIMATE.start_main_~c~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|))) (.cse10 (= 1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse8 (= |c_ULTIMATE.start_main_~b~0#1.offset| 0)) (.cse11 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))) (.cse9 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (not (and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse3 (select .cse4 0)) (.cse1 (select .cse4 8))) (and (= 1 .cse0) (= .cse1 12) (= (select .cse2 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (+ .cse3 .cse0)) (= (+ 6 .cse3) .cse1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5 .cse6 .cse7 .cse8 .cse9)) .cse10 .cse5 .cse6 (not (and .cse10 .cse5 .cse6 .cse7 .cse8 .cse11 .cse9)) .cse7 .cse8 (not (and .cse10 .cse8 .cse11)) (< 1 c_~N~0) (<= c_~N~0 2) .cse9))) is different from true [2021-11-23 00:43:35,543 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (= c_~N~0 .cse8))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5 .cse6)) (not (and .cse1 (= (select .cse7 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse8 1)) .cse5 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse13 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse11 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (select .cse14 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse9 (+ (select .cse12 8) .cse13))) (and (= .cse9 (+ .cse10 (select .cse11 0))) (= (select .cse11 8) 12) (= .cse10 (+ (select .cse12 0) .cse13)) (= (+ .cse10 6) .cse9)))))) .cse6)) .cse5 (not (and (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (<= c_~N~0 1))) .cse6)))) is different from false [2021-11-23 00:43:36,342 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (= c_~N~0 .cse8))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5 .cse6)) (not (and .cse1 (= (select .cse7 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse8 1)) .cse5 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse13 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse11 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (select .cse14 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse9 (+ (select .cse12 8) .cse13))) (and (= .cse9 (+ .cse10 (select .cse11 0))) (= (select .cse11 8) 12) (= .cse10 (+ (select .cse12 0) .cse13)) (= (+ .cse10 6) .cse9)))))) .cse6)) .cse5 (not (and (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (<= c_~N~0 1))) .cse6))))) is different from true [2021-11-23 00:43:37,068 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse8 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (= c_~N~0 .cse7))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5)) (not (and .cse1 (= (select .cse6 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse7 1)) .cse8 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse13 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse11 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (select .cse14 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse9 (+ (select .cse12 8) .cse13))) (and (= .cse9 (+ .cse10 (select .cse11 0))) (= (select .cse11 8) 12) (= .cse10 (+ (select .cse12 0) .cse13)) (= (+ .cse10 6) .cse9)))))) .cse5)) (not .cse8) (< 1 c_~N~0) .cse5)))) is different from false [2021-11-23 00:43:37,763 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse8 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (= c_~N~0 .cse7))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5)) (not (and .cse1 (= (select .cse6 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse7 1)) .cse8 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse13 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse11 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (select .cse14 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse9 (+ (select .cse12 8) .cse13))) (and (= .cse9 (+ .cse10 (select .cse11 0))) (= (select .cse11 8) 12) (= .cse10 (+ (select .cse12 0) .cse13)) (= (+ .cse10 6) .cse9)))))) .cse5)) (not .cse8) (< 1 c_~N~0) .cse5))))) is different from true [2021-11-23 00:43:37,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:37,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 83 states and 273 transitions. [2021-11-23 00:43:37,768 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 273 transitions. [2021-11-23 00:43:37,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:43:37,769 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:37,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:37,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 00:43:37,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:43:37,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:43:37,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:43:37,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:38,012 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:43:38,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:43:38,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:43:38,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:38,075 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:43:38,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 42 treesize of output 36 [2021-11-23 00:43:38,183 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:43:38,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 36 [2021-11-23 00:43:38,187 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:43:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:38,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 84 states and 274 transitions. [2021-11-23 00:43:38,211 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 274 transitions. [2021-11-23 00:43:38,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:43:38,212 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:38,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:38,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 00:43:38,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:43:38,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:43:38,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:43:38,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:38,466 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:43:38,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:43:38,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:43:38,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:38,548 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:43:38,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 42 treesize of output 36 [2021-11-23 00:43:40,893 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:43:40,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 36 [2021-11-23 00:43:40,897 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:43:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 85 states and 276 transitions. [2021-11-23 00:43:40,919 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 276 transitions. [2021-11-23 00:43:40,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:43:40,920 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:40,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:41,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 00:43:41,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:43:41,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:43:41,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:43:41,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:41,156 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:43:41,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:43:41,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:43:41,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:41,226 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:43:41,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 42 treesize of output 36 [2021-11-23 00:43:43,613 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:43:43,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 36 [2021-11-23 00:43:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:43:43,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:43,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 86 states and 278 transitions. [2021-11-23 00:43:43,647 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 278 transitions. [2021-11-23 00:43:43,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:43:43,647 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:43,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:43,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-23 00:43:43,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:43:43,895 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:43:43,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 19 [2021-11-23 00:43:43,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:43:43,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:43,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2021-11-23 00:43:43,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:43,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2021-11-23 00:43:44,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:44,267 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:43:44,274 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-23 00:43:44,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 48 [2021-11-23 00:43:44,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:44,765 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:43:44,774 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-23 00:43:44,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 60 [2021-11-23 00:43:45,033 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:43:45,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:45,052 INFO L354 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2021-11-23 00:43:45,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 83 treesize of output 74 [2021-11-23 00:43:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:43:48,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:48,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 88 states and 293 transitions. [2021-11-23 00:43:48,524 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 293 transitions. [2021-11-23 00:43:48,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:43:48,525 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:48,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:48,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-23 00:43:48,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:43:48,822 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:43:48,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 19 [2021-11-23 00:43:48,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:43:48,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:48,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2021-11-23 00:43:49,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:49,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2021-11-23 00:43:49,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:49,267 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:43:49,274 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-23 00:43:49,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 48 [2021-11-23 00:43:49,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:49,634 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:43:49,642 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-23 00:43:49,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 60 [2021-11-23 00:43:49,991 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:43:49,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:50,009 INFO L354 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2021-11-23 00:43:50,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 83 treesize of output 74 [2021-11-23 00:43:51,955 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:43:55,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:55,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 92 states and 315 transitions. [2021-11-23 00:43:55,736 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 315 transitions. [2021-11-23 00:43:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:43:55,737 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:55,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:55,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 00:43:55,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:43:55,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:43:56,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:43:56,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:56,062 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:43:56,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:43:56,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:43:56,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:56,153 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:43:56,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 42 treesize of output 36 [2021-11-23 00:43:58,608 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:43:58,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 36 [2021-11-23 00:43:58,612 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:43:58,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:43:58,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 93 states and 317 transitions. [2021-11-23 00:43:58,633 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 317 transitions. [2021-11-23 00:43:58,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:43:58,633 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:43:58,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:43:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:43:58,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:43:58,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:43:58,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:43:59,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:43:59,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:59,058 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:43:59,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:43:59,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:59,340 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:43:59,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:43:59,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:43:59,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:43:59,415 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:43:59,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:43:59,987 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:43:59,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:43:59,993 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:44:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:44:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 94 states and 318 transitions. [2021-11-23 00:44:00,019 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 318 transitions. [2021-11-23 00:44:00,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:44:00,020 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:44:00,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:44:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:44:00,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 00:44:00,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:44:00,311 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:44:00,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 19 [2021-11-23 00:44:00,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:44:00,892 INFO L354 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2021-11-23 00:44:00,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 27 treesize of output 22 [2021-11-23 00:44:01,756 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-23 00:44:01,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2021-11-23 00:44:02,259 INFO L354 Elim1Store]: treesize reduction 124, result has 16.2 percent of original size [2021-11-23 00:44:02,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 6 case distinctions, treesize of input 61 treesize of output 54 [2021-11-23 00:44:03,321 INFO L354 Elim1Store]: treesize reduction 130, result has 11.6 percent of original size [2021-11-23 00:44:03,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 68 treesize of output 64 [2021-11-23 00:44:03,782 INFO L354 Elim1Store]: treesize reduction 282, result has 12.4 percent of original size [2021-11-23 00:44:03,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 78 [2021-11-23 00:44:08,418 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:44:17,725 WARN L227 SmtUtils]: Spent 5.55s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 00:45:00,925 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse11 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse4 (not (= |c_ULTIMATE.start_main_~c~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|))) (.cse0 (= 1 (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse12 (= |c_ULTIMATE.start_main_~b~0#1.offset| 0)) (.cse13 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))) (.cse5 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (not (and .cse0 (= 7 (select .cse1 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8))) .cse2 (exists ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse3 |ULTIMATE.start_main_~a~0#1.offset|) 6) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse3 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 12)))) .cse4 .cse5)) (not (and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse10 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse9 (select .cse10 0)) (.cse7 (select .cse10 8))) (and (= 1 .cse6) (= .cse7 12) (= (select .cse8 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (+ .cse9 .cse6)) (= (+ 6 .cse9) .cse7) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse2 .cse11 .cse4 .cse12 .cse5)) .cse0 .cse2 .cse11 (not (and .cse0 .cse2 .cse11 .cse4 .cse12 .cse13 .cse5)) .cse4 .cse12 (not (and .cse0 .cse12 .cse13)) (< 1 c_~N~0) (<= c_~N~0 2) .cse5))) is different from false [2021-11-23 00:45:02,069 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse11 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse4 (not (= |c_ULTIMATE.start_main_~c~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|))) (.cse0 (= 1 (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse12 (= |c_ULTIMATE.start_main_~b~0#1.offset| 0)) (.cse13 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))) (.cse5 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (not (and .cse0 (= 7 (select .cse1 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8))) .cse2 (exists ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse3 |ULTIMATE.start_main_~a~0#1.offset|) 6) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse3 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 12)))) .cse4 .cse5)) (not (and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse10 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse9 (select .cse10 0)) (.cse7 (select .cse10 8))) (and (= 1 .cse6) (= .cse7 12) (= (select .cse8 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (+ .cse9 .cse6)) (= (+ 6 .cse9) .cse7) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse2 .cse11 .cse4 .cse12 .cse5)) .cse0 .cse2 .cse11 (not (and .cse0 .cse2 .cse11 .cse4 .cse12 .cse13 .cse5)) .cse4 .cse12 (not (and .cse0 .cse12 .cse13)) (< 1 c_~N~0) (<= c_~N~0 2) .cse5)))) is different from true [2021-11-23 00:45:08,039 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse14 (select .cse15 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse10 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse16 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse17 (select .cse16 0))) (and (= (select .cse16 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse17 1) (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse18 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse17 (select .cse18 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse2 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse1 (= (select .cse15 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse14 1))) (.cse9 (= c_~N~0 .cse14))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) (not (and .cse1 .cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse6 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse7 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse5 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (select .cse8 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse3 (+ (select .cse6 8) .cse7))) (and (= .cse3 (+ .cse4 (select .cse5 0))) (= (select .cse5 8) 12) (= .cse4 (+ (select .cse6 0) .cse7)) (= (+ .cse4 6) .cse3)))))) .cse9)) (not (and .cse10 .cse9)) .cse2 (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (not (and .cse10 .cse2)) (not (and .cse10 .cse2 .cse9)) (< 1 c_~N~0) (<= c_~N~0 2) (not (and .cse1 (exists ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse13 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse11 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select .cse11 |c_ULTIMATE.start_main_~c~0#1.offset|) (select .cse12 |ULTIMATE.start_main_~b~0#1.offset|)))) (= 7 (select .cse12 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (= (select .cse13 |ULTIMATE.start_main_~a~0#1.offset|) 6) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse13 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 12)))) .cse9)) .cse9)))) is different from false [2021-11-23 00:45:10,288 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse14 (select .cse15 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse10 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse16 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse17 (select .cse16 0))) (and (= (select .cse16 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse17 1) (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse18 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse17 (select .cse18 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse2 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse1 (= (select .cse15 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse14 1))) (.cse9 (= c_~N~0 .cse14))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) (not (and .cse1 .cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse6 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse7 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse5 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (select .cse8 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse3 (+ (select .cse6 8) .cse7))) (and (= .cse3 (+ .cse4 (select .cse5 0))) (= (select .cse5 8) 12) (= .cse4 (+ (select .cse6 0) .cse7)) (= (+ .cse4 6) .cse3)))))) .cse9)) (not (and .cse10 .cse9)) .cse2 (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (not (and .cse10 .cse2)) (not (and .cse10 .cse2 .cse9)) (< 1 c_~N~0) (<= c_~N~0 2) (not (and .cse1 (exists ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse13 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse11 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select .cse11 |c_ULTIMATE.start_main_~c~0#1.offset|) (select .cse12 |ULTIMATE.start_main_~b~0#1.offset|)))) (= 7 (select .cse12 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (= (select .cse13 |ULTIMATE.start_main_~a~0#1.offset|) 6) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse13 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 12)))) .cse9)) .cse9))))) is different from true [2021-11-23 00:45:15,316 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse17 (select .cse18 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse6 (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse19 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse19 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse19 c_~N~0)))))) (.cse0 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse1 (= (select .cse18 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse17 1))) (.cse10 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (= c_~N~0 .cse17))) (and (not (and .cse0 .cse1 (exists ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse2 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) (select .cse3 |ULTIMATE.start_main_~b~0#1.offset|)))) (= 7 (select .cse3 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (= (select .cse4 |ULTIMATE.start_main_~a~0#1.offset|) 6) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 12)))) .cse5)) .cse6 .cse0 (not (and .cse0 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse7 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse8 (select .cse7 0))) (and (= (select .cse7 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse8 1) (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse9 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse8 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5)) (not (and .cse6 .cse0 .cse10 .cse5)) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (and .cse0 .cse1 .cse10 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse14 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse15 (select .cse16 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse13 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (select .cse16 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse11 (+ (select .cse14 8) .cse15))) (and (= .cse11 (+ .cse12 (select .cse13 0))) (= (select .cse13 8) 12) (= .cse12 (+ (select .cse14 0) .cse15)) (= (+ .cse12 6) .cse11)))))) .cse5)) (not .cse10) (< 1 c_~N~0) .cse5)))) is different from false [2021-11-23 00:45:17,646 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse17 (select .cse18 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse6 (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse19 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse19 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse19 c_~N~0)))))) (.cse0 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse1 (= (select .cse18 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse17 1))) (.cse10 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (= c_~N~0 .cse17))) (and (not (and .cse0 .cse1 (exists ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse2 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) (select .cse3 |ULTIMATE.start_main_~b~0#1.offset|)))) (= 7 (select .cse3 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (= (select .cse4 |ULTIMATE.start_main_~a~0#1.offset|) 6) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 12)))) .cse5)) .cse6 .cse0 (not (and .cse0 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse7 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse8 (select .cse7 0))) (and (= (select .cse7 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse8 1) (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse9 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse8 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5)) (not (and .cse6 .cse0 .cse10 .cse5)) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (and .cse0 .cse1 .cse10 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse14 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse15 (select .cse16 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse13 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (select .cse16 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse11 (+ (select .cse14 8) .cse15))) (and (= .cse11 (+ .cse12 (select .cse13 0))) (= (select .cse13 8) 12) (= .cse12 (+ (select .cse14 0) .cse15)) (= (+ .cse12 6) .cse11)))))) .cse5)) (not .cse10) (< 1 c_~N~0) .cse5))))) is different from true [2021-11-23 00:45:20,432 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse17 (select .cse18 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse6 (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse19 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse19 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse19 c_~N~0)))))) (.cse0 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse1 (= (select .cse18 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse17 1))) (.cse10 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (= c_~N~0 .cse17))) (and (not (and .cse0 .cse1 (exists ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse2 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) (select .cse3 |ULTIMATE.start_main_~b~0#1.offset|)))) (= 7 (select .cse3 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (= (select .cse4 |ULTIMATE.start_main_~a~0#1.offset|) 6) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 12)))) .cse5)) .cse6 .cse0 (not (and .cse0 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse7 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse8 (select .cse7 0))) (and (= (select .cse7 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse8 1) (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse9 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse8 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5)) (not (and .cse6 .cse0 .cse10 .cse5)) (not (and .cse0 .cse1 .cse10 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse14 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse15 (select .cse16 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse13 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (select .cse16 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse11 (+ (select .cse14 8) .cse15))) (and (= .cse11 (+ .cse12 (select .cse13 0))) (= (select .cse13 8) 12) (= .cse12 (+ (select .cse14 0) .cse15)) (= (+ .cse12 6) .cse11)))))) .cse5)) (not .cse10) (< 1 c_~N~0) .cse5)))) is different from false [2021-11-23 00:45:22,660 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse17 (select .cse18 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse6 (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse19 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse19 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse19 c_~N~0)))))) (.cse0 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse1 (= (select .cse18 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse17 1))) (.cse10 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (= c_~N~0 .cse17))) (and (not (and .cse0 .cse1 (exists ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse2 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) (select .cse3 |ULTIMATE.start_main_~b~0#1.offset|)))) (= 7 (select .cse3 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (= (select .cse4 |ULTIMATE.start_main_~a~0#1.offset|) 6) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 12)))) .cse5)) .cse6 .cse0 (not (and .cse0 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse7 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse8 (select .cse7 0))) (and (= (select .cse7 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse8 1) (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse9 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse8 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5)) (not (and .cse6 .cse0 .cse10 .cse5)) (not (and .cse0 .cse1 .cse10 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse14 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse15 (select .cse16 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse13 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (select .cse16 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse11 (+ (select .cse14 8) .cse15))) (and (= .cse11 (+ .cse12 (select .cse13 0))) (= (select .cse13 8) 12) (= .cse12 (+ (select .cse14 0) .cse15)) (= (+ .cse12 6) .cse11)))))) .cse5)) (not .cse10) (< 1 c_~N~0) .cse5))))) is different from true [2021-11-23 00:45:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:45:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 101 states and 392 transitions. [2021-11-23 00:45:28,981 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 392 transitions. [2021-11-23 00:45:28,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:45:28,982 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:45:28,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:45:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:45:29,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:45:29,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:45:29,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:45:29,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:45:29,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:45:29,338 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:45:29,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:45:29,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:45:29,662 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:45:29,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:45:29,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:45:29,701 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:45:29,714 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:45:29,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:45:30,456 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:45:30,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:45:30,461 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:45:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:45:30,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 102 states and 393 transitions. [2021-11-23 00:45:30,481 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 393 transitions. [2021-11-23 00:45:30,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:45:30,481 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:45:30,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:45:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:45:30,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-23 00:45:30,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:45:30,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:45:30,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:45:30,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:45:30,791 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:45:30,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:45:30,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:45:30,857 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-11-23 00:45:30,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 36 [2021-11-23 00:45:31,445 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-11-23 00:45:31,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 36 [2021-11-23 00:45:31,449 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:45:31,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:45:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 103 states and 394 transitions. [2021-11-23 00:45:31,484 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 394 transitions. [2021-11-23 00:45:31,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:45:31,485 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:45:31,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:45:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:45:31,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-23 00:45:31,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:45:31,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:45:33,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:45:33,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:45:33,846 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:45:33,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:45:34,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:45:34,802 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:45:34,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:45:34,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:45:34,850 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:45:34,866 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:45:34,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 55 [2021-11-23 00:45:40,055 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-11-23 00:45:40,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 95 treesize of output 59 [2021-11-23 00:45:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:48:20,078 WARN L227 SmtUtils]: Spent 29.50s on a formula simplification. DAG size of input: 86 DAG size of output: 63 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 00:48:20,878 WARN L860 $PredicateComparison]: unable to prove that (not (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) (not (exists ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse1 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) (select .cse2 |ULTIMATE.start_main_~b~0#1.offset|)))) (= 7 (select .cse2 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (= (select .cse3 |ULTIMATE.start_main_~a~0#1.offset|) 6) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse3 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 12))))) (not (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse5 (select .cse4 0))) (and (= (select .cse4 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse5 1) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse6 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse5 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (< 1 c_~N~0) (<= c_~N~0 2) (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) is different from true [2021-11-23 00:48:26,260 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse22 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse21 (select .cse22 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse6 (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse23 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse23 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse23 c_~N~0)))))) (.cse0 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse1 (= (select .cse22 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse21 1))) (.cse10 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse14 (< 1 c_~N~0)) (.cse5 (= c_~N~0 .cse21))) (and (not (and .cse0 .cse1 (exists ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse2 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) (select .cse3 |ULTIMATE.start_main_~b~0#1.offset|)))) (= 7 (select .cse3 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (= (select .cse4 |ULTIMATE.start_main_~a~0#1.offset|) 6) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 12)))) .cse5)) .cse6 .cse0 (not (and .cse0 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse7 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse8 (select .cse7 0))) (and (= (select .cse7 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse8 1) (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse9 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse8 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5)) (not (and .cse6 .cse0 .cse10 .cse5)) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (and .cse0 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse11 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse12 (select .cse11 0))) (and (= (select .cse11 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse12 1) (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse13 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse12 (select .cse13 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse10 .cse14 (<= c_~N~0 2) .cse5)) (not (and .cse0 .cse1 .cse10 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse18 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse19 (select .cse20 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse17 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse16 (select .cse20 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse15 (+ (select .cse18 8) .cse19))) (and (= .cse15 (+ .cse16 (select .cse17 0))) (= (select .cse17 8) 12) (= .cse16 (+ (select .cse18 0) .cse19)) (= (+ .cse16 6) .cse15)))))) .cse5)) (not .cse10) .cse14 .cse5)))) is different from false [2021-11-23 00:48:27,052 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse22 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse21 (select .cse22 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse6 (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse23 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse23 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse23 c_~N~0)))))) (.cse0 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse1 (= (select .cse22 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse21 1))) (.cse10 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse14 (< 1 c_~N~0)) (.cse5 (= c_~N~0 .cse21))) (and (not (and .cse0 .cse1 (exists ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse2 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) (select .cse3 |ULTIMATE.start_main_~b~0#1.offset|)))) (= 7 (select .cse3 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (= (select .cse4 |ULTIMATE.start_main_~a~0#1.offset|) 6) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 12)))) .cse5)) .cse6 .cse0 (not (and .cse0 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse7 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse8 (select .cse7 0))) (and (= (select .cse7 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse8 1) (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse9 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse8 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5)) (not (and .cse6 .cse0 .cse10 .cse5)) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (and .cse0 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse11 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse12 (select .cse11 0))) (and (= (select .cse11 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse12 1) (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse13 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse12 (select .cse13 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse10 .cse14 (<= c_~N~0 2) .cse5)) (not (and .cse0 .cse1 .cse10 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse18 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse19 (select .cse20 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse17 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse16 (select .cse20 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse15 (+ (select .cse18 8) .cse19))) (and (= .cse15 (+ .cse16 (select .cse17 0))) (= (select .cse17 8) 12) (= .cse16 (+ (select .cse18 0) .cse19)) (= (+ .cse16 6) .cse15)))))) .cse5)) (not .cse10) .cse14 .cse5))))) is different from true [2021-11-23 00:48:27,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:48:27,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 105 states and 412 transitions. [2021-11-23 00:48:27,605 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 412 transitions. [2021-11-23 00:48:27,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:48:27,606 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:48:27,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:48:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:48:27,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:48:27,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:48:27,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:48:27,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:48:27,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:48:27,993 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:48:27,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:48:28,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:48:28,357 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:48:28,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:48:28,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:48:28,387 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:48:28,397 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:48:28,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:48:29,233 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:48:29,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:48:29,265 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:48:30,084 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse6 (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse20 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse20 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse20 c_~N~0)))))) (.cse7 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse17 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse18 (select .cse17 0))) (and (= (select .cse17 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse18 1) (let ((.cse19 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse19 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse18 (select .cse19 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse0 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse1 (= (select .cse16 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse15 1))) (.cse8 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (= c_~N~0 .cse15))) (and (not (and .cse0 .cse1 (exists ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse2 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) (select .cse3 |ULTIMATE.start_main_~b~0#1.offset|)))) (= 7 (select .cse3 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (= (select .cse4 |ULTIMATE.start_main_~a~0#1.offset|) 6) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 12)))) .cse5)) .cse6 .cse0 (not (and .cse0 .cse7 .cse5)) (not (and .cse6 .cse0 .cse8 .cse5)) (not (and .cse0 .cse7 .cse8 .cse5)) (not (and .cse0 .cse1 .cse8 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse13 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse11 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (select .cse14 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse9 (+ (select .cse12 8) .cse13))) (and (= .cse9 (+ .cse10 (select .cse11 0))) (= (select .cse11 8) 12) (= .cse10 (+ (select .cse12 0) .cse13)) (= (+ .cse10 6) .cse9)))))) .cse5)) (not .cse8) (< 1 c_~N~0) .cse5)))) is different from false [2021-11-23 00:48:30,910 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse6 (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse20 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse20 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse20 c_~N~0)))))) (.cse7 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse17 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse18 (select .cse17 0))) (and (= (select .cse17 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse18 1) (let ((.cse19 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse19 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse18 (select .cse19 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse0 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse1 (= (select .cse16 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse15 1))) (.cse8 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (= c_~N~0 .cse15))) (and (not (and .cse0 .cse1 (exists ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse2 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) (select .cse3 |ULTIMATE.start_main_~b~0#1.offset|)))) (= 7 (select .cse3 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (= (select .cse4 |ULTIMATE.start_main_~a~0#1.offset|) 6) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 12)))) .cse5)) .cse6 .cse0 (not (and .cse0 .cse7 .cse5)) (not (and .cse6 .cse0 .cse8 .cse5)) (not (and .cse0 .cse7 .cse8 .cse5)) (not (and .cse0 .cse1 .cse8 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse13 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse11 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (select .cse14 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse9 (+ (select .cse12 8) .cse13))) (and (= .cse9 (+ .cse10 (select .cse11 0))) (= (select .cse11 8) 12) (= .cse10 (+ (select .cse12 0) .cse13)) (= (+ .cse10 6) .cse9)))))) .cse5)) (not .cse8) (< 1 c_~N~0) .cse5))))) is different from true [2021-11-23 00:48:30,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:48:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 106 states and 414 transitions. [2021-11-23 00:48:30,916 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 414 transitions. [2021-11-23 00:48:30,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:48:30,916 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:48:30,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:48:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:48:31,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-23 00:48:31,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:48:31,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:48:31,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:48:31,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:48:31,481 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:48:31,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:48:31,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:48:31,582 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-11-23 00:48:31,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 36 [2021-11-23 00:48:32,299 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-11-23 00:48:32,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 36 [2021-11-23 00:48:32,305 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:48:32,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:48:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 107 states and 415 transitions. [2021-11-23 00:48:32,353 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 415 transitions. [2021-11-23 00:48:32,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:48:32,354 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:48:32,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:48:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:48:32,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 00:48:32,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:48:32,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:48:32,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:48:32,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:48:32,748 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:48:32,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:48:32,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:48:32,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:48:32,825 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:48:32,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 42 treesize of output 36 [2021-11-23 00:48:35,638 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:48:35,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 36 [2021-11-23 00:48:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:48:35,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:48:35,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 108 states and 417 transitions. [2021-11-23 00:48:35,692 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 417 transitions. [2021-11-23 00:48:35,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:48:35,693 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:48:35,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:48:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:48:35,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 00:48:35,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:48:35,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:48:35,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:48:35,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:48:35,961 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:48:35,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:48:36,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:48:36,023 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-23 00:48:36,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:48:36,091 INFO L354 Elim1Store]: treesize reduction 156, result has 15.7 percent of original size [2021-11-23 00:48:36,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:48:46,308 INFO L354 Elim1Store]: treesize reduction 89, result has 8.2 percent of original size [2021-11-23 00:48:46,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 53 [2021-11-23 00:48:46,314 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:48:46,998 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse5 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse6 (select .cse5 0))) (and (= (select .cse5 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse6 1) (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse7 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse6 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse4 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse3 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 .cse2 .cse3)) (not (and .cse1 .cse2 .cse4 .cse3)) .cse4 (not (and .cse2 .cse4)) (< 1 c_~N~0) .cse3)) is different from false [2021-11-23 00:48:47,667 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse5 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse6 (select .cse5 0))) (and (= (select .cse5 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse6 1) (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse7 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse6 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse4 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse3 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 .cse2 .cse3)) (not (and .cse1 .cse2 .cse4 .cse3)) .cse4 (not (and .cse2 .cse4)) (< 1 c_~N~0) .cse3))) is different from true [2021-11-23 00:48:47,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:48:47,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 109 states and 419 transitions. [2021-11-23 00:48:47,672 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 419 transitions. [2021-11-23 00:48:47,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:48:47,673 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:48:47,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:48:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:48:47,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-23 00:48:47,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:48:48,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:48:48,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:48:48,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:48:48,307 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:48:48,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:48:49,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:48:49,187 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:48:49,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:48:49,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:48:49,220 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:48:49,234 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:48:49,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 55 [2021-11-23 00:48:52,360 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-11-23 00:48:52,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 95 treesize of output 59 [2021-11-23 00:48:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:48:53,069 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse9 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse10 (select .cse9 0))) (and (= (select .cse9 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse10 1) (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse11 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse10 (select .cse11 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse4 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (< 1 c_~N~0)) (.cse3 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 .cse2 .cse3)) (not (and .cse1 .cse2 .cse4 .cse3)) .cse4 (not (and .cse2 .cse4)) .cse5 (not (and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse6 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse7 (select .cse6 0))) (and (= (select .cse6 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse7 1) (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse8 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse7 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse1 .cse4 .cse5 (<= c_~N~0 2) .cse3)) .cse3)) is different from false [2021-11-23 00:48:53,764 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse9 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse10 (select .cse9 0))) (and (= (select .cse9 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse10 1) (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse11 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse10 (select .cse11 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse4 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse5 (< 1 c_~N~0)) (.cse3 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 .cse2 .cse3)) (not (and .cse1 .cse2 .cse4 .cse3)) .cse4 (not (and .cse2 .cse4)) .cse5 (not (and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse6 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse7 (select .cse6 0))) (and (= (select .cse6 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse7 1) (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse8 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse7 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse1 .cse4 .cse5 (<= c_~N~0 2) .cse3)) .cse3))) is different from true [2021-11-23 00:48:53,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:48:53,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 110 states and 421 transitions. [2021-11-23 00:48:53,769 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 421 transitions. [2021-11-23 00:48:53,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:48:53,769 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:48:53,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:48:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:48:54,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:48:54,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:48:54,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:48:54,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:48:54,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:48:54,116 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:48:54,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:48:54,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:48:54,545 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:48:54,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:48:54,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:48:54,578 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:48:54,589 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:48:54,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:48:55,449 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:48:55,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:48:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:48:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:48:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 111 states and 423 transitions. [2021-11-23 00:48:55,478 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 423 transitions. [2021-11-23 00:48:55,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:48:55,478 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:48:55,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:48:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:48:55,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:48:55,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:48:55,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:48:55,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:48:55,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:48:55,894 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:48:55,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:48:55,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:48:55,961 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:48:55,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:48:56,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:48:56,041 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:48:56,054 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:48:56,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:48:56,964 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:48:56,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:48:56,970 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:48:57,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:48:57,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 112 states and 424 transitions. [2021-11-23 00:48:57,006 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 424 transitions. [2021-11-23 00:48:57,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:48:57,007 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:48:57,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:48:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:48:57,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 00:48:57,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:48:57,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:48:57,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:48:57,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:48:57,286 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:48:57,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:48:57,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:48:57,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:48:57,350 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:48:57,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 42 treesize of output 36 [2021-11-23 00:49:00,236 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:49:00,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 36 [2021-11-23 00:49:00,241 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:49:00,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:49:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 113 states and 426 transitions. [2021-11-23 00:49:00,270 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 426 transitions. [2021-11-23 00:49:00,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:49:00,271 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:49:00,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:49:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:49:00,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-23 00:49:00,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:49:00,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:49:00,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:49:00,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:00,519 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:49:00,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:49:00,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:49:00,587 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-11-23 00:49:00,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 36 [2021-11-23 00:49:01,347 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-11-23 00:49:01,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 36 [2021-11-23 00:49:01,352 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:49:01,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:49:01,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 114 states and 428 transitions. [2021-11-23 00:49:01,387 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 428 transitions. [2021-11-23 00:49:01,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:49:01,388 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:49:01,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:49:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:49:01,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 00:49:01,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:49:01,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:49:01,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:49:01,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:01,734 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:49:01,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:49:01,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:49:01,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:01,840 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:49:01,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 42 treesize of output 36 [2021-11-23 00:49:04,766 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:49:04,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 36 [2021-11-23 00:49:04,771 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:49:04,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:49:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 115 states and 429 transitions. [2021-11-23 00:49:04,808 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 429 transitions. [2021-11-23 00:49:04,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:49:04,808 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:49:04,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:49:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:49:05,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-23 00:49:05,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:49:05,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:49:05,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:49:05,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:05,177 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:49:05,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:49:05,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:49:05,281 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-11-23 00:49:05,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 36 [2021-11-23 00:49:05,746 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-11-23 00:49:05,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 36 [2021-11-23 00:49:05,750 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:49:05,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:49:05,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 116 states and 431 transitions. [2021-11-23 00:49:05,780 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 431 transitions. [2021-11-23 00:49:05,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:49:05,780 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:49:05,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:49:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:49:05,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 00:49:05,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:49:05,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:49:05,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:49:06,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:06,022 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:49:06,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:49:06,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:49:06,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:06,103 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:49:06,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 42 treesize of output 36 [2021-11-23 00:49:06,238 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:49:06,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 36 [2021-11-23 00:49:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:49:06,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:49:06,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 117 states and 433 transitions. [2021-11-23 00:49:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 433 transitions. [2021-11-23 00:49:06,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:49:06,267 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:49:06,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:49:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:49:06,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:49:06,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:49:06,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:49:06,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:49:06,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:06,660 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:49:06,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:49:06,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:06,752 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:49:06,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:49:06,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:06,787 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:49:06,797 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:49:06,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:49:07,735 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:49:07,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:49:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:49:07,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:49:07,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 118 states and 435 transitions. [2021-11-23 00:49:07,790 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 435 transitions. [2021-11-23 00:49:07,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:49:07,791 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:49:07,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:49:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:49:08,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:49:08,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:49:08,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:49:08,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:49:08,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:08,200 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:49:08,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:49:08,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:08,631 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:49:08,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:49:08,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:08,672 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:49:08,685 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:49:08,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:49:09,608 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:49:09,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:49:09,614 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:49:09,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:49:09,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 119 states and 437 transitions. [2021-11-23 00:49:09,647 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 437 transitions. [2021-11-23 00:49:09,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:49:09,647 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:49:09,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:49:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:49:09,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:49:09,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:49:09,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:49:10,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:49:10,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:10,076 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:49:10,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:49:10,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:10,177 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:49:10,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:49:10,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:10,213 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:49:10,226 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:49:10,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:49:11,136 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:49:11,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:49:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:49:11,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:49:11,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 120 states and 439 transitions. [2021-11-23 00:49:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 439 transitions. [2021-11-23 00:49:11,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:49:11,171 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:49:11,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:49:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:49:11,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-23 00:49:11,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:49:11,518 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:49:11,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 19 [2021-11-23 00:49:12,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:49:14,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:14,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2021-11-23 00:49:15,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:15,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-11-23 00:49:17,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:17,209 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:49:17,216 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-23 00:49:17,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 46 [2021-11-23 00:49:19,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:19,351 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:49:19,366 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-11-23 00:49:19,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 54 treesize of output 56 [2021-11-23 00:49:20,726 INFO L354 Elim1Store]: treesize reduction 206, result has 14.9 percent of original size [2021-11-23 00:49:20,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 67 treesize of output 70 [2021-11-23 00:49:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:49:42,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:49:42,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 122 states and 474 transitions. [2021-11-23 00:49:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 474 transitions. [2021-11-23 00:49:42,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:49:42,521 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:49:42,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:49:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:49:42,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:49:42,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:49:42,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:49:43,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:49:43,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:43,034 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:49:43,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:49:43,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:43,577 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:49:43,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:49:43,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:43,612 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:49:43,623 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:49:43,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:49:44,738 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:49:44,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:49:44,743 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:49:44,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:49:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 123 states and 476 transitions. [2021-11-23 00:49:44,776 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 476 transitions. [2021-11-23 00:49:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:49:44,776 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:49:44,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:49:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:49:45,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:49:45,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:49:45,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:49:45,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:49:45,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:45,154 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:49:45,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:49:45,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:45,731 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:49:45,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:49:45,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:45,768 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:49:45,783 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:49:45,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:49:46,855 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:49:46,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:49:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:49:46,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:49:46,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 124 states and 477 transitions. [2021-11-23 00:49:46,892 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 477 transitions. [2021-11-23 00:49:46,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:49:46,893 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:49:46,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:49:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:49:47,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:49:47,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:49:47,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:49:47,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:49:47,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:47,249 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:49:47,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:49:47,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:47,781 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:49:47,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:49:47,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:47,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:49:47,832 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:49:47,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:49:48,997 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:49:48,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:49:49,003 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:49:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:49:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 125 states and 478 transitions. [2021-11-23 00:49:49,034 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 478 transitions. [2021-11-23 00:49:49,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:49:49,034 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:49:49,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:49:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:49:49,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-23 00:49:49,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:49:49,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:49:49,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:49:49,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:49,286 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:49:49,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:49:49,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:49:49,382 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-11-23 00:49:49,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 36 [2021-11-23 00:49:50,423 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-11-23 00:49:50,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 36 [2021-11-23 00:49:50,428 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:49:50,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:49:50,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 126 states and 480 transitions. [2021-11-23 00:49:50,468 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 480 transitions. [2021-11-23 00:49:50,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:49:50,469 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:49:50,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:49:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:49:50,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-23 00:49:50,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:49:50,642 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:49:50,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 19 [2021-11-23 00:49:50,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:49:50,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:50,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2021-11-23 00:49:51,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:51,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2021-11-23 00:49:51,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:51,513 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:49:51,520 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-23 00:49:51,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 48 [2021-11-23 00:49:52,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:52,352 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:49:52,361 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-23 00:49:52,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 60 [2021-11-23 00:49:52,751 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:49:52,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:52,771 INFO L354 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2021-11-23 00:49:52,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 83 treesize of output 74 [2021-11-23 00:49:55,309 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:49:56,168 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse17 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse18 (select .cse17 0))) (and (= (select .cse17 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse18 1) (let ((.cse19 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse19 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse18 (select .cse19 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse13 (< 1 c_~N~0)) (.cse3 (= c_~N~0 .cse5))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 .cse2 .cse3)) (not (and (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse5 1)) .cse1 .cse6 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse9 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (select .cse12 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse7 (+ (select .cse10 8) .cse11))) (and (= .cse7 (+ .cse8 (select .cse9 0))) (= (select .cse9 8) 12) (= .cse8 (+ (select .cse10 0) .cse11)) (= (+ .cse8 6) .cse7)))))) .cse3)) (not (and .cse1 .cse2 .cse6 .cse3)) .cse6 (not (and .cse2 .cse6)) .cse13 (not (and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse14 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse15 (select .cse14 0))) (and (= (select .cse14 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse15 1) (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse16 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse15 (select .cse16 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse1 .cse6 .cse13 (<= c_~N~0 2) .cse3)) .cse3)))) is different from false [2021-11-23 00:49:57,002 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse17 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse18 (select .cse17 0))) (and (= (select .cse17 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse18 1) (let ((.cse19 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse19 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse18 (select .cse19 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse13 (< 1 c_~N~0)) (.cse3 (= c_~N~0 .cse5))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 .cse2 .cse3)) (not (and (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse5 1)) .cse1 .cse6 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse9 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (select .cse12 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse7 (+ (select .cse10 8) .cse11))) (and (= .cse7 (+ .cse8 (select .cse9 0))) (= (select .cse9 8) 12) (= .cse8 (+ (select .cse10 0) .cse11)) (= (+ .cse8 6) .cse7)))))) .cse3)) (not (and .cse1 .cse2 .cse6 .cse3)) .cse6 (not (and .cse2 .cse6)) .cse13 (not (and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse14 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse15 (select .cse14 0))) (and (= (select .cse14 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse15 1) (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse16 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse15 (select .cse16 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse1 .cse6 .cse13 (<= c_~N~0 2) .cse3)) .cse3))))) is different from true [2021-11-23 00:49:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:49:57,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 127 states and 482 transitions. [2021-11-23 00:49:57,007 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 482 transitions. [2021-11-23 00:49:57,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:49:57,008 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:49:57,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:49:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:49:57,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:49:57,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:49:57,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:49:57,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:49:57,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:57,380 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:49:57,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:49:57,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:57,847 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:49:57,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:49:57,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:57,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:49:57,902 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:49:57,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:49:58,880 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:49:58,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:49:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:49:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:49:58,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 128 states and 484 transitions. [2021-11-23 00:49:58,917 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 484 transitions. [2021-11-23 00:49:58,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:49:58,918 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:49:58,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:49:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:49:59,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:49:59,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:49:59,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:49:59,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:49:59,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:59,176 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:49:59,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:49:59,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:59,665 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:49:59,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:49:59,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:49:59,704 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:49:59,719 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:49:59,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:50:00,893 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:50:00,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:50:00,898 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:50:01,788 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse19 (select .cse20 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse6 (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse24 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse24 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse24 c_~N~0)))))) (.cse7 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse21 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse22 (select .cse21 0))) (and (= (select .cse21 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse22 1) (let ((.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse23 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse22 (select .cse23 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse0 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse1 (= (select .cse20 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse19 1))) (.cse8 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse12 (< 1 c_~N~0)) (.cse5 (= c_~N~0 .cse19))) (and (not (and .cse0 .cse1 (exists ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse2 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) (select .cse3 |ULTIMATE.start_main_~b~0#1.offset|)))) (= 7 (select .cse3 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (= (select .cse4 |ULTIMATE.start_main_~a~0#1.offset|) 6) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 12)))) .cse5)) .cse6 .cse0 (not (and .cse0 .cse7 .cse5)) (not (and .cse6 .cse0 .cse8 .cse5)) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (and .cse0 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse9 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse10 (select .cse9 0))) (and (= (select .cse9 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse10 1) (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse11 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse10 (select .cse11 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse8 .cse12 (<= c_~N~0 2) .cse5)) (not (and .cse0 .cse7 .cse8 .cse5)) (not (and .cse0 .cse1 .cse8 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse16 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse17 (select .cse18 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse15 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse14 (select .cse18 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse13 (+ (select .cse16 8) .cse17))) (and (= .cse13 (+ .cse14 (select .cse15 0))) (= (select .cse15 8) 12) (= .cse14 (+ (select .cse16 0) .cse17)) (= (+ .cse14 6) .cse13)))))) .cse5)) (not .cse8) .cse12 .cse5)))) is different from false [2021-11-23 00:50:02,627 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse19 (select .cse20 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse6 (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse24 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse24 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse24 c_~N~0)))))) (.cse7 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse21 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse22 (select .cse21 0))) (and (= (select .cse21 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse22 1) (let ((.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse23 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse22 (select .cse23 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse0 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse1 (= (select .cse20 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse19 1))) (.cse8 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse12 (< 1 c_~N~0)) (.cse5 (= c_~N~0 .cse19))) (and (not (and .cse0 .cse1 (exists ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse2 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) (select .cse3 |ULTIMATE.start_main_~b~0#1.offset|)))) (= 7 (select .cse3 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (= (select .cse4 |ULTIMATE.start_main_~a~0#1.offset|) 6) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse4 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 12)))) .cse5)) .cse6 .cse0 (not (and .cse0 .cse7 .cse5)) (not (and .cse6 .cse0 .cse8 .cse5)) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (and .cse0 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse9 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse10 (select .cse9 0))) (and (= (select .cse9 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse10 1) (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse11 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse10 (select .cse11 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse8 .cse12 (<= c_~N~0 2) .cse5)) (not (and .cse0 .cse7 .cse8 .cse5)) (not (and .cse0 .cse1 .cse8 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse16 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse17 (select .cse18 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse15 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse14 (select .cse18 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse13 (+ (select .cse16 8) .cse17))) (and (= .cse13 (+ .cse14 (select .cse15 0))) (= (select .cse15 8) 12) (= .cse14 (+ (select .cse16 0) .cse17)) (= (+ .cse14 6) .cse13)))))) .cse5)) (not .cse8) .cse12 .cse5))))) is different from true [2021-11-23 00:50:02,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:50:02,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 129 states and 487 transitions. [2021-11-23 00:50:02,638 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 487 transitions. [2021-11-23 00:50:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:50:02,639 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:50:02,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:50:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:50:02,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:50:02,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:50:02,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:50:02,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:50:02,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:50:02,958 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:50:02,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:50:03,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:50:03,455 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:50:03,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:50:03,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:50:03,491 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:50:03,502 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:50:03,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:50:04,677 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:50:04,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:50:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:50:04,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:50:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 130 states and 490 transitions. [2021-11-23 00:50:04,716 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 490 transitions. [2021-11-23 00:50:04,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:50:04,717 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:50:04,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:50:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:50:04,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-23 00:50:04,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:50:04,960 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:50:04,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 19 [2021-11-23 00:50:04,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:50:05,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:50:05,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2021-11-23 00:50:05,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:50:05,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2021-11-23 00:50:05,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:50:05,425 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:50:05,432 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-23 00:50:05,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 48 [2021-11-23 00:50:06,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:50:06,267 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:50:06,276 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-23 00:50:06,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 60 [2021-11-23 00:50:06,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:50:06,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:50:06,884 INFO L354 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2021-11-23 00:50:06,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 83 treesize of output 74 [2021-11-23 00:50:09,553 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:50:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:50:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 131 states and 492 transitions. [2021-11-23 00:50:09,589 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 492 transitions. [2021-11-23 00:50:09,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:50:09,590 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:50:09,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:50:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:50:09,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:50:09,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:50:09,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:50:09,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:50:09,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:50:09,996 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:50:09,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:50:10,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:50:10,092 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:50:10,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:50:10,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:50:10,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:50:10,161 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:50:10,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:50:11,459 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:50:11,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:50:11,464 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:50:11,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:50:11,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 132 states and 495 transitions. [2021-11-23 00:50:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 495 transitions. [2021-11-23 00:50:11,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:50:11,498 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:50:11,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:50:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:50:11,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:50:11,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:50:11,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:50:11,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:50:11,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:50:11,926 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:50:11,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:50:12,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:50:12,434 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:50:12,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:50:12,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:50:12,470 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:50:12,481 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:50:12,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:50:13,681 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:50:13,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:50:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:50:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:50:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 133 states and 498 transitions. [2021-11-23 00:50:13,720 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 498 transitions. [2021-11-23 00:50:13,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:50:13,720 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:50:13,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:50:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:50:13,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:50:13,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:50:13,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:50:14,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:50:14,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:50:14,063 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:50:14,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:50:14,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:50:14,572 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:50:14,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:50:14,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:50:14,616 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:50:14,627 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:50:14,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:50:15,672 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:50:15,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:50:15,693 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:50:15,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:50:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 134 states and 500 transitions. [2021-11-23 00:50:15,731 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 500 transitions. [2021-11-23 00:50:15,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:50:15,731 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:50:15,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:50:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:50:15,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-23 00:50:15,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:50:15,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:50:18,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:50:20,098 INFO L354 Elim1Store]: treesize reduction 54, result has 31.6 percent of original size [2021-11-23 00:50:20,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:50:22,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:50:23,432 INFO L354 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2021-11-23 00:50:23,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 36 [2021-11-23 00:50:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:51:00,533 WARN L227 SmtUtils]: Spent 14.22s on a formula simplification. DAG size of input: 94 DAG size of output: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 00:51:01,356 WARN L860 $PredicateComparison]: unable to prove that (not (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (not (exists ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse1 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) (select .cse2 |ULTIMATE.start_main_~b~0#1.offset|)))) (= 7 (select .cse2 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (= (select .cse3 |ULTIMATE.start_main_~a~0#1.offset|) 6) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse3 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 12))))) (<= 1 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (< 1 c_~N~0) (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)) (not (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse5 (select .cse4 0))) (and (= (select .cse4 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse5 1) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse6 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse5 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))))) is different from true [2021-11-23 00:51:12,187 WARN L227 SmtUtils]: Spent 9.78s on a formula simplification. DAG size of input: 73 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 00:51:14,005 WARN L860 $PredicateComparison]: unable to prove that (not (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) (= |c_ULTIMATE.start_main_~i~0#1| 1) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (< 1 c_~N~0) (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)) (not (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse1 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse2 (select .cse1 0))) (and (= (select .cse1 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse2 1) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse3 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse2 (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))))) is different from true [2021-11-23 00:51:14,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:51:14,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 136 states and 495 transitions. [2021-11-23 00:51:14,010 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 495 transitions. [2021-11-23 00:51:14,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:51:14,010 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:51:14,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:51:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:51:14,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 00:51:14,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:51:14,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:51:14,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:51:14,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:14,361 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:51:14,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:51:14,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:51:14,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:14,477 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:51:14,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 42 treesize of output 36 [2021-11-23 00:51:17,381 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:51:17,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 36 [2021-11-23 00:51:17,387 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:51:17,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:51:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 137 states and 497 transitions. [2021-11-23 00:51:17,417 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 497 transitions. [2021-11-23 00:51:17,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:51:17,418 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:51:17,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:51:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:51:17,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:51:17,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:51:17,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:51:17,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:51:17,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:17,766 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:51:17,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:51:18,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:18,324 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:51:18,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:51:18,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:18,359 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:51:18,370 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:51:18,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:51:18,904 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:51:18,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:51:18,909 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:51:18,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:51:18,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 138 states and 499 transitions. [2021-11-23 00:51:18,946 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 499 transitions. [2021-11-23 00:51:18,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:51:18,947 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:51:18,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:51:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:51:19,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:51:19,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:51:19,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:51:19,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:51:19,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:19,395 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:51:19,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:51:19,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:19,469 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:51:19,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:51:19,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:19,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:51:19,528 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:51:19,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:51:20,660 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:51:20,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:51:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:51:20,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:51:20,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 139 states and 501 transitions. [2021-11-23 00:51:20,703 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 501 transitions. [2021-11-23 00:51:20,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:51:20,704 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:51:20,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:51:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:51:20,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:51:20,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:51:20,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:51:21,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:51:21,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:21,023 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:51:21,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:51:21,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:21,599 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:51:21,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:51:21,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:21,643 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:51:21,664 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:51:21,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:51:22,919 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:51:22,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:51:22,931 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:51:22,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:51:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 140 states and 503 transitions. [2021-11-23 00:51:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 503 transitions. [2021-11-23 00:51:22,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:51:22,974 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:51:22,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:51:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:51:23,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-23 00:51:23,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:51:23,189 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:51:23,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 19 [2021-11-23 00:51:23,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:51:23,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:23,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2021-11-23 00:51:23,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:23,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2021-11-23 00:51:24,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:24,083 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:51:24,091 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-23 00:51:24,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 48 [2021-11-23 00:51:25,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:25,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:51:25,095 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-23 00:51:25,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 60 [2021-11-23 00:51:25,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:51:25,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:25,525 INFO L354 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2021-11-23 00:51:25,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 83 treesize of output 74 [2021-11-23 00:51:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:51:29,159 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (= c_~N~0 .cse8))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5 .cse6)) (not (and .cse1 (= (select .cse7 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse8 1)) .cse5 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse13 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse11 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (select .cse14 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse9 (+ (select .cse12 8) .cse13))) (and (= .cse9 (+ .cse10 (select .cse11 0))) (= (select .cse11 8) 12) (= .cse10 (+ (select .cse12 0) .cse13)) (= (+ .cse10 6) .cse9)))))) .cse6)) .cse5 (not (and (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (<= c_~N~0 1))) .cse6)))) is different from false [2021-11-23 00:51:29,994 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (= c_~N~0 .cse8))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse3 1) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse5 .cse6)) (not (and .cse1 (= (select .cse7 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse8 1)) .cse5 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse13 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse11 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (select .cse14 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse9 (+ (select .cse12 8) .cse13))) (and (= .cse9 (+ .cse10 (select .cse11 0))) (= (select .cse11 8) 12) (= .cse10 (+ (select .cse12 0) .cse13)) (= (+ .cse10 6) .cse9)))))) .cse6)) .cse5 (not (and (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (<= c_~N~0 1))) .cse6))))) is different from true [2021-11-23 00:51:30,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:51:30,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 141 states and 505 transitions. [2021-11-23 00:51:30,001 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 505 transitions. [2021-11-23 00:51:30,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:51:30,001 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:51:30,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:51:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:51:30,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:51:30,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:51:30,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:51:30,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:51:30,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:30,299 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:51:30,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:51:30,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:30,870 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:51:30,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:51:30,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:30,911 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:51:30,922 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:51:30,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:51:32,196 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:51:32,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:51:32,201 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:51:32,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:51:32,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 142 states and 507 transitions. [2021-11-23 00:51:32,253 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 507 transitions. [2021-11-23 00:51:32,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:51:32,253 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:51:32,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:51:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:51:32,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:51:32,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:51:32,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:51:32,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:51:32,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:32,705 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:51:32,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:51:32,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:32,782 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:51:32,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:51:32,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:32,821 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:51:32,837 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:51:32,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:51:34,112 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:51:34,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:51:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:51:34,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:51:34,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 143 states and 509 transitions. [2021-11-23 00:51:34,154 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 509 transitions. [2021-11-23 00:51:34,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:51:34,154 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:51:34,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:51:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:51:34,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 00:51:34,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:51:34,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:51:34,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:51:34,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:34,560 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:51:34,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:51:34,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:51:34,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:34,637 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:51:34,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 42 treesize of output 36 [2021-11-23 00:51:37,896 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:51:37,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 36 [2021-11-23 00:51:37,901 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:51:37,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:51:37,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 144 states and 511 transitions. [2021-11-23 00:51:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 511 transitions. [2021-11-23 00:51:37,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:51:37,956 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:51:37,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:51:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:51:38,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:51:38,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:51:38,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:51:38,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:51:38,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:38,440 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:51:38,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:51:39,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:39,039 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:51:39,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:51:39,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:39,076 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:51:39,089 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:51:39,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:51:40,403 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:51:40,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:51:40,409 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:51:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:51:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 145 states and 513 transitions. [2021-11-23 00:51:40,444 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 513 transitions. [2021-11-23 00:51:40,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:51:40,444 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:51:40,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:51:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:51:40,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-23 00:51:40,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:51:40,678 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:51:40,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 19 [2021-11-23 00:51:40,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:51:40,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:40,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2021-11-23 00:51:41,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:41,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2021-11-23 00:51:41,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:41,485 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:51:41,492 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-23 00:51:41,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 48 [2021-11-23 00:51:42,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:42,530 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:51:42,539 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-23 00:51:42,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 60 [2021-11-23 00:51:43,184 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:51:43,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:43,204 INFO L354 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2021-11-23 00:51:43,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 83 treesize of output 74 [2021-11-23 00:51:45,889 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:51:45,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:51:45,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 146 states and 515 transitions. [2021-11-23 00:51:45,945 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 515 transitions. [2021-11-23 00:51:45,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:51:45,945 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:51:45,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:51:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:51:46,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 00:51:46,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:51:46,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:51:46,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:51:46,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:46,338 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:51:46,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:51:46,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:51:46,421 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-23 00:51:46,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:51:46,499 INFO L354 Elim1Store]: treesize reduction 156, result has 15.7 percent of original size [2021-11-23 00:51:46,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:51:57,183 INFO L354 Elim1Store]: treesize reduction 89, result has 8.2 percent of original size [2021-11-23 00:51:57,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 53 [2021-11-23 00:51:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:51:57,870 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse5 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse6 (select .cse5 0))) (and (= (select .cse5 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse6 1) (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse7 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse6 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse4 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse3 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 .cse2 .cse3)) (not (and .cse1 .cse2 .cse4 .cse3)) .cse4 (not (and .cse2 .cse4)) (< 1 c_~N~0) .cse3)) is different from false [2021-11-23 00:51:58,550 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse5 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse6 (select .cse5 0))) (and (= (select .cse5 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse6 1) (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse7 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse6 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse4 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse3 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 .cse2 .cse3)) (not (and .cse1 .cse2 .cse4 .cse3)) .cse4 (not (and .cse2 .cse4)) (< 1 c_~N~0) .cse3))) is different from true [2021-11-23 00:51:59,362 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse13 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse14 (select .cse13 0))) (and (= (select .cse13 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse14 1) (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse15 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse14 (select .cse15 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse4 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse3 (= c_~N~0 .cse6))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 .cse2 .cse3)) (not (and .cse1 .cse2 .cse4 .cse3)) (not (and .cse1 (= (select .cse5 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse6 1)) .cse4 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse9 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (select .cse12 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse7 (+ (select .cse10 8) .cse11))) (and (= .cse7 (+ .cse8 (select .cse9 0))) (= (select .cse9 8) 12) (= .cse8 (+ (select .cse10 0) .cse11)) (= (+ .cse8 6) .cse7)))))) .cse3)) .cse4 (not (and (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (<= c_~N~0 1))) .cse3)))) is different from false [2021-11-23 00:52:00,180 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse13 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse14 (select .cse13 0))) (and (= (select .cse13 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse14 1) (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse15 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse14 (select .cse15 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse4 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse3 (= c_~N~0 .cse6))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 .cse2 .cse3)) (not (and .cse1 .cse2 .cse4 .cse3)) (not (and .cse1 (= (select .cse5 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse6 1)) .cse4 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse9 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (select .cse12 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse7 (+ (select .cse10 8) .cse11))) (and (= .cse7 (+ .cse8 (select .cse9 0))) (= (select .cse9 8) 12) (= .cse8 (+ (select .cse10 0) .cse11)) (= (+ .cse8 6) .cse7)))))) .cse3)) .cse4 (not (and (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (<= c_~N~0 1))) .cse3))))) is different from true [2021-11-23 00:52:00,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:52:00,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 147 states and 518 transitions. [2021-11-23 00:52:00,192 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 518 transitions. [2021-11-23 00:52:00,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:52:00,192 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:52:00,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:52:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:52:00,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:52:00,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:52:00,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:52:00,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:52:00,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:00,514 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:52:00,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:52:01,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:01,094 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:52:01,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:52:01,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:01,131 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:52:01,149 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:52:01,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:52:01,738 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:52:01,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:52:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:52:01,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:52:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 148 states and 521 transitions. [2021-11-23 00:52:01,780 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 521 transitions. [2021-11-23 00:52:01,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:52:01,781 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:52:01,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:52:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:52:02,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-23 00:52:02,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:52:02,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:52:02,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:52:02,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:02,147 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:52:02,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:52:03,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:03,363 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:52:03,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:52:03,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:03,393 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:52:03,412 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:52:03,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 55 [2021-11-23 00:52:05,379 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-11-23 00:52:05,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 95 treesize of output 59 [2021-11-23 00:52:05,387 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:52:06,103 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse9 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse10 (select .cse9 0))) (and (= (select .cse9 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse10 1) (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse11 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse10 (select .cse11 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse7 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse8 (< 1 c_~N~0)) (.cse3 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 .cse2 .cse3)) (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse5 (select .cse4 0))) (and (= (select .cse4 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse5 1) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse6 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse5 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse7 .cse8 (<= c_~N~0 2) .cse3)) (not (and .cse1 .cse2 .cse7 .cse3)) .cse7 (not (and .cse2 .cse7)) .cse8 .cse3)) is different from false [2021-11-23 00:52:06,779 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse9 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse10 (select .cse9 0))) (and (= (select .cse9 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse10 1) (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse11 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse10 (select .cse11 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse7 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse8 (< 1 c_~N~0)) (.cse3 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 .cse2 .cse3)) (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse5 (select .cse4 0))) (and (= (select .cse4 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse5 1) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse6 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse5 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse7 .cse8 (<= c_~N~0 2) .cse3)) (not (and .cse1 .cse2 .cse7 .cse3)) .cse7 (not (and .cse2 .cse7)) .cse8 .cse3))) is different from true [2021-11-23 00:52:07,580 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse16 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse17 (select .cse16 0))) (and (= (select .cse16 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse17 1) (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse18 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse17 (select .cse18 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse7 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse3 (= c_~N~0 .cse9))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 .cse2 .cse3)) (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse5 (select .cse4 0))) (and (= (select .cse4 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse5 1) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse6 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse5 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse7 (< 1 c_~N~0) (<= c_~N~0 2) .cse3)) (not (and .cse1 .cse2 .cse7 .cse3)) (not (and .cse1 (= (select .cse8 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse9 1)) .cse7 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse13 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse14 (select .cse15 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse11 (select .cse15 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse10 (+ (select .cse13 8) .cse14))) (and (= .cse10 (+ .cse11 (select .cse12 0))) (= (select .cse12 8) 12) (= .cse11 (+ (select .cse13 0) .cse14)) (= (+ .cse11 6) .cse10)))))) .cse3)) .cse7 (not (and (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (<= c_~N~0 1))) .cse3)))) is different from false [2021-11-23 00:52:08,431 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse16 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse17 (select .cse16 0))) (and (= (select .cse16 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse17 1) (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse18 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse17 (select .cse18 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse7 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse3 (= c_~N~0 .cse9))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 .cse2 .cse3)) (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse5 (select .cse4 0))) (and (= (select .cse4 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse5 1) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse6 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse5 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse7 (< 1 c_~N~0) (<= c_~N~0 2) .cse3)) (not (and .cse1 .cse2 .cse7 .cse3)) (not (and .cse1 (= (select .cse8 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse9 1)) .cse7 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse13 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse14 (select .cse15 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse12 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse11 (select .cse15 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse10 (+ (select .cse13 8) .cse14))) (and (= .cse10 (+ .cse11 (select .cse12 0))) (= (select .cse12 8) 12) (= .cse11 (+ (select .cse13 0) .cse14)) (= (+ .cse11 6) .cse10)))))) .cse3)) .cse7 (not (and (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (<= c_~N~0 1))) .cse3))))) is different from true [2021-11-23 00:52:08,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:52:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 149 states and 521 transitions. [2021-11-23 00:52:08,438 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 521 transitions. [2021-11-23 00:52:08,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:52:08,439 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:52:08,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:52:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:52:08,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-23 00:52:08,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:52:08,634 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:52:08,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 19 [2021-11-23 00:52:08,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:52:08,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:08,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2021-11-23 00:52:09,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:09,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2021-11-23 00:52:09,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:09,279 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:52:09,286 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-23 00:52:09,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 48 [2021-11-23 00:52:10,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:10,283 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:52:10,291 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-23 00:52:10,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 60 [2021-11-23 00:52:10,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:52:10,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:10,993 INFO L354 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2021-11-23 00:52:10,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 83 treesize of output 74 [2021-11-23 00:52:14,026 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:52:14,887 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse17 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse18 (select .cse17 0))) (and (= (select .cse17 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse18 1) (let ((.cse19 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse19 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse18 (select .cse19 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse7 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse8 (< 1 c_~N~0)) (.cse3 (= c_~N~0 .cse10))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 .cse2 .cse3)) (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse5 (select .cse4 0))) (and (= (select .cse4 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse5 1) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse6 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse5 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse7 .cse8 (<= c_~N~0 2) .cse3)) (not (and .cse1 .cse2 .cse7 .cse3)) (not (and .cse1 (= (select .cse9 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse10 1)) .cse7 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse14 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse15 (select .cse16 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse13 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (select .cse16 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse11 (+ (select .cse14 8) .cse15))) (and (= .cse11 (+ .cse12 (select .cse13 0))) (= (select .cse13 8) 12) (= .cse12 (+ (select .cse14 0) .cse15)) (= (+ .cse12 6) .cse11)))))) .cse3)) .cse7 (not (and .cse2 .cse7)) .cse8 .cse3)))) is different from false [2021-11-23 00:52:15,731 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse2 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse17 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse18 (select .cse17 0))) (and (= (select .cse17 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse18 1) (let ((.cse19 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse19 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse18 (select .cse19 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))))) (.cse7 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse8 (< 1 c_~N~0)) (.cse3 (= c_~N~0 .cse10))) (and (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0))) (and (= .cse0 1) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse0 c_~N~0))))) .cse1 (not (and .cse1 .cse2 .cse3)) (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse5 (select .cse4 0))) (and (= (select .cse4 8) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= .cse5 1) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (= (select .cse6 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse5 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse7 .cse8 (<= c_~N~0 2) .cse3)) (not (and .cse1 .cse2 .cse7 .cse3)) (not (and .cse1 (= (select .cse9 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8)) (+ .cse10 1)) .cse7 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse14 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (.cse15 (select .cse16 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse13 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (select .cse16 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 8))) (.cse11 (+ (select .cse14 8) .cse15))) (and (= .cse11 (+ .cse12 (select .cse13 0))) (= (select .cse13 8) 12) (= .cse12 (+ (select .cse14 0) .cse15)) (= (+ .cse12 6) .cse11)))))) .cse3)) .cse7 (not (and .cse2 .cse7)) .cse8 .cse3))))) is different from true [2021-11-23 00:52:15,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:52:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 150 states and 523 transitions. [2021-11-23 00:52:15,744 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 523 transitions. [2021-11-23 00:52:15,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:52:15,744 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:52:15,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:52:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:52:16,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:52:16,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:52:16,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:52:16,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:52:16,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:16,170 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:52:16,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:52:16,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:16,262 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:52:16,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:52:16,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:16,313 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:52:16,326 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:52:16,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:52:17,691 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:52:17,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:52:17,697 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:52:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:52:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 151 states and 525 transitions. [2021-11-23 00:52:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 525 transitions. [2021-11-23 00:52:17,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:52:17,735 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:52:17,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:52:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:52:17,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-23 00:52:17,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:52:18,004 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:52:18,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 19 [2021-11-23 00:52:18,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:52:18,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:18,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2021-11-23 00:52:18,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:18,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2021-11-23 00:52:18,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:18,649 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:52:18,657 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-23 00:52:18,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 48 [2021-11-23 00:52:19,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:19,354 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:52:19,363 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-11-23 00:52:19,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 60 [2021-11-23 00:52:20,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:52:20,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:20,081 INFO L354 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2021-11-23 00:52:20,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 83 treesize of output 74 [2021-11-23 00:52:23,115 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:52:23,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:52:23,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 152 states and 527 transitions. [2021-11-23 00:52:23,157 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 527 transitions. [2021-11-23 00:52:23,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:52:23,157 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:52:23,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:52:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:52:23,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:52:23,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:52:23,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:52:23,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:52:23,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:23,536 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:52:23,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:52:24,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:24,169 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:52:24,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:52:24,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:24,211 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:52:24,230 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:52:24,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:52:25,726 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:52:25,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:52:25,732 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:52:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:52:25,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 153 states and 529 transitions. [2021-11-23 00:52:25,771 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 529 transitions. [2021-11-23 00:52:25,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:52:25,771 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:52:25,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:52:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:52:26,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:52:26,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:52:26,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:52:26,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:52:26,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:26,181 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:52:26,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:52:26,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:26,849 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:52:26,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:52:26,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:26,891 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:52:26,910 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:52:26,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:52:28,365 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:52:28,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:52:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:52:28,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:52:28,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 154 states and 531 transitions. [2021-11-23 00:52:28,413 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 531 transitions. [2021-11-23 00:52:28,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:52:28,414 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:52:28,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:52:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:52:28,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 00:52:28,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:52:28,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:52:28,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:52:28,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:28,727 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:52:28,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:52:28,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:52:28,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:28,812 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:52:28,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 42 treesize of output 36 [2021-11-23 00:52:31,929 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:52:31,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 36 [2021-11-23 00:52:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:52:31,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:52:31,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 155 states and 533 transitions. [2021-11-23 00:52:31,966 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 533 transitions. [2021-11-23 00:52:31,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:52:31,966 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:52:31,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:52:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:52:32,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 00:52:32,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:52:32,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:52:32,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:52:32,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:32,408 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:52:32,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:52:32,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:52:32,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:32,505 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:52:32,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 42 treesize of output 36 [2021-11-23 00:52:35,129 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:52:35,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 36 [2021-11-23 00:52:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:52:35,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:52:35,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 156 states and 535 transitions. [2021-11-23 00:52:35,173 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 535 transitions. [2021-11-23 00:52:35,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:52:35,173 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:52:35,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:52:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:52:35,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 00:52:35,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:52:35,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:52:35,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:52:35,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:35,662 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:52:35,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:52:36,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:36,278 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:52:36,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:52:36,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:36,314 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:52:36,332 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:52:36,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 59 [2021-11-23 00:52:37,797 INFO L354 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2021-11-23 00:52:37,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 53 [2021-11-23 00:52:37,803 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:52:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:52:37,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 157 states and 537 transitions. [2021-11-23 00:52:37,841 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 537 transitions. [2021-11-23 00:52:37,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:52:37,842 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:52:37,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:52:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:52:38,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-23 00:52:38,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:52:38,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:52:38,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:52:38,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:38,135 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-23 00:52:38,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 43 [2021-11-23 00:52:38,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-23 00:52:38,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:38,207 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:52:38,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 42 treesize of output 36 [2021-11-23 00:52:40,847 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:52:40,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 36 [2021-11-23 00:52:40,852 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 00:52:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-23 00:52:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 158 states and 539 transitions. [2021-11-23 00:52:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 539 transitions. [2021-11-23 00:52:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-23 00:52:40,888 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-23 00:52:40,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 00:52:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 00:52:41,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-23 00:52:41,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 00:52:41,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2021-11-23 00:52:41,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 00:52:41,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:41,374 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 00:52:41,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2021-11-23 00:52:42,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:42,627 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 00:52:42,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2021-11-23 00:52:42,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 00:52:42,668 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 00:52:42,686 INFO L354 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2021-11-23 00:52:42,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 55 [2021-11-23 00:52:46,915 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-11-23 00:52:46,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 95 treesize of output 59 [2021-11-23 00:52:46,921 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 00:52:47,653 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse4 (not (= |c_ULTIMATE.start_main_~c~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|))) (.cse0 (= 1 (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse11 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse12 (= |c_ULTIMATE.start_main_~b~0#1.offset| 0)) (.cse13 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))) (.cse14 (< 1 c_~N~0)) (.cse15 (<= c_~N~0 2)) (.cse5 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (not (and .cse0 (= 7 (select .cse1 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8))) .cse2 (exists ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse3 |ULTIMATE.start_main_~a~0#1.offset|) 6) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse3 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 12)))) .cse4 .cse5)) (not (and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse10 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse9 (select .cse10 0)) (.cse7 (select .cse10 8))) (and (= 1 .cse6) (= .cse7 12) (= (select .cse8 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (+ .cse9 .cse6)) (= (+ 6 .cse9) .cse7) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse2 .cse11 .cse4 .cse12 .cse5)) .cse0 .cse2 .cse11 (not (and .cse0 .cse2 .cse11 .cse4 .cse12 .cse13 .cse5)) .cse4 .cse12 (not (and .cse0 .cse12 .cse13)) (not (and .cse0 .cse2 .cse11 .cse12 .cse14 .cse15 .cse13 .cse5)) .cse14 .cse15 .cse5))) is different from false [2021-11-23 00:52:48,374 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse4 (not (= |c_ULTIMATE.start_main_~c~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|))) (.cse0 (= 1 (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse2 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse11 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse12 (= |c_ULTIMATE.start_main_~b~0#1.offset| 0)) (.cse13 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))) (.cse14 (< 1 c_~N~0)) (.cse15 (<= c_~N~0 2)) (.cse5 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (and (not (and .cse0 (= 7 (select .cse1 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8))) .cse2 (exists ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse3 |ULTIMATE.start_main_~a~0#1.offset|) 6) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse3 (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 12)))) .cse4 .cse5)) (not (and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse10 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse9 (select .cse10 0)) (.cse7 (select .cse10 8))) (and (= 1 .cse6) (= .cse7 12) (= (select .cse8 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (+ .cse9 .cse6)) (= (+ 6 .cse9) .cse7) (not (= |c_ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))))) .cse2 .cse11 .cse4 .cse12 .cse5)) .cse0 .cse2 .cse11 (not (and .cse0 .cse2 .cse11 .cse4 .cse12 .cse13 .cse5)) .cse4 .cse12 (not (and .cse0 .cse12 .cse13)) (not (and .cse0 .cse2 .cse11 .cse12 .cse14 .cse15 .cse13 .cse5)) .cse14 .cse15 .cse5)))) is different from true