./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/prefixsum_iter.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/prefixsum_iter.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 04:52:17,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 04:52:17,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 04:52:17,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 04:52:17,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 04:52:17,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 04:52:17,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 04:52:17,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 04:52:17,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 04:52:17,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 04:52:17,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 04:52:17,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 04:52:17,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 04:52:17,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 04:52:17,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 04:52:17,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 04:52:17,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 04:52:17,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 04:52:17,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 04:52:17,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 04:52:17,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 04:52:17,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 04:52:17,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 04:52:17,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 04:52:17,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 04:52:17,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 04:52:17,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 04:52:17,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 04:52:17,914 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 04:52:17,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 04:52:17,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 04:52:17,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 04:52:17,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 04:52:17,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 04:52:17,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 04:52:17,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 04:52:17,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 04:52:17,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 04:52:17,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 04:52:17,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 04:52:17,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 04:52:17,921 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-18 04:52:17,943 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 04:52:17,943 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 04:52:17,944 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 04:52:17,944 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 04:52:17,944 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 04:52:17,944 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 04:52:17,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 04:52:17,945 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 04:52:17,945 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 04:52:17,945 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 04:52:17,945 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 04:52:17,945 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 04:52:17,945 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 04:52:17,946 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 04:52:17,946 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 04:52:17,946 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-18 04:52:17,946 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-18 04:52:17,946 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-18 04:52:17,946 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 04:52:17,946 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-18 04:52:17,947 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 04:52:17,947 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 04:52:17,947 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 04:52:17,947 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 04:52:17,947 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 04:52:17,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 04:52:17,947 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 04:52:17,947 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 04:52:17,948 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 04:52:17,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 04:52:17,948 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 04:52:17,948 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 04:52:17,948 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 04:52:17,948 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 04:52:17,948 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d [2023-02-18 04:52:18,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 04:52:18,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 04:52:18,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 04:52:18,170 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 04:52:18,171 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 04:52:18,171 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_iter.c [2023-02-18 04:52:19,096 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 04:52:19,257 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 04:52:19,257 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.c [2023-02-18 04:52:19,262 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/044c1fc49/b1ba6ad1c16c436795aba02db5bb514a/FLAGb9c3f6719 [2023-02-18 04:52:19,280 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/044c1fc49/b1ba6ad1c16c436795aba02db5bb514a [2023-02-18 04:52:19,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 04:52:19,283 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 04:52:19,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 04:52:19,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 04:52:19,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 04:52:19,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 04:52:19" (1/1) ... [2023-02-18 04:52:19,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44ee074f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:52:19, skipping insertion in model container [2023-02-18 04:52:19,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 04:52:19" (1/1) ... [2023-02-18 04:52:19,294 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 04:52:19,307 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 04:52:19,398 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.c[526,539] [2023-02-18 04:52:19,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 04:52:19,421 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 04:52:19,428 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.c[526,539] [2023-02-18 04:52:19,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 04:52:19,448 INFO L208 MainTranslator]: Completed translation [2023-02-18 04:52:19,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:52:19 WrapperNode [2023-02-18 04:52:19,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 04:52:19,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 04:52:19,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 04:52:19,449 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 04:52:19,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:52:19" (1/1) ... [2023-02-18 04:52:19,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:52:19" (1/1) ... [2023-02-18 04:52:19,478 INFO L138 Inliner]: procedures = 22, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 131 [2023-02-18 04:52:19,478 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 04:52:19,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 04:52:19,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 04:52:19,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 04:52:19,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:52:19" (1/1) ... [2023-02-18 04:52:19,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:52:19" (1/1) ... [2023-02-18 04:52:19,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:52:19" (1/1) ... [2023-02-18 04:52:19,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:52:19" (1/1) ... [2023-02-18 04:52:19,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:52:19" (1/1) ... [2023-02-18 04:52:19,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:52:19" (1/1) ... [2023-02-18 04:52:19,495 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:52:19" (1/1) ... [2023-02-18 04:52:19,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:52:19" (1/1) ... [2023-02-18 04:52:19,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 04:52:19,499 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 04:52:19,499 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 04:52:19,499 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 04:52:19,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:52:19" (1/1) ... [2023-02-18 04:52:19,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 04:52:19,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:52:19,518 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-18 04:52:19,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-18 04:52:19,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 04:52:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-18 04:52:19,543 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-18 04:52:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 04:52:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-18 04:52:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-18 04:52:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 04:52:19,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 04:52:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-18 04:52:19,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-02-18 04:52:19,544 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-02-18 04:52:19,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-18 04:52:19,611 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 04:52:19,613 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 04:52:19,870 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 04:52:19,875 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 04:52:19,877 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2023-02-18 04:52:19,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:52:19 BoogieIcfgContainer [2023-02-18 04:52:19,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 04:52:19,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 04:52:19,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 04:52:19,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 04:52:19,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 04:52:19" (1/3) ... [2023-02-18 04:52:19,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2b6255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 04:52:19, skipping insertion in model container [2023-02-18 04:52:19,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 04:52:19" (2/3) ... [2023-02-18 04:52:19,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2b6255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 04:52:19, skipping insertion in model container [2023-02-18 04:52:19,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 04:52:19" (3/3) ... [2023-02-18 04:52:19,898 INFO L112 eAbstractionObserver]: Analyzing ICFG prefixsum_iter.c [2023-02-18 04:52:19,909 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 04:52:19,910 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2023-02-18 04:52:19,938 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 04:52:19,942 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2efee254, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 04:52:19,943 INFO L358 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2023-02-18 04:52:19,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 61 states have (on average 1.819672131147541) internal successors, (111), 95 states have internal predecessors, (111), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 04:52:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 04:52:19,950 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:19,951 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:19,951 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:52:19,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:19,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1116940539, now seen corresponding path program 1 times [2023-02-18 04:52:19,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:19,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713210303] [2023-02-18 04:52:19,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:19,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:20,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:20,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:52:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:20,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:52:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:20,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:52:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:20,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:20,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713210303] [2023-02-18 04:52:20,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713210303] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:52:20,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:52:20,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 04:52:20,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939105985] [2023-02-18 04:52:20,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:52:20,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 04:52:20,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:20,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 04:52:20,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 04:52:20,139 INFO L87 Difference]: Start difference. First operand has 102 states, 61 states have (on average 1.819672131147541) internal successors, (111), 95 states have internal predecessors, (111), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 04:52:20,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:20,208 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2023-02-18 04:52:20,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 04:52:20,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2023-02-18 04:52:20,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:20,216 INFO L225 Difference]: With dead ends: 102 [2023-02-18 04:52:20,216 INFO L226 Difference]: Without dead ends: 100 [2023-02-18 04:52:20,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 04:52:20,223 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 3 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:20,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 192 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 04:52:20,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-18 04:52:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-02-18 04:52:20,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 93 states have internal predecessors, (100), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 04:52:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2023-02-18 04:52:20,259 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 29 [2023-02-18 04:52:20,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:20,259 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2023-02-18 04:52:20,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 04:52:20,260 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2023-02-18 04:52:20,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 04:52:20,261 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:20,261 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:20,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 04:52:20,262 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:52:20,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:20,263 INFO L85 PathProgramCache]: Analyzing trace with hash 236420795, now seen corresponding path program 1 times [2023-02-18 04:52:20,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:20,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244542494] [2023-02-18 04:52:20,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:20,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:20,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:20,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:52:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:20,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:52:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:20,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:52:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:20,551 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:20,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:20,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244542494] [2023-02-18 04:52:20,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244542494] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:52:20,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:52:20,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 04:52:20,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676490710] [2023-02-18 04:52:20,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:52:20,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 04:52:20,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:20,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 04:52:20,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 04:52:20,559 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:52:20,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:20,669 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2023-02-18 04:52:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 04:52:20,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2023-02-18 04:52:20,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:20,671 INFO L225 Difference]: With dead ends: 98 [2023-02-18 04:52:20,672 INFO L226 Difference]: Without dead ends: 98 [2023-02-18 04:52:20,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 04:52:20,673 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 153 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:20,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 155 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:52:20,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-18 04:52:20,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-02-18 04:52:20,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 60 states have (on average 1.6333333333333333) internal successors, (98), 91 states have internal predecessors, (98), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 04:52:20,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2023-02-18 04:52:20,683 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 29 [2023-02-18 04:52:20,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:20,684 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2023-02-18 04:52:20,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:52:20,685 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2023-02-18 04:52:20,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 04:52:20,686 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:20,686 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:20,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 04:52:20,686 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:52:20,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:20,687 INFO L85 PathProgramCache]: Analyzing trace with hash 236420796, now seen corresponding path program 1 times [2023-02-18 04:52:20,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:20,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276625659] [2023-02-18 04:52:20,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:20,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:21,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:21,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:52:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:21,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:52:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:21,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:52:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:21,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:21,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:21,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276625659] [2023-02-18 04:52:21,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276625659] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:52:21,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:52:21,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-18 04:52:21,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144997303] [2023-02-18 04:52:21,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:52:21,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 04:52:21,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:21,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 04:52:21,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-18 04:52:21,040 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 04:52:21,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:21,676 INFO L93 Difference]: Finished difference Result 260 states and 282 transitions. [2023-02-18 04:52:21,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 04:52:21,677 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 29 [2023-02-18 04:52:21,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:21,678 INFO L225 Difference]: With dead ends: 260 [2023-02-18 04:52:21,678 INFO L226 Difference]: Without dead ends: 260 [2023-02-18 04:52:21,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2023-02-18 04:52:21,679 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 914 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:21,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 433 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 04:52:21,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-02-18 04:52:21,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 148. [2023-02-18 04:52:21,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 107 states have (on average 1.6728971962616823) internal successors, (179), 138 states have internal predecessors, (179), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:52:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 193 transitions. [2023-02-18 04:52:21,688 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 193 transitions. Word has length 29 [2023-02-18 04:52:21,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:21,688 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 193 transitions. [2023-02-18 04:52:21,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 04:52:21,688 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 193 transitions. [2023-02-18 04:52:21,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-18 04:52:21,689 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:21,689 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:21,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 04:52:21,690 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:52:21,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:21,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1260889940, now seen corresponding path program 1 times [2023-02-18 04:52:21,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:21,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634603771] [2023-02-18 04:52:21,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:21,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:21,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:21,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:52:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:21,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:52:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:21,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:52:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:21,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:21,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:21,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634603771] [2023-02-18 04:52:21,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634603771] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:52:21,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:52:21,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 04:52:21,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166845250] [2023-02-18 04:52:21,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:52:21,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 04:52:21,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:21,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 04:52:21,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 04:52:21,737 INFO L87 Difference]: Start difference. First operand 148 states and 193 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 04:52:21,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:21,793 INFO L93 Difference]: Finished difference Result 147 states and 191 transitions. [2023-02-18 04:52:21,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 04:52:21,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2023-02-18 04:52:21,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:21,795 INFO L225 Difference]: With dead ends: 147 [2023-02-18 04:52:21,795 INFO L226 Difference]: Without dead ends: 147 [2023-02-18 04:52:21,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 04:52:21,796 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 150 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:21,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 165 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 04:52:21,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-02-18 04:52:21,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2023-02-18 04:52:21,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 107 states have (on average 1.6542056074766356) internal successors, (177), 137 states have internal predecessors, (177), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:52:21,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 191 transitions. [2023-02-18 04:52:21,801 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 191 transitions. Word has length 30 [2023-02-18 04:52:21,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:21,802 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 191 transitions. [2023-02-18 04:52:21,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 04:52:21,802 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 191 transitions. [2023-02-18 04:52:21,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-18 04:52:21,803 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:21,803 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:21,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-18 04:52:21,803 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:52:21,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:21,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1260889939, now seen corresponding path program 1 times [2023-02-18 04:52:21,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:21,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918426510] [2023-02-18 04:52:21,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:21,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:21,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:21,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:52:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:21,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:52:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:21,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:52:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:21,965 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:21,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:21,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918426510] [2023-02-18 04:52:21,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918426510] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:52:21,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:52:21,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 04:52:21,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876110583] [2023-02-18 04:52:21,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:52:21,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 04:52:21,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:21,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 04:52:21,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-18 04:52:21,967 INFO L87 Difference]: Start difference. First operand 147 states and 191 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:52:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:22,224 INFO L93 Difference]: Finished difference Result 257 states and 334 transitions. [2023-02-18 04:52:22,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 04:52:22,225 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2023-02-18 04:52:22,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:22,226 INFO L225 Difference]: With dead ends: 257 [2023-02-18 04:52:22,226 INFO L226 Difference]: Without dead ends: 257 [2023-02-18 04:52:22,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-02-18 04:52:22,227 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 405 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:22,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 258 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 04:52:22,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-02-18 04:52:22,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 147. [2023-02-18 04:52:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 108 states have (on average 1.6388888888888888) internal successors, (177), 137 states have internal predecessors, (177), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:52:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 191 transitions. [2023-02-18 04:52:22,232 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 191 transitions. Word has length 30 [2023-02-18 04:52:22,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:22,232 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 191 transitions. [2023-02-18 04:52:22,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:52:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 191 transitions. [2023-02-18 04:52:22,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-18 04:52:22,236 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:22,236 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:22,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-18 04:52:22,237 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:52:22,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:22,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1311333523, now seen corresponding path program 1 times [2023-02-18 04:52:22,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:22,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932740718] [2023-02-18 04:52:22,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:22,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:22,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:22,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 04:52:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:22,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-18 04:52:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:22,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:52:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:22,623 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:22,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:22,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932740718] [2023-02-18 04:52:22,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932740718] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:52:22,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571965922] [2023-02-18 04:52:22,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:22,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:52:22,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:52:22,626 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:52:22,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 04:52:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:22,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 04:52:22,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:52:22,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 04:52:22,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 04:52:22,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 04:52:22,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-18 04:52:22,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 04:52:22,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-18 04:52:23,048 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 04:52:23,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:52:23,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571965922] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:52:23,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 04:52:23,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2023-02-18 04:52:23,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759191204] [2023-02-18 04:52:23,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 04:52:23,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-18 04:52:23,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:23,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-18 04:52:23,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2023-02-18 04:52:23,152 INFO L87 Difference]: Start difference. First operand 147 states and 191 transitions. Second operand has 21 states, 20 states have (on average 1.75) internal successors, (35), 20 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-18 04:52:24,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:24,247 INFO L93 Difference]: Finished difference Result 259 states and 281 transitions. [2023-02-18 04:52:24,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-18 04:52:24,248 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.75) internal successors, (35), 20 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 30 [2023-02-18 04:52:24,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:24,249 INFO L225 Difference]: With dead ends: 259 [2023-02-18 04:52:24,249 INFO L226 Difference]: Without dead ends: 259 [2023-02-18 04:52:24,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2023-02-18 04:52:24,250 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 1577 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1577 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:24,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1577 Valid, 686 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-18 04:52:24,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-02-18 04:52:24,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 146. [2023-02-18 04:52:24,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 107 states have (on average 1.6261682242990654) internal successors, (174), 136 states have internal predecessors, (174), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:52:24,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 188 transitions. [2023-02-18 04:52:24,254 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 188 transitions. Word has length 30 [2023-02-18 04:52:24,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:24,254 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 188 transitions. [2023-02-18 04:52:24,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.75) internal successors, (35), 20 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-18 04:52:24,255 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 188 transitions. [2023-02-18 04:52:24,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-18 04:52:24,255 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:24,255 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:24,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 04:52:24,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-18 04:52:24,464 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:52:24,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:24,465 INFO L85 PathProgramCache]: Analyzing trace with hash -535927024, now seen corresponding path program 1 times [2023-02-18 04:52:24,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:24,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414727533] [2023-02-18 04:52:24,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:24,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:24,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:24,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:52:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:24,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:52:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:24,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:52:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:24,548 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:24,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:24,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414727533] [2023-02-18 04:52:24,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414727533] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:52:24,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:52:24,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 04:52:24,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108845567] [2023-02-18 04:52:24,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:52:24,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 04:52:24,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:24,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 04:52:24,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-18 04:52:24,550 INFO L87 Difference]: Start difference. First operand 146 states and 188 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:52:24,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:24,664 INFO L93 Difference]: Finished difference Result 247 states and 267 transitions. [2023-02-18 04:52:24,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 04:52:24,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2023-02-18 04:52:24,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:24,666 INFO L225 Difference]: With dead ends: 247 [2023-02-18 04:52:24,666 INFO L226 Difference]: Without dead ends: 247 [2023-02-18 04:52:24,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-02-18 04:52:24,667 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 335 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:24,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 476 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:52:24,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-02-18 04:52:24,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 140. [2023-02-18 04:52:24,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 101 states have (on average 1.5841584158415842) internal successors, (160), 130 states have internal predecessors, (160), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:52:24,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 174 transitions. [2023-02-18 04:52:24,671 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 174 transitions. Word has length 32 [2023-02-18 04:52:24,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:24,671 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 174 transitions. [2023-02-18 04:52:24,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:52:24,672 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions. [2023-02-18 04:52:24,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-18 04:52:24,672 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:24,672 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:24,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-18 04:52:24,673 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:52:24,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:24,673 INFO L85 PathProgramCache]: Analyzing trace with hash 566089799, now seen corresponding path program 1 times [2023-02-18 04:52:24,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:24,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252872300] [2023-02-18 04:52:24,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:24,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:24,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:24,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:52:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:24,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:52:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:24,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:52:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:24,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:24,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252872300] [2023-02-18 04:52:24,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252872300] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:52:24,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:52:24,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 04:52:24,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785110742] [2023-02-18 04:52:24,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:52:24,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 04:52:24,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:24,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 04:52:24,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 04:52:24,741 INFO L87 Difference]: Start difference. First operand 140 states and 174 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:52:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:24,816 INFO L93 Difference]: Finished difference Result 134 states and 162 transitions. [2023-02-18 04:52:24,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 04:52:24,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2023-02-18 04:52:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:24,817 INFO L225 Difference]: With dead ends: 134 [2023-02-18 04:52:24,817 INFO L226 Difference]: Without dead ends: 134 [2023-02-18 04:52:24,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-18 04:52:24,818 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 175 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:24,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 166 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:52:24,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-18 04:52:24,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-02-18 04:52:24,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 124 states have internal predecessors, (148), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:52:24,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 162 transitions. [2023-02-18 04:52:24,821 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 162 transitions. Word has length 33 [2023-02-18 04:52:24,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:24,822 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 162 transitions. [2023-02-18 04:52:24,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:52:24,822 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 162 transitions. [2023-02-18 04:52:24,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-18 04:52:24,823 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:24,823 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:24,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-18 04:52:24,823 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:52:24,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:24,824 INFO L85 PathProgramCache]: Analyzing trace with hash 566089800, now seen corresponding path program 1 times [2023-02-18 04:52:24,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:24,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367311449] [2023-02-18 04:52:24,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:24,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:24,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:24,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:52:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:24,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:52:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:24,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:52:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:52:24,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:24,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367311449] [2023-02-18 04:52:24,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367311449] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:52:24,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:52:24,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-18 04:52:24,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590937264] [2023-02-18 04:52:24,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:52:24,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 04:52:24,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:24,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 04:52:24,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-18 04:52:24,925 INFO L87 Difference]: Start difference. First operand 134 states and 162 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:52:25,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:25,089 INFO L93 Difference]: Finished difference Result 177 states and 194 transitions. [2023-02-18 04:52:25,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 04:52:25,090 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2023-02-18 04:52:25,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:25,091 INFO L225 Difference]: With dead ends: 177 [2023-02-18 04:52:25,091 INFO L226 Difference]: Without dead ends: 177 [2023-02-18 04:52:25,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2023-02-18 04:52:25,092 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 342 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:25,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 851 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:52:25,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-18 04:52:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 93. [2023-02-18 04:52:25,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 86 states have internal predecessors, (93), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 04:52:25,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2023-02-18 04:52:25,095 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 33 [2023-02-18 04:52:25,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:25,096 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2023-02-18 04:52:25,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:52:25,096 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2023-02-18 04:52:25,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-18 04:52:25,097 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:25,097 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:25,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-18 04:52:25,098 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:52:25,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:25,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1785256912, now seen corresponding path program 1 times [2023-02-18 04:52:25,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:25,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131326756] [2023-02-18 04:52:25,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:25,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:25,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:25,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:52:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:25,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:52:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:25,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:52:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:25,205 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:52:25,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:25,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131326756] [2023-02-18 04:52:25,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131326756] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:52:25,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552448474] [2023-02-18 04:52:25,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:25,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:52:25,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:52:25,207 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:52:25,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 04:52:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:25,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-18 04:52:25,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:52:25,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 04:52:25,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-18 04:52:25,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 04:52:25,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 40 [2023-02-18 04:52:25,371 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 04:52:25,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-18 04:52:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 04:52:25,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:52:26,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552448474] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:52:26,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 04:52:26,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2023-02-18 04:52:26,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726430416] [2023-02-18 04:52:26,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 04:52:26,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-18 04:52:26,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:26,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-18 04:52:26,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=597, Unknown=1, NotChecked=0, Total=702 [2023-02-18 04:52:26,461 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 21 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 7 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-18 04:52:31,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:31,578 INFO L93 Difference]: Finished difference Result 245 states and 265 transitions. [2023-02-18 04:52:31,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-18 04:52:31,579 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 7 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) Word has length 34 [2023-02-18 04:52:31,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:31,580 INFO L225 Difference]: With dead ends: 245 [2023-02-18 04:52:31,580 INFO L226 Difference]: Without dead ends: 245 [2023-02-18 04:52:31,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=514, Invalid=2240, Unknown=2, NotChecked=0, Total=2756 [2023-02-18 04:52:31,584 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 817 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:31,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 765 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-02-18 04:52:31,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-02-18 04:52:31,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 115. [2023-02-18 04:52:31,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 104 states have internal predecessors, (113), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:52:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2023-02-18 04:52:31,597 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 34 [2023-02-18 04:52:31,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:31,597 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2023-02-18 04:52:31,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 7 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-18 04:52:31,597 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2023-02-18 04:52:31,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-18 04:52:31,599 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:31,599 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:31,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 04:52:31,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-18 04:52:31,803 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:52:31,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:31,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1082556080, now seen corresponding path program 1 times [2023-02-18 04:52:31,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:31,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117642954] [2023-02-18 04:52:31,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:31,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:31,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:31,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 04:52:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:31,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-18 04:52:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:31,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:52:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 04:52:31,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:31,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117642954] [2023-02-18 04:52:31,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117642954] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:52:31,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125422704] [2023-02-18 04:52:31,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:31,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:52:31,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:52:31,974 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:52:31,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 04:52:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:32,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-18 04:52:32,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:52:32,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-18 04:52:32,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 04:52:32,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 38 [2023-02-18 04:52:32,798 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 04:52:32,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:52:32,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125422704] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:52:32,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 04:52:32,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2023-02-18 04:52:32,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766331215] [2023-02-18 04:52:32,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 04:52:32,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 04:52:32,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:32,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 04:52:32,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=308, Unknown=1, NotChecked=0, Total=380 [2023-02-18 04:52:32,894 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 04:52:33,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:33,208 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2023-02-18 04:52:33,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 04:52:33,208 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 36 [2023-02-18 04:52:33,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:33,209 INFO L225 Difference]: With dead ends: 113 [2023-02-18 04:52:33,209 INFO L226 Difference]: Without dead ends: 113 [2023-02-18 04:52:33,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=147, Invalid=502, Unknown=1, NotChecked=0, Total=650 [2023-02-18 04:52:33,210 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 390 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:33,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 182 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 04:52:33,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-18 04:52:33,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-02-18 04:52:33,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 102 states have internal predecessors, (111), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:52:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2023-02-18 04:52:33,219 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 36 [2023-02-18 04:52:33,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:33,219 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2023-02-18 04:52:33,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 04:52:33,220 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2023-02-18 04:52:33,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-18 04:52:33,220 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:33,221 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:33,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 04:52:33,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:52:33,428 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:52:33,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:33,428 INFO L85 PathProgramCache]: Analyzing trace with hash 7143804, now seen corresponding path program 1 times [2023-02-18 04:52:33,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:33,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863112481] [2023-02-18 04:52:33,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:33,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:33,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:33,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:52:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:33,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:52:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:33,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:52:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:33,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:33,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863112481] [2023-02-18 04:52:33,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863112481] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:52:33,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:52:33,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 04:52:33,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013198744] [2023-02-18 04:52:33,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:52:33,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 04:52:33,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:33,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 04:52:33,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 04:52:33,470 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:52:33,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:33,523 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2023-02-18 04:52:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 04:52:33,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2023-02-18 04:52:33,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:33,525 INFO L225 Difference]: With dead ends: 110 [2023-02-18 04:52:33,525 INFO L226 Difference]: Without dead ends: 110 [2023-02-18 04:52:33,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 04:52:33,525 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 114 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:33,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 162 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 04:52:33,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-18 04:52:33,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-02-18 04:52:33,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 99 states have internal predecessors, (108), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:52:33,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2023-02-18 04:52:33,528 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 37 [2023-02-18 04:52:33,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:33,528 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2023-02-18 04:52:33,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:52:33,528 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2023-02-18 04:52:33,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-18 04:52:33,529 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:33,529 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:33,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-18 04:52:33,529 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:52:33,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:33,530 INFO L85 PathProgramCache]: Analyzing trace with hash 7143805, now seen corresponding path program 1 times [2023-02-18 04:52:33,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:33,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590327186] [2023-02-18 04:52:33,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:33,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:33,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:33,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:52:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:33,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:52:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:33,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:52:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:33,637 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:33,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:33,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590327186] [2023-02-18 04:52:33,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590327186] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:52:33,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813752391] [2023-02-18 04:52:33,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:33,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:52:33,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:52:33,638 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:52:33,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 04:52:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:33,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 04:52:33,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:52:33,701 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:33,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:52:33,720 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:33,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813752391] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:52:33,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:52:33,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 11 [2023-02-18 04:52:33,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919422802] [2023-02-18 04:52:33,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:52:33,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 04:52:33,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:33,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 04:52:33,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-18 04:52:33,722 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:52:33,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:33,900 INFO L93 Difference]: Finished difference Result 213 states and 229 transitions. [2023-02-18 04:52:33,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 04:52:33,900 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2023-02-18 04:52:33,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:33,901 INFO L225 Difference]: With dead ends: 213 [2023-02-18 04:52:33,901 INFO L226 Difference]: Without dead ends: 213 [2023-02-18 04:52:33,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2023-02-18 04:52:33,902 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 327 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:33,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 741 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:52:33,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-02-18 04:52:33,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 112. [2023-02-18 04:52:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 101 states have internal predecessors, (110), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:52:33,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2023-02-18 04:52:33,905 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 37 [2023-02-18 04:52:33,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:33,905 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2023-02-18 04:52:33,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:52:33,906 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2023-02-18 04:52:33,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-18 04:52:33,906 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:33,906 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:33,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 04:52:34,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:52:34,107 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:52:34,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:34,107 INFO L85 PathProgramCache]: Analyzing trace with hash 221416284, now seen corresponding path program 1 times [2023-02-18 04:52:34,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:34,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601851444] [2023-02-18 04:52:34,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:34,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:34,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:34,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:52:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:34,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:52:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:34,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:52:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:34,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:34,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:34,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601851444] [2023-02-18 04:52:34,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601851444] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:52:34,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292868866] [2023-02-18 04:52:34,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:34,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:52:34,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:52:34,251 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:52:34,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 04:52:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:34,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-18 04:52:34,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:52:34,385 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:34,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:52:34,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2023-02-18 04:52:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:34,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292868866] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:52:34,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:52:34,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2023-02-18 04:52:34,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036162199] [2023-02-18 04:52:34,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:52:34,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-18 04:52:34,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:34,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-18 04:52:34,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2023-02-18 04:52:34,478 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 04:52:34,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:34,898 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2023-02-18 04:52:34,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-18 04:52:34,898 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2023-02-18 04:52:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:34,899 INFO L225 Difference]: With dead ends: 160 [2023-02-18 04:52:34,899 INFO L226 Difference]: Without dead ends: 160 [2023-02-18 04:52:34,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=1400, Unknown=0, NotChecked=0, Total=1806 [2023-02-18 04:52:34,900 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 719 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:34,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 448 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 04:52:34,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-18 04:52:34,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 111. [2023-02-18 04:52:34,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 100 states have internal predecessors, (109), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:52:34,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2023-02-18 04:52:34,903 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 38 [2023-02-18 04:52:34,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:34,903 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2023-02-18 04:52:34,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 04:52:34,904 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2023-02-18 04:52:34,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-18 04:52:34,904 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:34,904 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:34,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-18 04:52:35,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-18 04:52:35,109 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:52:35,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:35,109 INFO L85 PathProgramCache]: Analyzing trace with hash -2034349997, now seen corresponding path program 1 times [2023-02-18 04:52:35,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:35,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40206547] [2023-02-18 04:52:35,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:35,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:35,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:35,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 04:52:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:35,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-18 04:52:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:35,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:52:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:35,328 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:52:35,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:35,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40206547] [2023-02-18 04:52:35,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40206547] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:52:35,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620985191] [2023-02-18 04:52:35,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:35,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:52:35,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:52:35,330 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:52:35,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 04:52:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:35,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-18 04:52:35,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:52:35,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-18 04:52:35,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 04:52:35,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 40 [2023-02-18 04:52:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 04:52:36,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:52:37,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620985191] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:52:37,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 04:52:37,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2023-02-18 04:52:37,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348624754] [2023-02-18 04:52:37,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 04:52:37,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-18 04:52:37,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:37,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-18 04:52:37,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=648, Unknown=2, NotChecked=0, Total=756 [2023-02-18 04:52:37,490 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 21 states have internal predecessors, (53), 7 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-18 04:52:39,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:39,284 INFO L93 Difference]: Finished difference Result 400 states and 432 transitions. [2023-02-18 04:52:39,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-18 04:52:39,284 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 21 states have internal predecessors, (53), 7 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) Word has length 40 [2023-02-18 04:52:39,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:39,286 INFO L225 Difference]: With dead ends: 400 [2023-02-18 04:52:39,286 INFO L226 Difference]: Without dead ends: 400 [2023-02-18 04:52:39,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=714, Invalid=2824, Unknown=2, NotChecked=0, Total=3540 [2023-02-18 04:52:39,287 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 1527 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 1790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:39,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 1365 Invalid, 1790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1734 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-18 04:52:39,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2023-02-18 04:52:39,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 136. [2023-02-18 04:52:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 105 states have (on average 1.276190476190476) internal successors, (134), 122 states have internal predecessors, (134), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 04:52:39,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 154 transitions. [2023-02-18 04:52:39,291 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 154 transitions. Word has length 40 [2023-02-18 04:52:39,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:39,291 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 154 transitions. [2023-02-18 04:52:39,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 21 states have internal predecessors, (53), 7 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 5 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-18 04:52:39,291 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 154 transitions. [2023-02-18 04:52:39,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-18 04:52:39,292 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:39,292 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:39,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 04:52:39,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-18 04:52:39,497 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:52:39,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:39,498 INFO L85 PathProgramCache]: Analyzing trace with hash -804107195, now seen corresponding path program 1 times [2023-02-18 04:52:39,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:39,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589966344] [2023-02-18 04:52:39,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:39,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:39,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:39,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:52:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:39,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:52:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:39,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:52:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:39,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:39,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589966344] [2023-02-18 04:52:39,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589966344] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:52:39,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800873592] [2023-02-18 04:52:39,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:39,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:52:39,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:52:39,600 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:52:39,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 04:52:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:39,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 04:52:39,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:52:39,682 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:39,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:52:39,708 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:39,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800873592] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:52:39,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:52:39,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 11 [2023-02-18 04:52:39,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741520661] [2023-02-18 04:52:39,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:52:39,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 04:52:39,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:39,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 04:52:39,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-02-18 04:52:39,711 INFO L87 Difference]: Start difference. First operand 136 states and 154 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:52:39,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:39,875 INFO L93 Difference]: Finished difference Result 290 states and 313 transitions. [2023-02-18 04:52:39,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 04:52:39,875 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2023-02-18 04:52:39,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:39,876 INFO L225 Difference]: With dead ends: 290 [2023-02-18 04:52:39,876 INFO L226 Difference]: Without dead ends: 290 [2023-02-18 04:52:39,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 84 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2023-02-18 04:52:39,877 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 404 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:39,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 758 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:52:39,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-02-18 04:52:39,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 143. [2023-02-18 04:52:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 112 states have (on average 1.2678571428571428) internal successors, (142), 129 states have internal predecessors, (142), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 04:52:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 162 transitions. [2023-02-18 04:52:39,887 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 162 transitions. Word has length 42 [2023-02-18 04:52:39,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:39,888 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 162 transitions. [2023-02-18 04:52:39,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:52:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2023-02-18 04:52:39,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-18 04:52:39,888 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:39,889 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:39,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-18 04:52:40,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:52:40,093 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:52:40,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:40,094 INFO L85 PathProgramCache]: Analyzing trace with hash 842447236, now seen corresponding path program 1 times [2023-02-18 04:52:40,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:40,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177370028] [2023-02-18 04:52:40,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:40,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:40,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:40,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:52:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:40,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:52:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:40,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:52:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:40,146 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:40,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:40,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177370028] [2023-02-18 04:52:40,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177370028] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:52:40,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:52:40,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 04:52:40,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430753414] [2023-02-18 04:52:40,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:52:40,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 04:52:40,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:40,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 04:52:40,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 04:52:40,148 INFO L87 Difference]: Start difference. First operand 143 states and 162 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:52:40,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:40,200 INFO L93 Difference]: Finished difference Result 142 states and 161 transitions. [2023-02-18 04:52:40,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 04:52:40,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2023-02-18 04:52:40,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:40,201 INFO L225 Difference]: With dead ends: 142 [2023-02-18 04:52:40,201 INFO L226 Difference]: Without dead ends: 142 [2023-02-18 04:52:40,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 04:52:40,203 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 69 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:40,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 188 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 04:52:40,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-02-18 04:52:40,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2023-02-18 04:52:40,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 112 states have (on average 1.2589285714285714) internal successors, (141), 128 states have internal predecessors, (141), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 04:52:40,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 161 transitions. [2023-02-18 04:52:40,207 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 161 transitions. Word has length 43 [2023-02-18 04:52:40,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:40,208 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 161 transitions. [2023-02-18 04:52:40,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:52:40,208 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 161 transitions. [2023-02-18 04:52:40,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-18 04:52:40,208 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:40,208 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:40,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-18 04:52:40,209 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:52:40,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:40,209 INFO L85 PathProgramCache]: Analyzing trace with hash 842447237, now seen corresponding path program 1 times [2023-02-18 04:52:40,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:40,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099112933] [2023-02-18 04:52:40,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:40,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:40,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:40,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:52:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:40,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:52:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:40,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:52:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:40,369 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:40,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:40,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099112933] [2023-02-18 04:52:40,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099112933] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:52:40,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695479659] [2023-02-18 04:52:40,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:40,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:52:40,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:52:40,371 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:52:40,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-18 04:52:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:40,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 04:52:40,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:52:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:40,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:52:40,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2023-02-18 04:52:40,519 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:40,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695479659] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:52:40,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:52:40,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 17 [2023-02-18 04:52:40,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369074784] [2023-02-18 04:52:40,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:52:40,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 04:52:40,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:40,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 04:52:40,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-02-18 04:52:40,522 INFO L87 Difference]: Start difference. First operand 142 states and 161 transitions. Second operand has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 04:52:40,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:40,852 INFO L93 Difference]: Finished difference Result 225 states and 245 transitions. [2023-02-18 04:52:40,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-18 04:52:40,852 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2023-02-18 04:52:40,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:40,853 INFO L225 Difference]: With dead ends: 225 [2023-02-18 04:52:40,853 INFO L226 Difference]: Without dead ends: 225 [2023-02-18 04:52:40,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=301, Invalid=889, Unknown=0, NotChecked=0, Total=1190 [2023-02-18 04:52:40,854 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 725 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:40,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 381 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 04:52:40,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-02-18 04:52:40,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 144. [2023-02-18 04:52:40,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 114 states have (on average 1.263157894736842) internal successors, (144), 130 states have internal predecessors, (144), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 04:52:40,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 164 transitions. [2023-02-18 04:52:40,859 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 164 transitions. Word has length 43 [2023-02-18 04:52:40,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:40,859 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 164 transitions. [2023-02-18 04:52:40,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 04:52:40,859 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 164 transitions. [2023-02-18 04:52:40,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-18 04:52:40,860 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:40,860 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:40,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 04:52:41,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-18 04:52:41,061 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:52:41,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:41,062 INFO L85 PathProgramCache]: Analyzing trace with hash 961258010, now seen corresponding path program 1 times [2023-02-18 04:52:41,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:41,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967135443] [2023-02-18 04:52:41,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:41,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:41,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:41,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 04:52:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:41,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-18 04:52:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:41,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:52:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:41,171 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 04:52:41,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:41,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967135443] [2023-02-18 04:52:41,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967135443] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:52:41,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240705250] [2023-02-18 04:52:41,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:41,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:52:41,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:52:41,172 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:52:41,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-18 04:52:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:41,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-18 04:52:41,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:52:41,281 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 04:52:41,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:52:41,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2023-02-18 04:52:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 04:52:41,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240705250] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:52:41,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:52:41,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2023-02-18 04:52:41,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364769013] [2023-02-18 04:52:41,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:52:41,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-18 04:52:41,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:41,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-18 04:52:41,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2023-02-18 04:52:41,356 INFO L87 Difference]: Start difference. First operand 144 states and 164 transitions. Second operand has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 04:52:41,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:41,790 INFO L93 Difference]: Finished difference Result 397 states and 438 transitions. [2023-02-18 04:52:41,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-18 04:52:41,790 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2023-02-18 04:52:41,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:41,791 INFO L225 Difference]: With dead ends: 397 [2023-02-18 04:52:41,791 INFO L226 Difference]: Without dead ends: 397 [2023-02-18 04:52:41,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=890, Unknown=0, NotChecked=0, Total=1190 [2023-02-18 04:52:41,792 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 2146 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2146 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:41,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2146 Valid, 622 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 04:52:41,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2023-02-18 04:52:41,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 156. [2023-02-18 04:52:41,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 126 states have (on average 1.3015873015873016) internal successors, (164), 142 states have internal predecessors, (164), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 04:52:41,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 184 transitions. [2023-02-18 04:52:41,796 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 184 transitions. Word has length 43 [2023-02-18 04:52:41,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:41,796 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 184 transitions. [2023-02-18 04:52:41,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 04:52:41,797 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 184 transitions. [2023-02-18 04:52:41,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-18 04:52:41,797 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:41,797 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:41,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-18 04:52:42,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:52:42,002 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:52:42,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:42,002 INFO L85 PathProgramCache]: Analyzing trace with hash -265772755, now seen corresponding path program 1 times [2023-02-18 04:52:42,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:42,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162352606] [2023-02-18 04:52:42,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:42,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:42,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:42,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 04:52:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:42,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-18 04:52:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:42,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:52:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:42,097 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 04:52:42,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:42,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162352606] [2023-02-18 04:52:42,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162352606] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:52:42,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186563] [2023-02-18 04:52:42,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:42,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:52:42,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:52:42,099 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:52:42,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-18 04:52:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:42,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-18 04:52:42,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:52:42,213 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 04:52:42,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:52:42,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2023-02-18 04:52:42,315 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 04:52:42,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186563] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:52:42,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:52:42,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2023-02-18 04:52:42,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556515337] [2023-02-18 04:52:42,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:52:42,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-18 04:52:42,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:42,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-18 04:52:42,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2023-02-18 04:52:42,317 INFO L87 Difference]: Start difference. First operand 156 states and 184 transitions. Second operand has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-18 04:52:42,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:42,792 INFO L93 Difference]: Finished difference Result 345 states and 389 transitions. [2023-02-18 04:52:42,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 04:52:42,792 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 44 [2023-02-18 04:52:42,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:42,793 INFO L225 Difference]: With dead ends: 345 [2023-02-18 04:52:42,793 INFO L226 Difference]: Without dead ends: 345 [2023-02-18 04:52:42,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=332, Invalid=1074, Unknown=0, NotChecked=0, Total=1406 [2023-02-18 04:52:42,794 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 909 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:42,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 955 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 04:52:42,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2023-02-18 04:52:42,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 156. [2023-02-18 04:52:42,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 127 states have (on average 1.2834645669291338) internal successors, (163), 142 states have internal predecessors, (163), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 04:52:42,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2023-02-18 04:52:42,798 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 44 [2023-02-18 04:52:42,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:42,798 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2023-02-18 04:52:42,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-18 04:52:42,799 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2023-02-18 04:52:42,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-18 04:52:42,799 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:42,799 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:42,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-18 04:52:43,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:52:43,003 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:52:43,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:43,004 INFO L85 PathProgramCache]: Analyzing trace with hash 2137907964, now seen corresponding path program 1 times [2023-02-18 04:52:43,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:43,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513757534] [2023-02-18 04:52:43,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:43,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:43,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:43,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:52:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:43,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:52:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:43,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:52:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:43,080 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:43,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:43,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513757534] [2023-02-18 04:52:43,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513757534] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:52:43,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435996247] [2023-02-18 04:52:43,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:43,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:52:43,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:52:43,082 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:52:43,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-18 04:52:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:43,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 04:52:43,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:52:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:43,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:52:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:43,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435996247] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:52:43,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:52:43,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2023-02-18 04:52:43,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529117494] [2023-02-18 04:52:43,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:52:43,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 04:52:43,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:52:43,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 04:52:43,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-18 04:52:43,170 INFO L87 Difference]: Start difference. First operand 156 states and 183 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:52:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:52:43,327 INFO L93 Difference]: Finished difference Result 213 states and 240 transitions. [2023-02-18 04:52:43,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 04:52:43,327 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2023-02-18 04:52:43,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:52:43,328 INFO L225 Difference]: With dead ends: 213 [2023-02-18 04:52:43,328 INFO L226 Difference]: Without dead ends: 213 [2023-02-18 04:52:43,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2023-02-18 04:52:43,329 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 239 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:52:43,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 534 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:52:43,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-02-18 04:52:43,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 156. [2023-02-18 04:52:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 127 states have (on average 1.2755905511811023) internal successors, (162), 142 states have internal predecessors, (162), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 04:52:43,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 182 transitions. [2023-02-18 04:52:43,332 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 182 transitions. Word has length 45 [2023-02-18 04:52:43,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:52:43,332 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 182 transitions. [2023-02-18 04:52:43,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:52:43,333 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 182 transitions. [2023-02-18 04:52:43,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-18 04:52:43,333 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:52:43,333 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:52:43,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-18 04:52:43,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-18 04:52:43,538 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:52:43,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:52:43,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1851808460, now seen corresponding path program 1 times [2023-02-18 04:52:43,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:52:43,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834264040] [2023-02-18 04:52:43,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:43,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:52:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:43,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:52:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:43,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:52:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:43,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:52:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:43,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:52:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:43,761 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:52:43,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:52:43,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834264040] [2023-02-18 04:52:43,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834264040] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:52:43,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780825677] [2023-02-18 04:52:43,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:52:43,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:52:43,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:52:43,765 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:52:43,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-18 04:52:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:52:43,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-18 04:52:43,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:52:43,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 04:52:43,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-02-18 04:52:43,951 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 04:52:43,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2023-02-18 04:52:43,968 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_339 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_339) |c_#memory_int|)) is different from true [2023-02-18 04:52:43,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-02-18 04:52:43,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-02-18 04:52:44,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-02-18 04:52:44,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-02-18 04:52:44,093 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-02-18 04:52:44,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:04,167 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_downsweep_~a#1.offset| Int) (|ULTIMATE.start_check_~a#1.offset| Int) (|ULTIMATE.start_check_~i~0#1| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |ULTIMATE.start_downsweep_~a#1.offset|) 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_check_~a#1.offset| (* |ULTIMATE.start_check_~i~0#1| 4))) 0)) is different from false [2023-02-18 04:53:04,260 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_340 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~a~0#1.base|))) is different from false [2023-02-18 04:53:04,263 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_340 (Array Int Int))) (= (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| v_ArrVal_340) |c_ULTIMATE.start_main_~a~0#1.base|) ((as const (Array Int Int)) 0))) is different from false [2023-02-18 04:53:04,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780825677] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:04,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 04:53:04,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 31 [2023-02-18 04:53:04,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099197004] [2023-02-18 04:53:04,265 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:04,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-18 04:53:04,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:04,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-18 04:53:04,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=902, Unknown=13, NotChecked=252, Total=1260 [2023-02-18 04:53:04,266 INFO L87 Difference]: Start difference. First operand 156 states and 182 transitions. Second operand has 31 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 6 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-18 04:53:05,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:05,656 INFO L93 Difference]: Finished difference Result 351 states and 384 transitions. [2023-02-18 04:53:05,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-02-18 04:53:05,657 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 6 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 46 [2023-02-18 04:53:05,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:05,658 INFO L225 Difference]: With dead ends: 351 [2023-02-18 04:53:05,658 INFO L226 Difference]: Without dead ends: 351 [2023-02-18 04:53:05,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1959 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=1331, Invalid=6327, Unknown=14, NotChecked=700, Total=8372 [2023-02-18 04:53:05,661 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 1870 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1871 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 1726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:05,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1871 Valid, 940 Invalid, 1726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1444 Invalid, 0 Unknown, 224 Unchecked, 0.7s Time] [2023-02-18 04:53:05,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-02-18 04:53:05,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 174. [2023-02-18 04:53:05,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 145 states have (on average 1.282758620689655) internal successors, (186), 160 states have internal predecessors, (186), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 04:53:05,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 206 transitions. [2023-02-18 04:53:05,667 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 206 transitions. Word has length 46 [2023-02-18 04:53:05,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:05,667 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 206 transitions. [2023-02-18 04:53:05,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 6 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-18 04:53:05,667 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 206 transitions. [2023-02-18 04:53:05,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-18 04:53:05,668 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:05,668 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:05,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-02-18 04:53:05,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-18 04:53:05,875 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:05,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:05,875 INFO L85 PathProgramCache]: Analyzing trace with hash -895170448, now seen corresponding path program 2 times [2023-02-18 04:53:05,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:05,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118921811] [2023-02-18 04:53:05,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:05,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:06,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:06,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 04:53:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:06,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 04:53:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:06,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 04:53:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 04:53:06,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:06,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118921811] [2023-02-18 04:53:06,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118921811] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:06,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34010221] [2023-02-18 04:53:06,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 04:53:06,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:06,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:06,172 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:53:06,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-18 04:53:06,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 04:53:06,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:53:06,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-18 04:53:06,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:06,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-18 04:53:06,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 04:53:06,407 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 04:53:06,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 32 [2023-02-18 04:53:06,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 04:53:06,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-18 04:53:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 04:53:09,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:10,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34010221] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:10,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 04:53:10,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 24 [2023-02-18 04:53:10,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299216701] [2023-02-18 04:53:10,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:10,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-18 04:53:10,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:10,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-18 04:53:10,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=924, Unknown=4, NotChecked=0, Total=1056 [2023-02-18 04:53:10,430 INFO L87 Difference]: Start difference. First operand 174 states and 206 transitions. Second operand has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-18 04:53:11,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:11,803 INFO L93 Difference]: Finished difference Result 340 states and 390 transitions. [2023-02-18 04:53:11,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-18 04:53:11,803 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 46 [2023-02-18 04:53:11,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:11,804 INFO L225 Difference]: With dead ends: 340 [2023-02-18 04:53:11,804 INFO L226 Difference]: Without dead ends: 340 [2023-02-18 04:53:11,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=442, Invalid=2416, Unknown=4, NotChecked=0, Total=2862 [2023-02-18 04:53:11,805 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 1484 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 1880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:11,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 1181 Invalid, 1880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-18 04:53:11,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2023-02-18 04:53:11,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 179. [2023-02-18 04:53:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 165 states have internal predecessors, (191), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 04:53:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 211 transitions. [2023-02-18 04:53:11,809 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 211 transitions. Word has length 46 [2023-02-18 04:53:11,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:11,809 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 211 transitions. [2023-02-18 04:53:11,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-18 04:53:11,809 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 211 transitions. [2023-02-18 04:53:11,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-18 04:53:11,810 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:11,810 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:11,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-02-18 04:53:12,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-02-18 04:53:12,015 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:12,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:12,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1571491564, now seen corresponding path program 1 times [2023-02-18 04:53:12,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:12,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949227200] [2023-02-18 04:53:12,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:12,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:12,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:12,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:53:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:12,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:53:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:12,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:53:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:53:12,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:12,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949227200] [2023-02-18 04:53:12,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949227200] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:53:12,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:53:12,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 04:53:12,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968531911] [2023-02-18 04:53:12,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:53:12,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 04:53:12,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:12,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 04:53:12,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 04:53:12,063 INFO L87 Difference]: Start difference. First operand 179 states and 211 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:53:12,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:12,119 INFO L93 Difference]: Finished difference Result 178 states and 210 transitions. [2023-02-18 04:53:12,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 04:53:12,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2023-02-18 04:53:12,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:12,120 INFO L225 Difference]: With dead ends: 178 [2023-02-18 04:53:12,120 INFO L226 Difference]: Without dead ends: 178 [2023-02-18 04:53:12,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 04:53:12,121 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 63 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:12,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 196 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:53:12,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-02-18 04:53:12,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2023-02-18 04:53:12,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 150 states have (on average 1.2666666666666666) internal successors, (190), 164 states have internal predecessors, (190), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 04:53:12,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 210 transitions. [2023-02-18 04:53:12,124 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 210 transitions. Word has length 47 [2023-02-18 04:53:12,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:12,125 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 210 transitions. [2023-02-18 04:53:12,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:53:12,125 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 210 transitions. [2023-02-18 04:53:12,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-18 04:53:12,125 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:12,125 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:12,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-18 04:53:12,126 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:12,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:12,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1571491565, now seen corresponding path program 1 times [2023-02-18 04:53:12,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:12,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567930068] [2023-02-18 04:53:12,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:12,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:12,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:12,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:53:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:12,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:53:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:12,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:53:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:12,209 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:53:12,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:12,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567930068] [2023-02-18 04:53:12,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567930068] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:12,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522177833] [2023-02-18 04:53:12,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:12,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:12,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:12,211 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:53:12,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-18 04:53:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:12,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 04:53:12,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:53:12,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:12,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2023-02-18 04:53:12,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:53:12,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522177833] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:12,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:53:12,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2023-02-18 04:53:12,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254297961] [2023-02-18 04:53:12,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:12,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 04:53:12,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:12,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 04:53:12,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-02-18 04:53:12,348 INFO L87 Difference]: Start difference. First operand 178 states and 210 transitions. Second operand has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 04:53:12,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:12,491 INFO L93 Difference]: Finished difference Result 186 states and 218 transitions. [2023-02-18 04:53:12,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 04:53:12,491 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 47 [2023-02-18 04:53:12,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:12,492 INFO L225 Difference]: With dead ends: 186 [2023-02-18 04:53:12,492 INFO L226 Difference]: Without dead ends: 186 [2023-02-18 04:53:12,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2023-02-18 04:53:12,493 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 305 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:12,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 265 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:53:12,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-18 04:53:12,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 182. [2023-02-18 04:53:12,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 154 states have (on average 1.2662337662337662) internal successors, (195), 168 states have internal predecessors, (195), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 04:53:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 215 transitions. [2023-02-18 04:53:12,496 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 215 transitions. Word has length 47 [2023-02-18 04:53:12,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:12,496 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 215 transitions. [2023-02-18 04:53:12,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 04:53:12,496 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 215 transitions. [2023-02-18 04:53:12,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-18 04:53:12,496 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:12,496 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:12,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:12,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:12,704 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:12,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:12,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2057054475, now seen corresponding path program 1 times [2023-02-18 04:53:12,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:12,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201519976] [2023-02-18 04:53:12,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:12,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:12,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:12,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 04:53:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:12,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-18 04:53:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:12,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:53:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:12,792 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:53:12,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:12,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201519976] [2023-02-18 04:53:12,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201519976] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:12,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220119486] [2023-02-18 04:53:12,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:12,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:12,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:12,797 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:53:12,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-18 04:53:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:12,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 04:53:12,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 04:53:12,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 04:53:12,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220119486] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:12,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:53:12,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2023-02-18 04:53:12,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525245219] [2023-02-18 04:53:12,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:12,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 04:53:12,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:12,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 04:53:12,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-02-18 04:53:12,938 INFO L87 Difference]: Start difference. First operand 182 states and 215 transitions. Second operand has 16 states, 16 states have (on average 3.8125) internal successors, (61), 15 states have internal predecessors, (61), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:53:13,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:13,224 INFO L93 Difference]: Finished difference Result 291 states and 317 transitions. [2023-02-18 04:53:13,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-18 04:53:13,224 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 15 states have internal predecessors, (61), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2023-02-18 04:53:13,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:13,225 INFO L225 Difference]: With dead ends: 291 [2023-02-18 04:53:13,225 INFO L226 Difference]: Without dead ends: 291 [2023-02-18 04:53:13,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2023-02-18 04:53:13,226 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 712 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:13,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 810 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 04:53:13,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2023-02-18 04:53:13,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 170. [2023-02-18 04:53:13,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 142 states have (on average 1.2253521126760563) internal successors, (174), 156 states have internal predecessors, (174), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 04:53:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 194 transitions. [2023-02-18 04:53:13,230 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 194 transitions. Word has length 47 [2023-02-18 04:53:13,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:13,230 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 194 transitions. [2023-02-18 04:53:13,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 15 states have internal predecessors, (61), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:53:13,231 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 194 transitions. [2023-02-18 04:53:13,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-18 04:53:13,231 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:13,232 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:13,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:13,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-18 04:53:13,436 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:13,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:13,437 INFO L85 PathProgramCache]: Analyzing trace with hash 2070871953, now seen corresponding path program 1 times [2023-02-18 04:53:13,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:13,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252301189] [2023-02-18 04:53:13,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:13,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:13,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:13,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 04:53:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:13,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-18 04:53:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:13,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:53:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:13,545 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:53:13,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:13,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252301189] [2023-02-18 04:53:13,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252301189] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:13,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560573524] [2023-02-18 04:53:13,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:13,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:13,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:13,546 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:53:13,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-18 04:53:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:13,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 04:53:13,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:13,654 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 04:53:13,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 04:53:13,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560573524] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:13,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:53:13,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2023-02-18 04:53:13,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739825210] [2023-02-18 04:53:13,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:13,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 04:53:13,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:13,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 04:53:13,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2023-02-18 04:53:13,715 INFO L87 Difference]: Start difference. First operand 170 states and 194 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:53:13,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:13,968 INFO L93 Difference]: Finished difference Result 309 states and 339 transitions. [2023-02-18 04:53:13,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 04:53:13,968 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2023-02-18 04:53:13,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:13,969 INFO L225 Difference]: With dead ends: 309 [2023-02-18 04:53:13,969 INFO L226 Difference]: Without dead ends: 309 [2023-02-18 04:53:13,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 83 SyntacticMatches, 14 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2023-02-18 04:53:13,970 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 838 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:13,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 1098 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 04:53:13,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-02-18 04:53:13,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 190. [2023-02-18 04:53:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 162 states have (on average 1.2222222222222223) internal successors, (198), 176 states have internal predecessors, (198), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 04:53:13,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 218 transitions. [2023-02-18 04:53:13,973 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 218 transitions. Word has length 48 [2023-02-18 04:53:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:13,974 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 218 transitions. [2023-02-18 04:53:13,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:53:13,974 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 218 transitions. [2023-02-18 04:53:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-18 04:53:13,974 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:13,975 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:13,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:14,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-18 04:53:14,180 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:14,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:14,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1655469456, now seen corresponding path program 1 times [2023-02-18 04:53:14,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:14,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747614866] [2023-02-18 04:53:14,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:14,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:14,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:14,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:53:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:14,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:53:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:14,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:53:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:14,268 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:53:14,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:14,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747614866] [2023-02-18 04:53:14,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747614866] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:14,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25524100] [2023-02-18 04:53:14,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:14,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:14,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:14,273 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:53:14,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-18 04:53:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:14,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 04:53:14,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:14,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:53:14,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:14,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:53:14,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25524100] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:14,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:53:14,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2023-02-18 04:53:14,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937873367] [2023-02-18 04:53:14,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:14,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 04:53:14,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:14,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 04:53:14,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-02-18 04:53:14,400 INFO L87 Difference]: Start difference. First operand 190 states and 218 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:53:14,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:14,567 INFO L93 Difference]: Finished difference Result 238 states and 265 transitions. [2023-02-18 04:53:14,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 04:53:14,567 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2023-02-18 04:53:14,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:14,581 INFO L225 Difference]: With dead ends: 238 [2023-02-18 04:53:14,581 INFO L226 Difference]: Without dead ends: 238 [2023-02-18 04:53:14,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 101 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2023-02-18 04:53:14,581 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 244 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:14,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 603 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:53:14,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-02-18 04:53:14,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 195. [2023-02-18 04:53:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 167 states have (on average 1.215568862275449) internal successors, (203), 181 states have internal predecessors, (203), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 04:53:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 223 transitions. [2023-02-18 04:53:14,596 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 223 transitions. Word has length 51 [2023-02-18 04:53:14,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:14,597 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 223 transitions. [2023-02-18 04:53:14,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:53:14,597 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 223 transitions. [2023-02-18 04:53:14,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-18 04:53:14,598 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:14,598 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:14,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:14,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-18 04:53:14,803 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:14,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:14,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1122599580, now seen corresponding path program 3 times [2023-02-18 04:53:14,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:14,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083071776] [2023-02-18 04:53:14,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:14,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:15,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:15,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 04:53:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:15,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 04:53:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:15,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 04:53:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:15,191 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 38 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 04:53:15,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:15,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083071776] [2023-02-18 04:53:15,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083071776] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:15,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582146816] [2023-02-18 04:53:15,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 04:53:15,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:15,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:15,193 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:53:15,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-18 04:53:15,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-18 04:53:15,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:53:15,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-18 04:53:15,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:15,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 04:53:15,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 04:53:15,344 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 04:53:15,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-18 04:53:15,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-18 04:53:16,104 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-18 04:53:16,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:16,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582146816] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:16,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 04:53:16,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2023-02-18 04:53:16,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441014918] [2023-02-18 04:53:16,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:16,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-18 04:53:16,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:16,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-18 04:53:16,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=824, Unknown=1, NotChecked=0, Total=930 [2023-02-18 04:53:16,310 INFO L87 Difference]: Start difference. First operand 195 states and 223 transitions. Second operand has 26 states, 25 states have (on average 2.52) internal successors, (63), 24 states have internal predecessors, (63), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-18 04:53:20,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:20,068 INFO L93 Difference]: Finished difference Result 370 states and 408 transitions. [2023-02-18 04:53:20,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-18 04:53:20,069 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.52) internal successors, (63), 24 states have internal predecessors, (63), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 51 [2023-02-18 04:53:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:20,070 INFO L225 Difference]: With dead ends: 370 [2023-02-18 04:53:20,070 INFO L226 Difference]: Without dead ends: 370 [2023-02-18 04:53:20,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=635, Invalid=3024, Unknown=1, NotChecked=0, Total=3660 [2023-02-18 04:53:20,071 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 2056 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2056 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 1998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:20,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2056 Valid, 1221 Invalid, 1998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-02-18 04:53:20,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2023-02-18 04:53:20,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 193. [2023-02-18 04:53:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 166 states have (on average 1.2108433734939759) internal successors, (201), 179 states have internal predecessors, (201), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 04:53:20,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 221 transitions. [2023-02-18 04:53:20,075 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 221 transitions. Word has length 51 [2023-02-18 04:53:20,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:20,076 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 221 transitions. [2023-02-18 04:53:20,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.52) internal successors, (63), 24 states have internal predecessors, (63), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-18 04:53:20,076 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 221 transitions. [2023-02-18 04:53:20,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-18 04:53:20,076 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:20,077 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:20,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:20,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-18 04:53:20,277 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:20,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:20,277 INFO L85 PathProgramCache]: Analyzing trace with hash 589144300, now seen corresponding path program 1 times [2023-02-18 04:53:20,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:20,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522489649] [2023-02-18 04:53:20,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:20,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:20,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:20,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 04:53:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:20,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-18 04:53:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:20,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:53:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:20,379 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 04:53:20,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:20,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522489649] [2023-02-18 04:53:20,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522489649] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:20,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652981409] [2023-02-18 04:53:20,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:20,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:20,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:20,381 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:53:20,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-18 04:53:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:20,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 04:53:20,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:20,503 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 04:53:20,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 04:53:20,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652981409] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:20,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:53:20,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 14 [2023-02-18 04:53:20,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535447553] [2023-02-18 04:53:20,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:20,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 04:53:20,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:20,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 04:53:20,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-18 04:53:20,550 INFO L87 Difference]: Start difference. First operand 193 states and 221 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:53:20,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:20,766 INFO L93 Difference]: Finished difference Result 277 states and 303 transitions. [2023-02-18 04:53:20,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 04:53:20,767 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2023-02-18 04:53:20,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:20,768 INFO L225 Difference]: With dead ends: 277 [2023-02-18 04:53:20,768 INFO L226 Difference]: Without dead ends: 277 [2023-02-18 04:53:20,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 93 SyntacticMatches, 15 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2023-02-18 04:53:20,768 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 382 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:20,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 842 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 04:53:20,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2023-02-18 04:53:20,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 183. [2023-02-18 04:53:20,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 156 states have (on average 1.1987179487179487) internal successors, (187), 169 states have internal predecessors, (187), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 04:53:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 207 transitions. [2023-02-18 04:53:20,771 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 207 transitions. Word has length 52 [2023-02-18 04:53:20,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:20,772 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 207 transitions. [2023-02-18 04:53:20,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:53:20,772 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 207 transitions. [2023-02-18 04:53:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-18 04:53:20,772 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:20,772 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:20,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:20,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:20,978 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:20,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:20,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1768212551, now seen corresponding path program 1 times [2023-02-18 04:53:20,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:20,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923570571] [2023-02-18 04:53:20,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:20,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:53:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:53:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:53:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 04:53:21,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:21,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923570571] [2023-02-18 04:53:21,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923570571] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:53:21,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:53:21,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 04:53:21,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591046781] [2023-02-18 04:53:21,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:53:21,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 04:53:21,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:21,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 04:53:21,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 04:53:21,015 INFO L87 Difference]: Start difference. First operand 183 states and 207 transitions. Second operand has 5 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:53:21,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:21,062 INFO L93 Difference]: Finished difference Result 182 states and 206 transitions. [2023-02-18 04:53:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 04:53:21,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 53 [2023-02-18 04:53:21,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:21,065 INFO L225 Difference]: With dead ends: 182 [2023-02-18 04:53:21,065 INFO L226 Difference]: Without dead ends: 182 [2023-02-18 04:53:21,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 04:53:21,065 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 108 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:21,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 145 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 04:53:21,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-18 04:53:21,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2023-02-18 04:53:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 156 states have (on average 1.1923076923076923) internal successors, (186), 168 states have internal predecessors, (186), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 04:53:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 206 transitions. [2023-02-18 04:53:21,072 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 206 transitions. Word has length 53 [2023-02-18 04:53:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:21,072 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 206 transitions. [2023-02-18 04:53:21,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:53:21,072 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 206 transitions. [2023-02-18 04:53:21,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-18 04:53:21,073 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:21,073 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:21,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-02-18 04:53:21,074 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:21,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:21,074 INFO L85 PathProgramCache]: Analyzing trace with hash -953582912, now seen corresponding path program 1 times [2023-02-18 04:53:21,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:21,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97991950] [2023-02-18 04:53:21,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:21,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:53:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:53:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:53:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 04:53:21,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:21,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97991950] [2023-02-18 04:53:21,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97991950] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:53:21,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:53:21,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 04:53:21,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214729943] [2023-02-18 04:53:21,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:53:21,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 04:53:21,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:21,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 04:53:21,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 04:53:21,118 INFO L87 Difference]: Start difference. First operand 182 states and 206 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 04:53:21,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:21,154 INFO L93 Difference]: Finished difference Result 181 states and 205 transitions. [2023-02-18 04:53:21,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 04:53:21,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2023-02-18 04:53:21,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:21,155 INFO L225 Difference]: With dead ends: 181 [2023-02-18 04:53:21,155 INFO L226 Difference]: Without dead ends: 181 [2023-02-18 04:53:21,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 04:53:21,156 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 102 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:21,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 151 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 04:53:21,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-18 04:53:21,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2023-02-18 04:53:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 156 states have (on average 1.185897435897436) internal successors, (185), 167 states have internal predecessors, (185), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 04:53:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 205 transitions. [2023-02-18 04:53:21,159 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 205 transitions. Word has length 56 [2023-02-18 04:53:21,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:21,159 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 205 transitions. [2023-02-18 04:53:21,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 04:53:21,159 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 205 transitions. [2023-02-18 04:53:21,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-18 04:53:21,160 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:21,160 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:21,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-02-18 04:53:21,160 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:21,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:21,160 INFO L85 PathProgramCache]: Analyzing trace with hash 841059847, now seen corresponding path program 1 times [2023-02-18 04:53:21,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:21,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660819139] [2023-02-18 04:53:21,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:21,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 04:53:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-18 04:53:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:53:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-18 04:53:21,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:21,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660819139] [2023-02-18 04:53:21,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660819139] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:53:21,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:53:21,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 04:53:21,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535762018] [2023-02-18 04:53:21,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:53:21,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 04:53:21,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:21,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 04:53:21,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-18 04:53:21,242 INFO L87 Difference]: Start difference. First operand 181 states and 205 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:53:21,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:21,345 INFO L93 Difference]: Finished difference Result 234 states and 262 transitions. [2023-02-18 04:53:21,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 04:53:21,345 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 56 [2023-02-18 04:53:21,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:21,346 INFO L225 Difference]: With dead ends: 234 [2023-02-18 04:53:21,346 INFO L226 Difference]: Without dead ends: 234 [2023-02-18 04:53:21,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-02-18 04:53:21,347 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 290 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:21,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 259 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:53:21,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-02-18 04:53:21,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 187. [2023-02-18 04:53:21,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 162 states have (on average 1.191358024691358) internal successors, (193), 173 states have internal predecessors, (193), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 04:53:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 213 transitions. [2023-02-18 04:53:21,351 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 213 transitions. Word has length 56 [2023-02-18 04:53:21,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:21,351 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 213 transitions. [2023-02-18 04:53:21,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:53:21,352 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 213 transitions. [2023-02-18 04:53:21,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-18 04:53:21,352 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:21,352 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:21,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-02-18 04:53:21,352 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:21,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:21,353 INFO L85 PathProgramCache]: Analyzing trace with hash 503701003, now seen corresponding path program 1 times [2023-02-18 04:53:21,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:21,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049887199] [2023-02-18 04:53:21,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:21,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:53:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:53:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:53:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 04:53:21,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:21,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049887199] [2023-02-18 04:53:21,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049887199] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:53:21,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:53:21,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 04:53:21,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632265959] [2023-02-18 04:53:21,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:53:21,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 04:53:21,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:21,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 04:53:21,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-18 04:53:21,438 INFO L87 Difference]: Start difference. First operand 187 states and 213 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:53:21,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:21,509 INFO L93 Difference]: Finished difference Result 186 states and 212 transitions. [2023-02-18 04:53:21,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 04:53:21,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 57 [2023-02-18 04:53:21,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:21,510 INFO L225 Difference]: With dead ends: 186 [2023-02-18 04:53:21,510 INFO L226 Difference]: Without dead ends: 186 [2023-02-18 04:53:21,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-02-18 04:53:21,510 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 154 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:21,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 144 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:53:21,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-18 04:53:21,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2023-02-18 04:53:21,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 162 states have (on average 1.1851851851851851) internal successors, (192), 172 states have internal predecessors, (192), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-18 04:53:21,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 212 transitions. [2023-02-18 04:53:21,514 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 212 transitions. Word has length 57 [2023-02-18 04:53:21,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:21,514 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 212 transitions. [2023-02-18 04:53:21,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:53:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 212 transitions. [2023-02-18 04:53:21,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-18 04:53:21,515 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:21,515 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:21,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-02-18 04:53:21,515 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:21,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:21,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1565137885, now seen corresponding path program 1 times [2023-02-18 04:53:21,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:21,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670241394] [2023-02-18 04:53:21,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:21,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-18 04:53:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-18 04:53:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-18 04:53:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:21,670 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 04:53:21,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:21,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670241394] [2023-02-18 04:53:21,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670241394] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:53:21,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 04:53:21,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 04:53:21,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307346663] [2023-02-18 04:53:21,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:53:21,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 04:53:21,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:21,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 04:53:21,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-18 04:53:21,672 INFO L87 Difference]: Start difference. First operand 186 states and 212 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:53:21,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:21,783 INFO L93 Difference]: Finished difference Result 185 states and 211 transitions. [2023-02-18 04:53:21,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 04:53:21,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 58 [2023-02-18 04:53:21,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:21,784 INFO L225 Difference]: With dead ends: 185 [2023-02-18 04:53:21,784 INFO L226 Difference]: Without dead ends: 144 [2023-02-18 04:53:21,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-02-18 04:53:21,785 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 97 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:21,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 254 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:53:21,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-02-18 04:53:21,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2023-02-18 04:53:21,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 124 states have (on average 1.2016129032258065) internal successors, (149), 133 states have internal predecessors, (149), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:53:21,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 163 transitions. [2023-02-18 04:53:21,788 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 163 transitions. Word has length 58 [2023-02-18 04:53:21,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:21,788 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 163 transitions. [2023-02-18 04:53:21,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 04:53:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 163 transitions. [2023-02-18 04:53:21,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-18 04:53:21,791 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:21,792 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:21,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-02-18 04:53:21,792 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:21,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:21,792 INFO L85 PathProgramCache]: Analyzing trace with hash 804662856, now seen corresponding path program 1 times [2023-02-18 04:53:21,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:21,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996331530] [2023-02-18 04:53:21,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:21,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:22,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:22,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 04:53:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:22,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-18 04:53:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:22,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:53:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 04:53:22,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:22,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996331530] [2023-02-18 04:53:22,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996331530] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:22,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824234067] [2023-02-18 04:53:22,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:22,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:22,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:22,077 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:53:22,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-18 04:53:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:22,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-18 04:53:22,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:22,350 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 04:53:22,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:22,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 105 [2023-02-18 04:53:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 04:53:22,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824234067] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:22,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:53:22,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 40 [2023-02-18 04:53:22,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974562857] [2023-02-18 04:53:22,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:22,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-18 04:53:22,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:22,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-18 04:53:22,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1480, Unknown=0, NotChecked=0, Total=1640 [2023-02-18 04:53:22,630 INFO L87 Difference]: Start difference. First operand 144 states and 163 transitions. Second operand has 41 states, 40 states have (on average 2.8) internal successors, (112), 40 states have internal predecessors, (112), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 04:53:24,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:24,313 INFO L93 Difference]: Finished difference Result 409 states and 456 transitions. [2023-02-18 04:53:24,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-18 04:53:24,313 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.8) internal successors, (112), 40 states have internal predecessors, (112), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 58 [2023-02-18 04:53:24,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:24,315 INFO L225 Difference]: With dead ends: 409 [2023-02-18 04:53:24,315 INFO L226 Difference]: Without dead ends: 409 [2023-02-18 04:53:24,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1025, Invalid=3945, Unknown=0, NotChecked=0, Total=4970 [2023-02-18 04:53:24,330 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 1558 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 1899 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:24,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 1116 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1899 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-18 04:53:24,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2023-02-18 04:53:24,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 171. [2023-02-18 04:53:24,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 152 states have (on average 1.230263157894737) internal successors, (187), 160 states have internal predecessors, (187), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:53:24,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 201 transitions. [2023-02-18 04:53:24,334 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 201 transitions. Word has length 58 [2023-02-18 04:53:24,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:24,334 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 201 transitions. [2023-02-18 04:53:24,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.8) internal successors, (112), 40 states have internal predecessors, (112), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 04:53:24,334 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 201 transitions. [2023-02-18 04:53:24,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-18 04:53:24,335 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:24,335 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:24,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:24,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-02-18 04:53:24,539 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:24,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:24,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1522278182, now seen corresponding path program 2 times [2023-02-18 04:53:24,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:24,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372170156] [2023-02-18 04:53:24,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:24,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:24,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:24,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 04:53:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:24,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 04:53:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:24,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 04:53:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:24,684 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-18 04:53:24,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:24,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372170156] [2023-02-18 04:53:24,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372170156] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:24,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892752545] [2023-02-18 04:53:24,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 04:53:24,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:24,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:24,686 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:53:24,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-02-18 04:53:24,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 04:53:24,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:53:24,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-18 04:53:24,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:24,844 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-18 04:53:24,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:24,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2023-02-18 04:53:24,971 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-18 04:53:24,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892752545] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:24,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:53:24,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 33 [2023-02-18 04:53:24,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799057347] [2023-02-18 04:53:24,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:24,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-18 04:53:24,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:24,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-18 04:53:24,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=948, Unknown=0, NotChecked=0, Total=1122 [2023-02-18 04:53:24,972 INFO L87 Difference]: Start difference. First operand 171 states and 201 transitions. Second operand has 34 states, 33 states have (on average 3.393939393939394) internal successors, (112), 33 states have internal predecessors, (112), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-18 04:53:25,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:25,493 INFO L93 Difference]: Finished difference Result 272 states and 310 transitions. [2023-02-18 04:53:25,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-18 04:53:25,494 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.393939393939394) internal successors, (112), 33 states have internal predecessors, (112), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 59 [2023-02-18 04:53:25,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:25,495 INFO L225 Difference]: With dead ends: 272 [2023-02-18 04:53:25,495 INFO L226 Difference]: Without dead ends: 272 [2023-02-18 04:53:25,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=530, Invalid=1726, Unknown=0, NotChecked=0, Total=2256 [2023-02-18 04:53:25,496 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 817 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:25,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 685 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 04:53:25,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2023-02-18 04:53:25,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 175. [2023-02-18 04:53:25,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 156 states have (on average 1.2307692307692308) internal successors, (192), 164 states have internal predecessors, (192), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:53:25,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 206 transitions. [2023-02-18 04:53:25,500 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 206 transitions. Word has length 59 [2023-02-18 04:53:25,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:25,500 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 206 transitions. [2023-02-18 04:53:25,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.393939393939394) internal successors, (112), 33 states have internal predecessors, (112), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-18 04:53:25,501 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 206 transitions. [2023-02-18 04:53:25,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-18 04:53:25,502 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:25,502 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:25,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-02-18 04:53:25,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-02-18 04:53:25,707 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:25,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:25,707 INFO L85 PathProgramCache]: Analyzing trace with hash -812323954, now seen corresponding path program 1 times [2023-02-18 04:53:25,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:25,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490360905] [2023-02-18 04:53:25,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:25,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:25,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:25,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 04:53:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:25,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-18 04:53:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:25,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:53:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:25,854 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 04:53:25,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:25,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490360905] [2023-02-18 04:53:25,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490360905] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:25,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659588770] [2023-02-18 04:53:25,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:25,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:25,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:25,855 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:53:25,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-02-18 04:53:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:25,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 04:53:25,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:25,991 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-18 04:53:25,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 04:53:25,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659588770] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 04:53:25,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 04:53:25,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 13 [2023-02-18 04:53:25,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36423608] [2023-02-18 04:53:25,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 04:53:25,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 04:53:25,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:25,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 04:53:25,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-02-18 04:53:25,995 INFO L87 Difference]: Start difference. First operand 175 states and 206 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:53:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:26,033 INFO L93 Difference]: Finished difference Result 179 states and 208 transitions. [2023-02-18 04:53:26,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 04:53:26,034 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 60 [2023-02-18 04:53:26,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:26,035 INFO L225 Difference]: With dead ends: 179 [2023-02-18 04:53:26,035 INFO L226 Difference]: Without dead ends: 179 [2023-02-18 04:53:26,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-02-18 04:53:26,036 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 130 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:26,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 212 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 04:53:26,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-02-18 04:53:26,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2023-02-18 04:53:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 158 states have (on average 1.2278481012658229) internal successors, (194), 166 states have internal predecessors, (194), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:53:26,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 208 transitions. [2023-02-18 04:53:26,039 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 208 transitions. Word has length 60 [2023-02-18 04:53:26,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:26,039 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 208 transitions. [2023-02-18 04:53:26,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:53:26,040 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 208 transitions. [2023-02-18 04:53:26,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-18 04:53:26,040 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:26,040 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:26,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:26,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-02-18 04:53:26,249 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:26,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:26,249 INFO L85 PathProgramCache]: Analyzing trace with hash 54016621, now seen corresponding path program 1 times [2023-02-18 04:53:26,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:26,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945414976] [2023-02-18 04:53:26,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:26,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:26,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:26,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 04:53:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:26,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 04:53:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:26,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 04:53:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-18 04:53:26,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:26,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945414976] [2023-02-18 04:53:26,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945414976] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:26,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326113283] [2023-02-18 04:53:26,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:26,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:26,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:26,403 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:53:26,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-02-18 04:53:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:26,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-18 04:53:26,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 21 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-18 04:53:26,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:26,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2023-02-18 04:53:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 21 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-18 04:53:26,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326113283] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:26,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:53:26,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2023-02-18 04:53:26,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466827939] [2023-02-18 04:53:26,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:26,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-18 04:53:26,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:26,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-18 04:53:26,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2023-02-18 04:53:26,756 INFO L87 Difference]: Start difference. First operand 177 states and 208 transitions. Second operand has 36 states, 35 states have (on average 3.2857142857142856) internal successors, (115), 35 states have internal predecessors, (115), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-18 04:53:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:27,326 INFO L93 Difference]: Finished difference Result 278 states and 317 transitions. [2023-02-18 04:53:27,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-18 04:53:27,326 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.2857142857142856) internal successors, (115), 35 states have internal predecessors, (115), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 60 [2023-02-18 04:53:27,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:27,327 INFO L225 Difference]: With dead ends: 278 [2023-02-18 04:53:27,327 INFO L226 Difference]: Without dead ends: 278 [2023-02-18 04:53:27,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=613, Invalid=2039, Unknown=0, NotChecked=0, Total=2652 [2023-02-18 04:53:27,328 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 863 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:27,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 749 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 04:53:27,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2023-02-18 04:53:27,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 178. [2023-02-18 04:53:27,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 159 states have (on average 1.2264150943396226) internal successors, (195), 167 states have internal predecessors, (195), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:53:27,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 209 transitions. [2023-02-18 04:53:27,331 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 209 transitions. Word has length 60 [2023-02-18 04:53:27,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:27,331 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 209 transitions. [2023-02-18 04:53:27,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.2857142857142856) internal successors, (115), 35 states have internal predecessors, (115), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-18 04:53:27,332 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 209 transitions. [2023-02-18 04:53:27,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-18 04:53:27,332 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:27,332 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:27,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-02-18 04:53:27,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:27,537 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:27,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:27,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1085543347, now seen corresponding path program 1 times [2023-02-18 04:53:27,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:27,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470179124] [2023-02-18 04:53:27,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:27,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:27,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:27,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 04:53:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:27,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-18 04:53:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:27,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:53:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 04:53:27,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:27,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470179124] [2023-02-18 04:53:27,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470179124] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:27,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384642629] [2023-02-18 04:53:27,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:27,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:27,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:27,645 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:53:27,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-02-18 04:53:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:27,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 04:53:27,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-18 04:53:27,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:27,817 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-18 04:53:27,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384642629] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:27,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:53:27,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 14 [2023-02-18 04:53:27,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401386756] [2023-02-18 04:53:27,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:27,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 04:53:27,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:27,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 04:53:27,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-02-18 04:53:27,819 INFO L87 Difference]: Start difference. First operand 178 states and 209 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:53:27,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:27,948 INFO L93 Difference]: Finished difference Result 189 states and 219 transitions. [2023-02-18 04:53:27,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 04:53:27,948 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 63 [2023-02-18 04:53:27,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:27,949 INFO L225 Difference]: With dead ends: 189 [2023-02-18 04:53:27,949 INFO L226 Difference]: Without dead ends: 189 [2023-02-18 04:53:27,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 120 SyntacticMatches, 11 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2023-02-18 04:53:27,949 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 255 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:27,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 318 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:53:27,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-02-18 04:53:27,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 180. [2023-02-18 04:53:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 161 states have (on average 1.2236024844720497) internal successors, (197), 169 states have internal predecessors, (197), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:53:27,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 211 transitions. [2023-02-18 04:53:27,952 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 211 transitions. Word has length 63 [2023-02-18 04:53:27,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:27,952 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 211 transitions. [2023-02-18 04:53:27,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:53:27,953 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 211 transitions. [2023-02-18 04:53:27,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-18 04:53:27,953 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:27,953 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:27,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:28,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-02-18 04:53:28,158 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:28,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:28,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1449216587, now seen corresponding path program 2 times [2023-02-18 04:53:28,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:28,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937634019] [2023-02-18 04:53:28,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:28,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:28,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:28,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 04:53:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:28,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 04:53:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:28,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 04:53:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:28,213 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-02-18 04:53:28,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:28,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937634019] [2023-02-18 04:53:28,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937634019] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:28,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181658362] [2023-02-18 04:53:28,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 04:53:28,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:28,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:28,215 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:53:28,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-02-18 04:53:28,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 04:53:28,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:53:28,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 04:53:28,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-18 04:53:28,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-18 04:53:28,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181658362] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:28,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:53:28,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 21 [2023-02-18 04:53:28,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771089065] [2023-02-18 04:53:28,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:28,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-18 04:53:28,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:28,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-18 04:53:28,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2023-02-18 04:53:28,404 INFO L87 Difference]: Start difference. First operand 180 states and 211 transitions. Second operand has 21 states, 21 states have (on average 4.142857142857143) internal successors, (87), 20 states have internal predecessors, (87), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:53:28,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:28,690 INFO L93 Difference]: Finished difference Result 230 states and 262 transitions. [2023-02-18 04:53:28,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-18 04:53:28,691 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.142857142857143) internal successors, (87), 20 states have internal predecessors, (87), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 63 [2023-02-18 04:53:28,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:28,692 INFO L225 Difference]: With dead ends: 230 [2023-02-18 04:53:28,692 INFO L226 Difference]: Without dead ends: 230 [2023-02-18 04:53:28,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=943, Unknown=0, NotChecked=0, Total=1190 [2023-02-18 04:53:28,692 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 332 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:28,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 903 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 04:53:28,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-02-18 04:53:28,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 180. [2023-02-18 04:53:28,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 161 states have (on average 1.2173913043478262) internal successors, (196), 169 states have internal predecessors, (196), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:53:28,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 210 transitions. [2023-02-18 04:53:28,695 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 210 transitions. Word has length 63 [2023-02-18 04:53:28,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:28,695 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 210 transitions. [2023-02-18 04:53:28,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.142857142857143) internal successors, (87), 20 states have internal predecessors, (87), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:53:28,696 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 210 transitions. [2023-02-18 04:53:28,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-18 04:53:28,696 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:28,696 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:28,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-02-18 04:53:28,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2023-02-18 04:53:28,901 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:28,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:28,901 INFO L85 PathProgramCache]: Analyzing trace with hash -560989999, now seen corresponding path program 3 times [2023-02-18 04:53:28,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:28,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021129415] [2023-02-18 04:53:28,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:28,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:29,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:29,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 04:53:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:29,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 04:53:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:29,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 04:53:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 04:53:29,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:29,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021129415] [2023-02-18 04:53:29,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021129415] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:29,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709077701] [2023-02-18 04:53:29,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 04:53:29,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:29,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:29,038 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:53:29,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-02-18 04:53:29,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-18 04:53:29,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:53:29,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-18 04:53:29,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-02-18 04:53:29,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-02-18 04:53:29,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709077701] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:29,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:53:29,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 28 [2023-02-18 04:53:29,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050308816] [2023-02-18 04:53:29,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:29,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-18 04:53:29,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:29,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-18 04:53:29,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2023-02-18 04:53:29,331 INFO L87 Difference]: Start difference. First operand 180 states and 210 transitions. Second operand has 28 states, 28 states have (on average 3.392857142857143) internal successors, (95), 27 states have internal predecessors, (95), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:53:30,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:30,054 INFO L93 Difference]: Finished difference Result 354 states and 407 transitions. [2023-02-18 04:53:30,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-18 04:53:30,055 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.392857142857143) internal successors, (95), 27 states have internal predecessors, (95), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 64 [2023-02-18 04:53:30,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:30,055 INFO L225 Difference]: With dead ends: 354 [2023-02-18 04:53:30,056 INFO L226 Difference]: Without dead ends: 354 [2023-02-18 04:53:30,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=677, Invalid=2863, Unknown=0, NotChecked=0, Total=3540 [2023-02-18 04:53:30,056 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1025 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:30,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 449 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 04:53:30,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2023-02-18 04:53:30,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 198. [2023-02-18 04:53:30,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 179 states have (on average 1.1899441340782122) internal successors, (213), 187 states have internal predecessors, (213), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:53:30,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 227 transitions. [2023-02-18 04:53:30,060 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 227 transitions. Word has length 64 [2023-02-18 04:53:30,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:30,060 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 227 transitions. [2023-02-18 04:53:30,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.392857142857143) internal successors, (95), 27 states have internal predecessors, (95), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:53:30,060 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 227 transitions. [2023-02-18 04:53:30,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-18 04:53:30,060 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:30,060 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:30,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:30,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2023-02-18 04:53:30,265 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:30,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:30,265 INFO L85 PathProgramCache]: Analyzing trace with hash -593864845, now seen corresponding path program 1 times [2023-02-18 04:53:30,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:30,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055368202] [2023-02-18 04:53:30,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:30,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:30,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:30,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 04:53:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:30,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-18 04:53:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:30,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:53:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:30,379 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 04:53:30,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:30,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055368202] [2023-02-18 04:53:30,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055368202] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:30,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254584032] [2023-02-18 04:53:30,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:30,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:30,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:30,381 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:53:30,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-02-18 04:53:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:30,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 04:53:30,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-18 04:53:30,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:30,606 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-18 04:53:30,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254584032] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:30,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:53:30,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2023-02-18 04:53:30,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656372578] [2023-02-18 04:53:30,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:30,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 04:53:30,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:30,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 04:53:30,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2023-02-18 04:53:30,609 INFO L87 Difference]: Start difference. First operand 198 states and 227 transitions. Second operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:53:30,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:30,806 INFO L93 Difference]: Finished difference Result 238 states and 270 transitions. [2023-02-18 04:53:30,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 04:53:30,807 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 65 [2023-02-18 04:53:30,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:30,808 INFO L225 Difference]: With dead ends: 238 [2023-02-18 04:53:30,808 INFO L226 Difference]: Without dead ends: 238 [2023-02-18 04:53:30,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 114 SyntacticMatches, 16 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2023-02-18 04:53:30,808 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 158 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:30,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 645 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 04:53:30,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-02-18 04:53:30,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 216. [2023-02-18 04:53:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 197 states have (on average 1.1827411167512691) internal successors, (233), 205 states have internal predecessors, (233), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:53:30,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 247 transitions. [2023-02-18 04:53:30,811 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 247 transitions. Word has length 65 [2023-02-18 04:53:30,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:30,811 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 247 transitions. [2023-02-18 04:53:30,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:53:30,811 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 247 transitions. [2023-02-18 04:53:30,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-18 04:53:30,812 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:30,812 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:30,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:31,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:31,018 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:31,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:31,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1365247444, now seen corresponding path program 3 times [2023-02-18 04:53:31,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:31,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038902118] [2023-02-18 04:53:31,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:31,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:31,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:31,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 04:53:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:31,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 04:53:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:31,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 04:53:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-18 04:53:31,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:31,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038902118] [2023-02-18 04:53:31,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038902118] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:31,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45586703] [2023-02-18 04:53:31,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 04:53:31,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:31,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:31,181 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:53:31,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-02-18 04:53:31,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-18 04:53:31,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:53:31,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-18 04:53:31,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:33,473 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-02-18 04:53:33,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:33,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-02-18 04:53:34,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45586703] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:34,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 04:53:34,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-02-18 04:53:34,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12226638] [2023-02-18 04:53:34,014 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:34,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-18 04:53:34,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:34,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-18 04:53:34,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2023-02-18 04:53:34,015 INFO L87 Difference]: Start difference. First operand 216 states and 247 transitions. Second operand has 26 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-18 04:53:41,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:41,528 INFO L93 Difference]: Finished difference Result 384 states and 427 transitions. [2023-02-18 04:53:41,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-18 04:53:41,530 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 68 [2023-02-18 04:53:41,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:41,531 INFO L225 Difference]: With dead ends: 384 [2023-02-18 04:53:41,531 INFO L226 Difference]: Without dead ends: 384 [2023-02-18 04:53:41,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=622, Invalid=3037, Unknown=1, NotChecked=0, Total=3660 [2023-02-18 04:53:41,531 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 1525 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 2096 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 2106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:41,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1471 Invalid, 2106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2096 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-02-18 04:53:41,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2023-02-18 04:53:41,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 218. [2023-02-18 04:53:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 199 states have (on average 1.1809045226130652) internal successors, (235), 207 states have internal predecessors, (235), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:53:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 249 transitions. [2023-02-18 04:53:41,535 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 249 transitions. Word has length 68 [2023-02-18 04:53:41,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:41,535 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 249 transitions. [2023-02-18 04:53:41,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-18 04:53:41,535 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 249 transitions. [2023-02-18 04:53:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-18 04:53:41,536 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:41,536 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:41,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:41,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:41,742 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:41,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:41,743 INFO L85 PathProgramCache]: Analyzing trace with hash -767754326, now seen corresponding path program 2 times [2023-02-18 04:53:41,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:41,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552944370] [2023-02-18 04:53:41,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:41,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:41,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:41,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 04:53:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:41,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 04:53:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:41,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 04:53:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:41,913 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-18 04:53:41,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:41,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552944370] [2023-02-18 04:53:41,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552944370] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:41,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112356652] [2023-02-18 04:53:41,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 04:53:41,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:41,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:41,915 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:53:41,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-02-18 04:53:42,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 04:53:42,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:53:42,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 04:53:42,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:42,554 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 59 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 04:53:42,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 62 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 04:53:42,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112356652] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:42,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:53:42,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 36 [2023-02-18 04:53:42,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534463210] [2023-02-18 04:53:42,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:42,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-18 04:53:42,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:42,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-18 04:53:42,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2023-02-18 04:53:42,840 INFO L87 Difference]: Start difference. First operand 218 states and 249 transitions. Second operand has 36 states, 36 states have (on average 3.888888888888889) internal successors, (140), 35 states have internal predecessors, (140), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-18 04:53:44,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:44,102 INFO L93 Difference]: Finished difference Result 419 states and 483 transitions. [2023-02-18 04:53:44,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-18 04:53:44,102 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.888888888888889) internal successors, (140), 35 states have internal predecessors, (140), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2023-02-18 04:53:44,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:44,103 INFO L225 Difference]: With dead ends: 419 [2023-02-18 04:53:44,103 INFO L226 Difference]: Without dead ends: 419 [2023-02-18 04:53:44,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=811, Invalid=2971, Unknown=0, NotChecked=0, Total=3782 [2023-02-18 04:53:44,104 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 1665 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1665 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:44,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1665 Valid, 1159 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 04:53:44,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-02-18 04:53:44,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 251. [2023-02-18 04:53:44,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 232 states have (on average 1.1939655172413792) internal successors, (277), 240 states have internal predecessors, (277), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:53:44,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 291 transitions. [2023-02-18 04:53:44,108 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 291 transitions. Word has length 70 [2023-02-18 04:53:44,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:44,108 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 291 transitions. [2023-02-18 04:53:44,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.888888888888889) internal successors, (140), 35 states have internal predecessors, (140), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-18 04:53:44,109 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 291 transitions. [2023-02-18 04:53:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-18 04:53:44,109 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:44,109 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:44,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:44,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:44,317 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:44,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:44,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2098065761, now seen corresponding path program 1 times [2023-02-18 04:53:44,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:44,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402549116] [2023-02-18 04:53:44,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:44,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:45,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:45,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 04:53:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:45,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-18 04:53:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:45,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:53:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:45,788 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 04:53:45,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:45,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402549116] [2023-02-18 04:53:45,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402549116] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:45,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175579796] [2023-02-18 04:53:45,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:45,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:45,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:45,789 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:53:45,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-02-18 04:53:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:45,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 81 conjunts are in the unsatisfiable core [2023-02-18 04:53:45,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:46,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-02-18 04:53:46,469 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 04:53:46,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2023-02-18 04:53:46,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-18 04:53:46,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-02-18 04:53:46,736 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 04:53:46,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:46,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2023-02-18 04:53:47,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-02-18 04:53:47,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2023-02-18 04:53:47,196 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-18 04:53:47,717 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 04:53:47,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175579796] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:47,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:53:47,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25, 21] total 64 [2023-02-18 04:53:47,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300447682] [2023-02-18 04:53:47,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:47,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-02-18 04:53:47,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:47,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-02-18 04:53:47,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3813, Unknown=0, NotChecked=0, Total=4032 [2023-02-18 04:53:47,719 INFO L87 Difference]: Start difference. First operand 251 states and 291 transitions. Second operand has 64 states, 62 states have (on average 2.3870967741935485) internal successors, (148), 62 states have internal predecessors, (148), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-18 04:53:56,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:56,525 INFO L93 Difference]: Finished difference Result 328 states and 371 transitions. [2023-02-18 04:53:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-02-18 04:53:56,525 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 62 states have (on average 2.3870967741935485) internal successors, (148), 62 states have internal predecessors, (148), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 72 [2023-02-18 04:53:56,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:56,526 INFO L225 Difference]: With dead ends: 328 [2023-02-18 04:53:56,526 INFO L226 Difference]: Without dead ends: 328 [2023-02-18 04:53:56,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 113 SyntacticMatches, 10 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3192 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1584, Invalid=13422, Unknown=0, NotChecked=0, Total=15006 [2023-02-18 04:53:56,527 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1507 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 2836 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 2900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:56,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1056 Invalid, 2900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2836 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-02-18 04:53:56,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2023-02-18 04:53:56,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 256. [2023-02-18 04:53:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 237 states have (on average 1.1898734177215189) internal successors, (282), 245 states have internal predecessors, (282), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:53:56,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 296 transitions. [2023-02-18 04:53:56,531 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 296 transitions. Word has length 72 [2023-02-18 04:53:56,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:56,531 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 296 transitions. [2023-02-18 04:53:56,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 62 states have (on average 2.3870967741935485) internal successors, (148), 62 states have internal predecessors, (148), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-18 04:53:56,531 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 296 transitions. [2023-02-18 04:53:56,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-02-18 04:53:56,532 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:56,532 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:56,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2023-02-18 04:53:56,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2023-02-18 04:53:56,738 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:56,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:56,738 INFO L85 PathProgramCache]: Analyzing trace with hash -2081136393, now seen corresponding path program 4 times [2023-02-18 04:53:56,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:56,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624349589] [2023-02-18 04:53:56,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:56,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:56,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:56,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 04:53:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:56,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 04:53:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:56,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 04:53:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:56,890 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 6 proven. 52 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 04:53:56,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:56,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624349589] [2023-02-18 04:53:56,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624349589] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:56,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126342512] [2023-02-18 04:53:56,891 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 04:53:56,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:56,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:56,892 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:53:56,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-02-18 04:53:56,988 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 04:53:56,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:53:56,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 04:53:56,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:57,115 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 18 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-18 04:53:57,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-18 04:53:57,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126342512] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:57,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:53:57,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 25 [2023-02-18 04:53:57,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470368301] [2023-02-18 04:53:57,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:57,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-18 04:53:57,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:57,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-18 04:53:57,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2023-02-18 04:53:57,253 INFO L87 Difference]: Start difference. First operand 256 states and 296 transitions. Second operand has 25 states, 25 states have (on average 4.08) internal successors, (102), 24 states have internal predecessors, (102), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:53:57,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:53:57,539 INFO L93 Difference]: Finished difference Result 381 states and 431 transitions. [2023-02-18 04:53:57,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-18 04:53:57,540 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.08) internal successors, (102), 24 states have internal predecessors, (102), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 73 [2023-02-18 04:53:57,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:53:57,541 INFO L225 Difference]: With dead ends: 381 [2023-02-18 04:53:57,541 INFO L226 Difference]: Without dead ends: 381 [2023-02-18 04:53:57,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 107 SyntacticMatches, 36 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=248, Invalid=1012, Unknown=0, NotChecked=0, Total=1260 [2023-02-18 04:53:57,541 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 808 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 04:53:57,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 1038 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 04:53:57,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2023-02-18 04:53:57,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 246. [2023-02-18 04:53:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 227 states have (on average 1.1806167400881058) internal successors, (268), 235 states have internal predecessors, (268), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:53:57,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 282 transitions. [2023-02-18 04:53:57,545 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 282 transitions. Word has length 73 [2023-02-18 04:53:57,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:53:57,545 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 282 transitions. [2023-02-18 04:53:57,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.08) internal successors, (102), 24 states have internal predecessors, (102), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:53:57,545 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 282 transitions. [2023-02-18 04:53:57,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-02-18 04:53:57,546 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:53:57,546 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:53:57,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-02-18 04:53:57,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2023-02-18 04:53:57,753 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:53:57,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:53:57,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1899956778, now seen corresponding path program 3 times [2023-02-18 04:53:57,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:53:57,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079967364] [2023-02-18 04:53:57,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:53:57,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:53:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:57,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:53:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:57,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 04:53:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:57,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 04:53:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:57,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 04:53:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:53:57,978 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 38 proven. 54 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-18 04:53:57,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:53:57,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079967364] [2023-02-18 04:53:57,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079967364] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:53:57,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375263415] [2023-02-18 04:53:57,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 04:53:57,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:53:57,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:53:57,979 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:53:57,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-02-18 04:53:58,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-18 04:53:58,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 04:53:58,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-18 04:53:58,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:53:58,970 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 21 proven. 13 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-02-18 04:53:58,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:53:59,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-02-18 04:53:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-02-18 04:53:59,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375263415] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:53:59,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:53:59,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 38 [2023-02-18 04:53:59,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061628316] [2023-02-18 04:53:59,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:53:59,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-18 04:53:59,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:53:59,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-18 04:53:59,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1327, Unknown=0, NotChecked=0, Total=1482 [2023-02-18 04:53:59,376 INFO L87 Difference]: Start difference. First operand 246 states and 282 transitions. Second operand has 39 states, 38 states have (on average 3.4210526315789473) internal successors, (130), 38 states have internal predecessors, (130), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 04:54:04,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:54:04,121 INFO L93 Difference]: Finished difference Result 405 states and 459 transitions. [2023-02-18 04:54:04,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-02-18 04:54:04,121 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 3.4210526315789473) internal successors, (130), 38 states have internal predecessors, (130), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 75 [2023-02-18 04:54:04,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:54:04,123 INFO L225 Difference]: With dead ends: 405 [2023-02-18 04:54:04,123 INFO L226 Difference]: Without dead ends: 405 [2023-02-18 04:54:04,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1449 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1744, Invalid=6266, Unknown=0, NotChecked=0, Total=8010 [2023-02-18 04:54:04,123 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 858 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 2667 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 2685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-18 04:54:04,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1517 Invalid, 2685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2667 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-02-18 04:54:04,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2023-02-18 04:54:04,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 266. [2023-02-18 04:54:04,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 247 states have (on average 1.1821862348178138) internal successors, (292), 255 states have internal predecessors, (292), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:54:04,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 306 transitions. [2023-02-18 04:54:04,127 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 306 transitions. Word has length 75 [2023-02-18 04:54:04,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:54:04,127 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 306 transitions. [2023-02-18 04:54:04,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 3.4210526315789473) internal successors, (130), 38 states have internal predecessors, (130), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 04:54:04,128 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 306 transitions. [2023-02-18 04:54:04,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-02-18 04:54:04,128 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:54:04,131 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:54:04,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-02-18 04:54:04,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:54:04,342 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:54:04,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:54:04,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1481214108, now seen corresponding path program 1 times [2023-02-18 04:54:04,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:54:04,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49255418] [2023-02-18 04:54:04,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:54:04,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:54:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:54:04,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:54:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:54:04,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 04:54:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:54:04,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 04:54:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:54:04,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 04:54:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:54:04,497 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 54 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-18 04:54:04,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:54:04,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49255418] [2023-02-18 04:54:04,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49255418] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:54:04,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016545030] [2023-02-18 04:54:04,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:54:04,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:54:04,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:54:04,499 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:54:04,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-02-18 04:54:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:54:04,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-18 04:54:04,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:54:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 26 proven. 34 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 04:54:04,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:54:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 52 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 04:54:04,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016545030] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:54:04,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:54:04,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 20 [2023-02-18 04:54:04,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967641012] [2023-02-18 04:54:04,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:54:04,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-18 04:54:04,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:54:04,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-18 04:54:04,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2023-02-18 04:54:04,784 INFO L87 Difference]: Start difference. First operand 266 states and 306 transitions. Second operand has 20 states, 20 states have (on average 4.95) internal successors, (99), 19 states have internal predecessors, (99), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:54:05,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:54:05,084 INFO L93 Difference]: Finished difference Result 364 states and 408 transitions. [2023-02-18 04:54:05,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-18 04:54:05,084 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.95) internal successors, (99), 19 states have internal predecessors, (99), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2023-02-18 04:54:05,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:54:05,085 INFO L225 Difference]: With dead ends: 364 [2023-02-18 04:54:05,085 INFO L226 Difference]: Without dead ends: 364 [2023-02-18 04:54:05,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 117 SyntacticMatches, 36 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=927, Unknown=0, NotChecked=0, Total=1190 [2023-02-18 04:54:05,086 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 706 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 04:54:05,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 926 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 04:54:05,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2023-02-18 04:54:05,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 258. [2023-02-18 04:54:05,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 239 states have (on average 1.1715481171548117) internal successors, (280), 247 states have internal predecessors, (280), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:54:05,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 294 transitions. [2023-02-18 04:54:05,092 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 294 transitions. Word has length 75 [2023-02-18 04:54:05,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:54:05,092 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 294 transitions. [2023-02-18 04:54:05,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.95) internal successors, (99), 19 states have internal predecessors, (99), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 04:54:05,092 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 294 transitions. [2023-02-18 04:54:05,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-18 04:54:05,096 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:54:05,096 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:54:05,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2023-02-18 04:54:05,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2023-02-18 04:54:05,301 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:54:05,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:54:05,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1833874459, now seen corresponding path program 1 times [2023-02-18 04:54:05,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:54:05,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003903924] [2023-02-18 04:54:05,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:54:05,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:54:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:54:05,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:54:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:54:05,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 04:54:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:54:05,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-18 04:54:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:54:05,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:54:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:54:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 04:54:05,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:54:05,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003903924] [2023-02-18 04:54:05,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003903924] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:54:05,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268311708] [2023-02-18 04:54:05,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:54:05,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:54:05,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:54:05,538 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:54:05,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-02-18 04:54:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:54:05,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-18 04:54:05,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:54:05,695 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 04:54:05,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 04:54:05,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2023-02-18 04:54:05,787 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 04:54:05,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268311708] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 04:54:05,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 04:54:05,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 28 [2023-02-18 04:54:05,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507588555] [2023-02-18 04:54:05,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 04:54:05,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-18 04:54:05,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 04:54:05,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-18 04:54:05,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2023-02-18 04:54:05,801 INFO L87 Difference]: Start difference. First operand 258 states and 294 transitions. Second operand has 29 states, 28 states have (on average 6.107142857142857) internal successors, (171), 28 states have internal predecessors, (171), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-18 04:54:06,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 04:54:06,132 INFO L93 Difference]: Finished difference Result 273 states and 308 transitions. [2023-02-18 04:54:06,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 04:54:06,133 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 6.107142857142857) internal successors, (171), 28 states have internal predecessors, (171), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 77 [2023-02-18 04:54:06,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 04:54:06,133 INFO L225 Difference]: With dead ends: 273 [2023-02-18 04:54:06,134 INFO L226 Difference]: Without dead ends: 273 [2023-02-18 04:54:06,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=321, Invalid=1161, Unknown=0, NotChecked=0, Total=1482 [2023-02-18 04:54:06,134 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 598 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 04:54:06,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 405 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 04:54:06,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-02-18 04:54:06,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 262. [2023-02-18 04:54:06,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 243 states have (on average 1.168724279835391) internal successors, (284), 251 states have internal predecessors, (284), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 04:54:06,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 298 transitions. [2023-02-18 04:54:06,138 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 298 transitions. Word has length 77 [2023-02-18 04:54:06,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 04:54:06,138 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 298 transitions. [2023-02-18 04:54:06,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 6.107142857142857) internal successors, (171), 28 states have internal predecessors, (171), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-18 04:54:06,138 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 298 transitions. [2023-02-18 04:54:06,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-02-18 04:54:06,139 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 04:54:06,139 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 04:54:06,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2023-02-18 04:54:06,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2023-02-18 04:54:06,344 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 04:54:06,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 04:54:06,344 INFO L85 PathProgramCache]: Analyzing trace with hash 970084470, now seen corresponding path program 1 times [2023-02-18 04:54:06,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 04:54:06,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711479657] [2023-02-18 04:54:06,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:54:06,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 04:54:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:54:08,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 04:54:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:54:08,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 04:54:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:54:08,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-18 04:54:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:54:08,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 04:54:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:54:08,818 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 04:54:08,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 04:54:08,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711479657] [2023-02-18 04:54:08,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711479657] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 04:54:08,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493479518] [2023-02-18 04:54:08,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 04:54:08,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 04:54:08,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 04:54:08,819 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 04:54:08,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-02-18 04:54:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 04:54:08,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 142 conjunts are in the unsatisfiable core [2023-02-18 04:54:08,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 04:54:09,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 04:54:09,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-02-18 04:54:09,283 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 04:54:09,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-18 04:54:09,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-02-18 04:54:09,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2023-02-18 04:54:09,372 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 04:54:09,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 100 [2023-02-18 04:54:09,485 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 04:54:09,487 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-18 04:54:09,490 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 ((as const (Array Int Int)) 0)) (.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (= 0 (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse1))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~i~1#1|) (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (= .cse2 .cse0) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse2 .cse3) 0) (= (select .cse2 (@diff .cse2 .cse2)) 0) (exists ((v_ArrVal_1207 Int)) (= (store .cse2 .cse3 v_ArrVal_1207) .cse4))) (exists ((v_arrayElimCell_44 (Array Int Int)) (v_ArrVal_1207 Int)) (let ((.cse5 (@diff v_arrayElimCell_44 .cse2))) (and (= (select v_arrayElimCell_44 .cse3) 0) (= .cse2 (store v_arrayElimCell_44 .cse5 0)) (= (select v_arrayElimCell_44 .cse5) 0) (= (store v_arrayElimCell_44 .cse3 v_ArrVal_1207) .cse4)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (< |c_ULTIMATE.start_main_~i~1#1| |c_ULTIMATE.start_main_~n~0#1|) (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |c_ULTIMATE.start_main_~i~1#1|)))) is different from false [2023-02-18 04:54:09,493 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 ((as const (Array Int Int)) 0)) (.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (= 0 (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse1))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~i~1#1|) (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (= .cse2 .cse0) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse2 .cse3) 0) (= (select .cse2 (@diff .cse2 .cse2)) 0) (exists ((v_ArrVal_1207 Int)) (= (store .cse2 .cse3 v_ArrVal_1207) .cse4))) (exists ((v_arrayElimCell_44 (Array Int Int)) (v_ArrVal_1207 Int)) (let ((.cse5 (@diff v_arrayElimCell_44 .cse2))) (and (= (select v_arrayElimCell_44 .cse3) 0) (= .cse2 (store v_arrayElimCell_44 .cse5 0)) (= (select v_arrayElimCell_44 .cse5) 0) (= (store v_arrayElimCell_44 .cse3 v_ArrVal_1207) .cse4)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (< |c_ULTIMATE.start_main_~i~1#1| |c_ULTIMATE.start_main_~n~0#1|) (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |c_ULTIMATE.start_main_~i~1#1|)))) is different from true [2023-02-18 04:54:09,505 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (let ((.cse2 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse3 (+ (- 1) |c_ULTIMATE.start_main_~i~1#1|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse6 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse6))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 .cse1) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse2) (>= |v_ULTIMATE.start_main_~i~1#1_171| .cse3) (= .cse4 (store .cse0 .cse1 v_ArrVal_1207)) (= (select .cse5 (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int)) (let ((.cse9 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse2) (exists ((v_arrayElimCell_44 (Array Int Int)) (v_ArrVal_1207 Int)) (let ((.cse7 (@diff v_arrayElimCell_44 .cse0)) (.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (= .cse0 (store v_arrayElimCell_44 .cse7 0)) (= (select v_arrayElimCell_44 .cse8) 0) (= (select v_arrayElimCell_44 .cse7) 0) (= (store v_arrayElimCell_44 .cse8 v_ArrVal_1207) .cse4)))) (>= |v_ULTIMATE.start_main_~i~1#1_171| .cse3) (= (select .cse5 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse0 .cse5) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2023-02-18 04:54:09,507 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (let ((.cse2 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse3 (+ (- 1) |c_ULTIMATE.start_main_~i~1#1|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse6 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse6))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 .cse1) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse2) (>= |v_ULTIMATE.start_main_~i~1#1_171| .cse3) (= .cse4 (store .cse0 .cse1 v_ArrVal_1207)) (= (select .cse5 (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int)) (let ((.cse9 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse2) (exists ((v_arrayElimCell_44 (Array Int Int)) (v_ArrVal_1207 Int)) (let ((.cse7 (@diff v_arrayElimCell_44 .cse0)) (.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (= .cse0 (store v_arrayElimCell_44 .cse7 0)) (= (select v_arrayElimCell_44 .cse8) 0) (= (select v_arrayElimCell_44 .cse7) 0) (= (store v_arrayElimCell_44 .cse8 v_ArrVal_1207) .cse4)))) (>= |v_ULTIMATE.start_main_~i~1#1_171| .cse3) (= (select .cse5 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse0 .cse5) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from true [2023-02-18 04:54:09,516 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (and (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse0 .cse1) (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 .cse2) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= .cse4 (store .cse0 .cse2 v_ArrVal_1207)) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse8 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse0)) (.cse7 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse8))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse6 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse7) 0) (= (select v_arrayElimCell_44 .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= (store v_arrayElimCell_44 .cse7 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2023-02-18 04:54:09,531 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (and (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse0 .cse1) (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 .cse2) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= .cse4 (store .cse0 .cse2 v_ArrVal_1207)) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse8 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse0)) (.cse7 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse8))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse6 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse7) 0) (= (select v_arrayElimCell_44 .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= (store v_arrayElimCell_44 .cse7 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from true [2023-02-18 04:54:09,540 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_upsweep_~a#1.offset|) (= .cse0 .cse1) (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 .cse2) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= .cse4 (store .cse0 .cse2 v_ArrVal_1207)) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse8 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse0)) (.cse7 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse8))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse6 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse7) 0) (= (select v_arrayElimCell_44 .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= (store v_arrayElimCell_44 .cse7 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_upsweep_~space~0#1| 1))) is different from false [2023-02-18 04:54:09,542 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_upsweep_~a#1.offset|) (= .cse0 .cse1) (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 .cse2) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= .cse4 (store .cse0 .cse2 v_ArrVal_1207)) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse8 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse0)) (.cse7 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse8))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse6 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse7) 0) (= (select v_arrayElimCell_44 .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= (store v_arrayElimCell_44 .cse7 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_upsweep_~space~0#1| 1))) is different from true [2023-02-18 04:54:09,553 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (<= (+ (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|) |c_ULTIMATE.start_upsweep_~left~0#1|) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_upsweep_~a#1.offset|) (= .cse0 .cse1) (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 .cse2) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= .cse4 (store .cse0 .cse2 v_ArrVal_1207)) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse8 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse0)) (.cse7 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse8))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse6 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse7) 0) (= (select v_arrayElimCell_44 .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= (store v_arrayElimCell_44 .cse7 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_upsweep_~space~0#1| 1))) is different from false [2023-02-18 04:54:09,555 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (<= (+ (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|) |c_ULTIMATE.start_upsweep_~left~0#1|) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_upsweep_~a#1.offset|) (= .cse0 .cse1) (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 .cse2) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= .cse4 (store .cse0 .cse2 v_ArrVal_1207)) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse8 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse0)) (.cse7 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse8))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse6 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse7) 0) (= (select v_arrayElimCell_44 .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= (store v_arrayElimCell_44 .cse7 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_upsweep_~space~0#1| 1))) is different from true [2023-02-18 04:54:09,564 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (and (<= (+ (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|) (+ (* (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|) |c_ULTIMATE.start_upsweep_~right~0#1|)) (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_upsweep_~a#1.offset|) (= .cse0 .cse1) (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 .cse2) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= .cse4 (store .cse0 .cse2 v_ArrVal_1207)) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse8 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse0)) (.cse7 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse8))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse6 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse7) 0) (= (select v_arrayElimCell_44 .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= (store v_arrayElimCell_44 .cse7 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_upsweep_~space~0#1| 1))) is different from false [2023-02-18 04:54:09,567 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (and (<= (+ (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|) (+ (* (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|) |c_ULTIMATE.start_upsweep_~right~0#1|)) (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_upsweep_~a#1.offset|) (= .cse0 .cse1) (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 .cse2) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= .cse4 (store .cse0 .cse2 v_ArrVal_1207)) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse8 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse0)) (.cse7 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse8))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse6 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse7) 0) (= (select v_arrayElimCell_44 .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= (store v_arrayElimCell_44 .cse7 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_upsweep_~space~0#1| 1))) is different from true [2023-02-18 04:54:09,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 153 [2023-02-18 04:54:09,596 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse4 (* v_prenex_6 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) v_prenex_6)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| v_prenex_6) .cse1) (= (select .cse0 .cse2) 0) (<= |c_ULTIMATE.start_main_~n~0#1| (+ v_prenex_6 1)) (= .cse3 (store .cse0 .cse2 v_prenex_7)) (< v_prenex_6 |c_ULTIMATE.start_main_~n~0#1|) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse7 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse5 (@diff v_arrayElimCell_44 .cse0)) (.cse6 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse5 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse6) 0) (= (select v_arrayElimCell_44 .cse5) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse1) (= (store v_arrayElimCell_44 .cse6 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_upsweep_~space~0#1| 1))) is different from false [2023-02-18 04:54:09,599 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse4 (* v_prenex_6 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) v_prenex_6)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| v_prenex_6) .cse1) (= (select .cse0 .cse2) 0) (<= |c_ULTIMATE.start_main_~n~0#1| (+ v_prenex_6 1)) (= .cse3 (store .cse0 .cse2 v_prenex_7)) (< v_prenex_6 |c_ULTIMATE.start_main_~n~0#1|) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse7 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse5 (@diff v_arrayElimCell_44 .cse0)) (.cse6 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse5 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse6) 0) (= (select v_arrayElimCell_44 .cse5) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse1) (= (store v_arrayElimCell_44 .cse6 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_upsweep_~space~0#1| 1))) is different from true [2023-02-18 04:54:09,617 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) 1) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) 1))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_upsweep_~space~0#1| (* 2 1)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse4 (* v_prenex_6 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) v_prenex_6)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| v_prenex_6) .cse1) (= (select .cse0 .cse2) 0) (<= |c_ULTIMATE.start_main_~n~0#1| (+ v_prenex_6 1)) (= .cse3 (store .cse0 .cse2 v_prenex_7)) (< v_prenex_6 |c_ULTIMATE.start_main_~n~0#1|) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse7 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse5 (@diff v_arrayElimCell_44 .cse0)) (.cse6 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse5 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse6) 0) (= (select v_arrayElimCell_44 .cse5) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse1) (= (store v_arrayElimCell_44 .cse6 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2023-02-18 04:54:09,619 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) 1) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) 1))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_upsweep_~space~0#1| (* 2 1)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse4 (* v_prenex_6 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) v_prenex_6)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| v_prenex_6) .cse1) (= (select .cse0 .cse2) 0) (<= |c_ULTIMATE.start_main_~n~0#1| (+ v_prenex_6 1)) (= .cse3 (store .cse0 .cse2 v_prenex_7)) (< v_prenex_6 |c_ULTIMATE.start_main_~n~0#1|) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse7 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse5 (@diff v_arrayElimCell_44 .cse0)) (.cse6 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse5 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse6) 0) (= (select v_arrayElimCell_44 .cse5) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse1) (= (store v_arrayElimCell_44 .cse6 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from true [2023-02-18 04:54:09,634 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) 1) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) 1))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse4 (* v_prenex_6 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) v_prenex_6)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| v_prenex_6) .cse1) (= (select .cse0 .cse2) 0) (<= |c_ULTIMATE.start_main_~n~0#1| (+ v_prenex_6 1)) (= .cse3 (store .cse0 .cse2 v_prenex_7)) (< v_prenex_6 |c_ULTIMATE.start_main_~n~0#1|) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse7 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse5 (@diff v_arrayElimCell_44 .cse0)) (.cse6 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse5 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse6) 0) (= (select v_arrayElimCell_44 .cse5) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse1) (= (store v_arrayElimCell_44 .cse6 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_upsweep_#res#1| (* 2 1)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2023-02-18 04:54:09,637 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) 1) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) 1))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse4 (* v_prenex_6 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) v_prenex_6)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| v_prenex_6) .cse1) (= (select .cse0 .cse2) 0) (<= |c_ULTIMATE.start_main_~n~0#1| (+ v_prenex_6 1)) (= .cse3 (store .cse0 .cse2 v_prenex_7)) (< v_prenex_6 |c_ULTIMATE.start_main_~n~0#1|) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse7 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse5 (@diff v_arrayElimCell_44 .cse0)) (.cse6 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse0 (store v_arrayElimCell_44 .cse5 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse6) 0) (= (select v_arrayElimCell_44 .cse5) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse1) (= (store v_arrayElimCell_44 .cse6 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (= |c_ULTIMATE.start_upsweep_#res#1| (* 2 1)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from true [2023-02-18 04:54:09,649 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) 1) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) 1))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (let ((.cse3 (+ |c_ULTIMATE.start_downsweep_~n#1| 1)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse4 (* v_prenex_6 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |c_ULTIMATE.start_downsweep_~n#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse1) 0) (<= |c_ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (< v_prenex_6 |c_ULTIMATE.start_downsweep_~n#1|) (= .cse2 (store .cse0 .cse1 v_prenex_7)) (<= (+ |c_ULTIMATE.start_downsweep_~n#1| v_prenex_6) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse7 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse5 (@diff v_arrayElimCell_44 .cse0)) (.cse6 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7))) (and (= .cse0 (store v_arrayElimCell_44 .cse5 0)) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_downsweep_~n#1|) (= (select v_arrayElimCell_44 .cse6) 0) (<= (+ |c_ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= (select v_arrayElimCell_44 .cse5) 0) (= (store v_arrayElimCell_44 .cse6 v_ArrVal_1207) .cse2) (<= |c_ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (<= |c_ULTIMATE.start_downsweep_~n#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_downsweep_~space#1| (* 2 1)))) is different from false [2023-02-18 04:54:09,651 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0))) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) 1) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) 1))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (let ((.cse3 (+ |c_ULTIMATE.start_downsweep_~n#1| 1)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse4 (* v_prenex_6 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |c_ULTIMATE.start_downsweep_~n#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse1) 0) (<= |c_ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (< v_prenex_6 |c_ULTIMATE.start_downsweep_~n#1|) (= .cse2 (store .cse0 .cse1 v_prenex_7)) (<= (+ |c_ULTIMATE.start_downsweep_~n#1| v_prenex_6) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse7 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse5 (@diff v_arrayElimCell_44 .cse0)) (.cse6 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7))) (and (= .cse0 (store v_arrayElimCell_44 .cse5 0)) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_downsweep_~n#1|) (= (select v_arrayElimCell_44 .cse6) 0) (<= (+ |c_ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= (select v_arrayElimCell_44 .cse5) 0) (= (store v_arrayElimCell_44 .cse6 v_ArrVal_1207) .cse2) (<= |c_ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (<= |c_ULTIMATE.start_downsweep_~n#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_downsweep_~space#1| (* 2 1)))) is different from true [2023-02-18 04:54:09,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 164 [2023-02-18 04:54:09,686 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_downsweep_~space#1| (* 2 1))) is different from false [2023-02-18 04:54:09,689 WARN L859 $PredicateComparison]: unable to prove that (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_downsweep_~space#1| (* 2 1))) is different from true [2023-02-18 04:54:09,718 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_downsweep_~space#1| 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2023-02-18 04:54:09,721 WARN L859 $PredicateComparison]: unable to prove that (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_downsweep_~space#1| 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from true [2023-02-18 04:54:09,747 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (> |c_ULTIMATE.start_downsweep_~space#1| 0) (= |c_ULTIMATE.start_downsweep_~right~1#1| (+ (- 1) (* |c_ULTIMATE.start_downsweep_~space#1| 2))) (= |c_ULTIMATE.start_downsweep_~space#1| 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2023-02-18 04:54:09,750 WARN L859 $PredicateComparison]: unable to prove that (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (> |c_ULTIMATE.start_downsweep_~space#1| 0) (= |c_ULTIMATE.start_downsweep_~right~1#1| (+ (- 1) (* |c_ULTIMATE.start_downsweep_~space#1| 2))) (= |c_ULTIMATE.start_downsweep_~space#1| 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from true [2023-02-18 04:54:09,772 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse10 0) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= (+ (- 1) (* 2 .cse10)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse10 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2023-02-18 04:54:09,775 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse10 0) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= (+ (- 1) (* 2 .cse10)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse10 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from true [2023-02-18 04:54:09,797 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|) (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) |c_ULTIMATE.start_downsweep_#t~mem7#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse10 0) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= (+ (- 1) (* 2 .cse10)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse10 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2023-02-18 04:54:09,800 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|) (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) |c_ULTIMATE.start_downsweep_#t~mem7#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse10 0) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= (+ (- 1) (* 2 .cse10)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse10 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from true [2023-02-18 04:54:09,822 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|) (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) |c_ULTIMATE.start_downsweep_~temp~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse10 0) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= (+ (- 1) (* 2 .cse10)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse10 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2023-02-18 04:54:09,825 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|) (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) |c_ULTIMATE.start_downsweep_~temp~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse10 0) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= (+ (- 1) (* 2 .cse10)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse10 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from true [2023-02-18 04:54:09,847 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|)) (.cse11 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|))) (and (= |c_ULTIMATE.start_downsweep_#t~mem8#1| (select .cse0 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ (- 1) 1)) (.cse8 (* (- 1) 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (@diff v_arrayElimCell_44 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse1 (store v_arrayElimCell_44 .cse2 0)) (= (select v_arrayElimCell_44 .cse3) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse2) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse3 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse6 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse7 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse8)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse1 (@diff .cse1 .cse1)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse10 (* v_prenex_6 4))) (let ((.cse9 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse10))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse1 .cse9) 0) (= .cse6 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse7 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse8)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse4 (store .cse1 .cse9 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse1 (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) |c_ULTIMATE.start_downsweep_~temp~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse11 0) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= (+ (- 1) (* 2 .cse11)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse11 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2023-02-18 04:54:09,850 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|)) (.cse11 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|))) (and (= |c_ULTIMATE.start_downsweep_#t~mem8#1| (select .cse0 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ (- 1) 1)) (.cse8 (* (- 1) 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (@diff v_arrayElimCell_44 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse1 (store v_arrayElimCell_44 .cse2 0)) (= (select v_arrayElimCell_44 .cse3) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse2) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse3 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse6 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse7 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse8)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse1 (@diff .cse1 .cse1)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse10 (* v_prenex_6 4))) (let ((.cse9 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse10))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse1 .cse9) 0) (= .cse6 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse7 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse8)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse4 (store .cse1 .cse9 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse1 (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) |c_ULTIMATE.start_downsweep_~temp~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse11 0) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= (+ (- 1) (* 2 .cse11)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse11 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from true [2023-02-18 04:54:09,873 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|))) (let ((.cse11 (select .cse0 (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (.cse12 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|))) (and (= |c_ULTIMATE.start_downsweep_#t~mem8#1| (select .cse0 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ (- 1) 1)) (.cse8 (* (- 1) 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (@diff v_arrayElimCell_44 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse1 (store v_arrayElimCell_44 .cse2 0)) (= (select v_arrayElimCell_44 .cse3) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse2) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse3 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse6 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse7 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse8)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse1 (@diff .cse1 .cse1)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse10 (* v_prenex_6 4))) (let ((.cse9 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse10))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse1 .cse9) 0) (= .cse6 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse7 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse8)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse4 (store .cse1 .cse9 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse1 (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (= .cse11 |c_ULTIMATE.start_downsweep_#t~mem9#1|) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse11 |c_ULTIMATE.start_downsweep_~temp~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse12 0) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= (+ (- 1) (* 2 .cse12)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse12 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2023-02-18 04:54:09,877 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|))) (let ((.cse11 (select .cse0 (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (.cse12 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|))) (and (= |c_ULTIMATE.start_downsweep_#t~mem8#1| (select .cse0 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ (- 1) 1)) (.cse8 (* (- 1) 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (@diff v_arrayElimCell_44 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse1 (store v_arrayElimCell_44 .cse2 0)) (= (select v_arrayElimCell_44 .cse3) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse2) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse3 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse6 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse7 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse8)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse1 (@diff .cse1 .cse1)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse10 (* v_prenex_6 4))) (let ((.cse9 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse10))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse1 .cse9) 0) (= .cse6 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse7 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse8)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse4 (store .cse1 .cse9 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse1 (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (= .cse11 |c_ULTIMATE.start_downsweep_#t~mem9#1|) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse11 |c_ULTIMATE.start_downsweep_~temp~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse12 0) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= (+ (- 1) (* 2 .cse12)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse12 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from true [2023-02-18 04:54:09,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 256 treesize of output 244 [2023-02-18 04:54:09,913 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 1 |c_ULTIMATE.start_downsweep_~left~1#1|))) (let ((.cse1 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) .cse0))) (and (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse0 (+ (- 1) (* .cse1 2))) (> .cse1 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (let ((.cse5 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (+ (- 1) 1)) (.cse11 (* (- 1) 1)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse4 (+ (* .cse0 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (.cse7 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse13 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|)) (.cse3 (store (store .cse7 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0))) (let ((.cse8 (@diff v_arrayElimCell_44 .cse7)) (.cse6 (select .cse3 .cse4)) (.cse9 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse13))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse2 (store .cse3 .cse4 (+ (select .cse3 .cse5) .cse6))) (= .cse7 (store v_arrayElimCell_44 .cse8 0)) (= (select v_arrayElimCell_44 .cse9) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse8) 0) (= .cse6 |c_ULTIMATE.start_downsweep_~temp~0#1|) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse10 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse11)) (= (store v_arrayElimCell_44 .cse9 v_ArrVal_1207) .cse12) (= (select .cse7 (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))))) (and (= (select .cse7 (@diff .cse7 .cse7)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse17 (* v_prenex_6 4)) (.cse14 (store (store .cse7 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0))) (let ((.cse15 (select .cse14 .cse4)) (.cse16 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse17))) (and (<= |c_ULTIMATE.start_main_~a~0#1.offset| v_prenex_11) (= (store .cse14 .cse4 (+ (select .cse14 .cse5) .cse15)) .cse2) (= |c_ULTIMATE.start_downsweep_~temp~0#1| .cse15) (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= (select .cse7 .cse16) 0) (< v_prenex_6 v_prenex_10) (<= .cse10 (+ .cse11 v_prenex_8)) (= .cse12 (store .cse7 .cse16 v_prenex_7)) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= (select .cse7 (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))))))) is different from false [2023-02-18 04:54:09,916 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 1 |c_ULTIMATE.start_downsweep_~left~1#1|))) (let ((.cse1 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) .cse0))) (and (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse0 (+ (- 1) (* .cse1 2))) (> .cse1 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (let ((.cse5 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (+ (- 1) 1)) (.cse11 (* (- 1) 1)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse4 (+ (* .cse0 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (.cse7 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse13 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|)) (.cse3 (store (store .cse7 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0))) (let ((.cse8 (@diff v_arrayElimCell_44 .cse7)) (.cse6 (select .cse3 .cse4)) (.cse9 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse13))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse2 (store .cse3 .cse4 (+ (select .cse3 .cse5) .cse6))) (= .cse7 (store v_arrayElimCell_44 .cse8 0)) (= (select v_arrayElimCell_44 .cse9) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse8) 0) (= .cse6 |c_ULTIMATE.start_downsweep_~temp~0#1|) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse10 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse11)) (= (store v_arrayElimCell_44 .cse9 v_ArrVal_1207) .cse12) (= (select .cse7 (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))))) (and (= (select .cse7 (@diff .cse7 .cse7)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse17 (* v_prenex_6 4)) (.cse14 (store (store .cse7 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0))) (let ((.cse15 (select .cse14 .cse4)) (.cse16 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse17))) (and (<= |c_ULTIMATE.start_main_~a~0#1.offset| v_prenex_11) (= (store .cse14 .cse4 (+ (select .cse14 .cse5) .cse15)) .cse2) (= |c_ULTIMATE.start_downsweep_~temp~0#1| .cse15) (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= (select .cse7 .cse16) 0) (< v_prenex_6 v_prenex_10) (<= .cse10 (+ .cse11 v_prenex_8)) (= .cse12 (store .cse7 .cse16 v_prenex_7)) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= (select .cse7 (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))))))) is different from true [2023-02-18 04:54:09,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 395 treesize of output 389 [2023-02-18 04:54:09,957 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse16 (+ 0 1))) (and (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 0))) (.cse6 (+ (* .cse16 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ (- 1) 1)) (.cse3 (* (- 1) 1)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse10 (* v_prenex_6 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse10))) (and (<= |c_ULTIMATE.start_main_~a~0#1.offset| v_prenex_11) (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= (select .cse0 .cse1) 0) (< v_prenex_6 v_prenex_10) (<= .cse2 (+ .cse3 v_prenex_8)) (= .cse4 (let ((.cse5 (store (store .cse0 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (let ((.cse7 (select .cse5 .cse6))) (store (store .cse5 .cse6 (+ .cse7 (select .cse5 .cse8))) .cse8 .cse7)))) (= .cse9 (store .cse0 .cse1 v_prenex_7)) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= (select .cse0 (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse11 (@diff v_arrayElimCell_44 .cse0)) (.cse12 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse11 0)) (= (select v_arrayElimCell_44 .cse12) 0) (= .cse4 (let ((.cse13 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (let ((.cse14 (select .cse13 .cse6))) (store (store .cse13 .cse6 (+ (select .cse13 .cse8) .cse14)) .cse8 .cse14)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse11) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse2 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse3)) (= (store v_arrayElimCell_44 .cse12 v_ArrVal_1207) .cse9) (= (select .cse0 (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))))))) (> (+ .cse16 (* (- 1) 0)) 0) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2023-02-18 04:54:09,963 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse16 (+ 0 1))) (and (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 0))) (.cse6 (+ (* .cse16 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ (- 1) 1)) (.cse3 (* (- 1) 1)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse10 (* v_prenex_6 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse10))) (and (<= |c_ULTIMATE.start_main_~a~0#1.offset| v_prenex_11) (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= (select .cse0 .cse1) 0) (< v_prenex_6 v_prenex_10) (<= .cse2 (+ .cse3 v_prenex_8)) (= .cse4 (let ((.cse5 (store (store .cse0 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (let ((.cse7 (select .cse5 .cse6))) (store (store .cse5 .cse6 (+ .cse7 (select .cse5 .cse8))) .cse8 .cse7)))) (= .cse9 (store .cse0 .cse1 v_prenex_7)) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= (select .cse0 (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse11 (@diff v_arrayElimCell_44 .cse0)) (.cse12 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse11 0)) (= (select v_arrayElimCell_44 .cse12) 0) (= .cse4 (let ((.cse13 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (let ((.cse14 (select .cse13 .cse6))) (store (store .cse13 .cse6 (+ (select .cse13 .cse8) .cse14)) .cse8 .cse14)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse11) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse2 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse3)) (= (store v_arrayElimCell_44 .cse12 v_ArrVal_1207) .cse9) (= (select .cse0 (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))))))) (> (+ .cse16 (* (- 1) 0)) 0) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from true [2023-02-18 04:54:10,017 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse16 (+ 0 1))) (and (not (= |c_ULTIMATE.start_check_~a0#1.base| |c_ULTIMATE.start_check_~a#1.base|)) (= |c_ULTIMATE.start_check_~i~0#1| 0) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|)) (.cse8 (+ (* 4 0) 0)) (.cse7 (+ (* .cse16 4) 0)) (.cse1 (+ (- 1) 1)) (.cse2 (* (- 1) 1)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_check_~a0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse4 (* v_prenex_6 4))) (let ((.cse3 (+ .cse4 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (< v_prenex_6 v_prenex_10) (<= .cse1 (+ .cse2 v_prenex_8)) (<= |c_ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (= (select .cse0 .cse3) 0) (= (select .cse0 (+ .cse4 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse5 (let ((.cse6 (store (store .cse0 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse9 (select .cse6 .cse7))) (store (store .cse6 .cse7 (+ (select .cse6 .cse8) .cse9)) .cse8 .cse9)))) (= (store .cse0 .cse3 v_prenex_7) .cse10)))))) (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse11 (@diff v_arrayElimCell_44 .cse0)) (.cse14 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse11 0)) (= .cse5 (let ((.cse12 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse13 (select .cse12 .cse7))) (store (store .cse12 .cse7 (+ (select .cse12 .cse8) .cse13)) .cse8 .cse13)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse11) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse1 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse2)) (= (select v_arrayElimCell_44 .cse14) 0) (= (select .cse0 (+ .cse15 0)) 0) (= (store v_arrayElimCell_44 .cse14 v_ArrVal_1207) .cse10))))) (<= |c_ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|))))) (> (+ .cse16 (* (- 1) 0)) 0) (= |c_ULTIMATE.start_check_~a#1.offset| 0) (= |c_ULTIMATE.start_check_~sum~0#1| 0))) is different from false [2023-02-18 04:54:10,020 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse16 (+ 0 1))) (and (not (= |c_ULTIMATE.start_check_~a0#1.base| |c_ULTIMATE.start_check_~a#1.base|)) (= |c_ULTIMATE.start_check_~i~0#1| 0) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|)) (.cse8 (+ (* 4 0) 0)) (.cse7 (+ (* .cse16 4) 0)) (.cse1 (+ (- 1) 1)) (.cse2 (* (- 1) 1)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_check_~a0#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse4 (* v_prenex_6 4))) (let ((.cse3 (+ .cse4 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (< v_prenex_6 v_prenex_10) (<= .cse1 (+ .cse2 v_prenex_8)) (<= |c_ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (= (select .cse0 .cse3) 0) (= (select .cse0 (+ .cse4 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse5 (let ((.cse6 (store (store .cse0 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse9 (select .cse6 .cse7))) (store (store .cse6 .cse7 (+ (select .cse6 .cse8) .cse9)) .cse8 .cse9)))) (= (store .cse0 .cse3 v_prenex_7) .cse10)))))) (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse11 (@diff v_arrayElimCell_44 .cse0)) (.cse14 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse11 0)) (= .cse5 (let ((.cse12 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse13 (select .cse12 .cse7))) (store (store .cse12 .cse7 (+ (select .cse12 .cse8) .cse13)) .cse8 .cse13)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse11) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse1 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse2)) (= (select v_arrayElimCell_44 .cse14) 0) (= (select .cse0 (+ .cse15 0)) 0) (= (store v_arrayElimCell_44 .cse14 v_ArrVal_1207) .cse10))))) (<= |c_ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|))))) (> (+ .cse16 (* (- 1) 0)) 0) (= |c_ULTIMATE.start_check_~a#1.offset| 0) (= |c_ULTIMATE.start_check_~sum~0#1| 0))) is different from true [2023-02-18 04:54:10,113 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 0 1))) (and (= |c_ULTIMATE.start_check_~i~0#1| 0) (> (+ .cse0 (* (- 1) 0)) 0) (= |c_ULTIMATE.start_check_~a#1.offset| 0) (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|)) (.cse10 (+ (* 4 0) 0)) (.cse9 (+ (* .cse0 4) 0)) (.cse4 (+ (- 1) 1)) (.cse5 (* (- 1) 1)) (.cse1 ((as const (Array Int Int)) 0)) (.cse12 (* |c_ULTIMATE.start_check_~i~0#1| 4))) (or (and (= (select .cse1 (@diff .cse1 .cse1)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (|ULTIMATE.start_check_~a0#1.base| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse6 (* v_prenex_6 4))) (let ((.cse3 (+ .cse6 |ULTIMATE.start_main_~a0~0#1.offset|)) (.cse2 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse2 (store .cse1 .cse3 v_prenex_7)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (< v_prenex_6 v_prenex_10) (<= .cse4 (+ .cse5 v_prenex_8)) (= (select .cse1 .cse3) 0) (= (select .cse1 (+ .cse6 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse7 (let ((.cse8 (store (store .cse1 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse11 (select .cse8 .cse9))) (store (store .cse8 .cse9 (+ (select .cse8 .cse10) .cse11)) .cse10 .cse11)))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)) (= |c_ULTIMATE.start_check_#t~mem12#1| (select .cse2 (+ .cse12 |ULTIMATE.start_check_~a0#1.offset|)))))))) (exists ((|ULTIMATE.start_check_~a0#1.base| Int)) (and (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)) (exists ((|ULTIMATE.start_check_~a0#1.offset| Int)) (let ((.cse18 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse17 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse13 (@diff v_arrayElimCell_44 .cse1)) (.cse16 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse17))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse1 (store v_arrayElimCell_44 .cse13 0)) (= .cse7 (let ((.cse14 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse15 (select .cse14 .cse9))) (store (store .cse14 .cse9 (+ (select .cse14 .cse10) .cse15)) .cse10 .cse15)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse13) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse4 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse5)) (= (select v_arrayElimCell_44 .cse16) 0) (= (select .cse1 (+ .cse17 0)) 0) (= .cse18 (store v_arrayElimCell_44 .cse16 v_ArrVal_1207)))))))) (= |c_ULTIMATE.start_check_#t~mem12#1| (select .cse18 (+ .cse12 |ULTIMATE.start_check_~a0#1.offset|)))))))))) (= |c_ULTIMATE.start_check_~sum~0#1| 0))) is different from false [2023-02-18 04:54:10,117 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 0 1))) (and (= |c_ULTIMATE.start_check_~i~0#1| 0) (> (+ .cse0 (* (- 1) 0)) 0) (= |c_ULTIMATE.start_check_~a#1.offset| 0) (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|)) (.cse10 (+ (* 4 0) 0)) (.cse9 (+ (* .cse0 4) 0)) (.cse4 (+ (- 1) 1)) (.cse5 (* (- 1) 1)) (.cse1 ((as const (Array Int Int)) 0)) (.cse12 (* |c_ULTIMATE.start_check_~i~0#1| 4))) (or (and (= (select .cse1 (@diff .cse1 .cse1)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (|ULTIMATE.start_check_~a0#1.base| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse6 (* v_prenex_6 4))) (let ((.cse3 (+ .cse6 |ULTIMATE.start_main_~a0~0#1.offset|)) (.cse2 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse2 (store .cse1 .cse3 v_prenex_7)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (< v_prenex_6 v_prenex_10) (<= .cse4 (+ .cse5 v_prenex_8)) (= (select .cse1 .cse3) 0) (= (select .cse1 (+ .cse6 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse7 (let ((.cse8 (store (store .cse1 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse11 (select .cse8 .cse9))) (store (store .cse8 .cse9 (+ (select .cse8 .cse10) .cse11)) .cse10 .cse11)))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)) (= |c_ULTIMATE.start_check_#t~mem12#1| (select .cse2 (+ .cse12 |ULTIMATE.start_check_~a0#1.offset|)))))))) (exists ((|ULTIMATE.start_check_~a0#1.base| Int)) (and (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)) (exists ((|ULTIMATE.start_check_~a0#1.offset| Int)) (let ((.cse18 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse17 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse13 (@diff v_arrayElimCell_44 .cse1)) (.cse16 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse17))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse1 (store v_arrayElimCell_44 .cse13 0)) (= .cse7 (let ((.cse14 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse15 (select .cse14 .cse9))) (store (store .cse14 .cse9 (+ (select .cse14 .cse10) .cse15)) .cse10 .cse15)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse13) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse4 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse5)) (= (select v_arrayElimCell_44 .cse16) 0) (= (select .cse1 (+ .cse17 0)) 0) (= .cse18 (store v_arrayElimCell_44 .cse16 v_ArrVal_1207)))))))) (= |c_ULTIMATE.start_check_#t~mem12#1| (select .cse18 (+ .cse12 |ULTIMATE.start_check_~a0#1.offset|)))))))))) (= |c_ULTIMATE.start_check_~sum~0#1| 0))) is different from true [2023-02-18 04:54:10,147 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 0 1)) (.cse1 (* (- 1) 0))) (and (= |c_ULTIMATE.start_check_~i~0#1| 0) (> (+ .cse0 .cse1) 0) (let ((.cse3 (* |c_ULTIMATE.start_check_~i~0#1| 4)) (.cse4 (+ .cse1 |c_ULTIMATE.start_check_~sum~0#1|)) (.cse12 (+ (- 1) 1)) (.cse13 (* (- 1) 1)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|)) (.cse10 (+ (* 4 0) 0)) (.cse9 (+ (* .cse0 4) 0)) (.cse5 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_check_~a0#1.base| Int)) (and (exists ((|ULTIMATE.start_check_~a0#1.offset| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (= (select .cse2 (+ .cse3 |ULTIMATE.start_check_~a0#1.offset|)) .cse4) (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse5)) (.cse14 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse5 (store v_arrayElimCell_44 .cse6 0)) (= .cse7 (let ((.cse8 (store (store .cse5 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse11 (select .cse8 .cse9))) (store (store .cse8 .cse9 (+ (select .cse8 .cse10) .cse11)) .cse10 .cse11)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse6) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse12 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse13)) (= (select v_arrayElimCell_44 .cse14) 0) (= (select .cse5 (+ .cse15 0)) 0) (= .cse2 (store v_arrayElimCell_44 .cse14 v_ArrVal_1207))))))))))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)))) (and (= (select .cse5 (@diff .cse5 .cse5)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (|ULTIMATE.start_check_~a0#1.base| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse18 (* v_prenex_6 4))) (let ((.cse16 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|)) (.cse17 (+ .cse18 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (= (select .cse16 (+ .cse3 |ULTIMATE.start_check_~a0#1.offset|)) .cse4) (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse16 (store .cse5 .cse17 v_prenex_7)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (< v_prenex_6 v_prenex_10) (<= .cse12 (+ .cse13 v_prenex_8)) (= (select .cse5 .cse17) 0) (= (select .cse5 (+ .cse18 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse7 (let ((.cse19 (store (store .cse5 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse20 (select .cse19 .cse9))) (store (store .cse19 .cse9 (+ (select .cse19 .cse10) .cse20)) .cse10 .cse20)))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|))))))))) (= |c_ULTIMATE.start_check_~a#1.offset| 0))) is different from false [2023-02-18 04:54:10,151 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 0 1)) (.cse1 (* (- 1) 0))) (and (= |c_ULTIMATE.start_check_~i~0#1| 0) (> (+ .cse0 .cse1) 0) (let ((.cse3 (* |c_ULTIMATE.start_check_~i~0#1| 4)) (.cse4 (+ .cse1 |c_ULTIMATE.start_check_~sum~0#1|)) (.cse12 (+ (- 1) 1)) (.cse13 (* (- 1) 1)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|)) (.cse10 (+ (* 4 0) 0)) (.cse9 (+ (* .cse0 4) 0)) (.cse5 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_check_~a0#1.base| Int)) (and (exists ((|ULTIMATE.start_check_~a0#1.offset| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (= (select .cse2 (+ .cse3 |ULTIMATE.start_check_~a0#1.offset|)) .cse4) (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse5)) (.cse14 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse5 (store v_arrayElimCell_44 .cse6 0)) (= .cse7 (let ((.cse8 (store (store .cse5 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse11 (select .cse8 .cse9))) (store (store .cse8 .cse9 (+ (select .cse8 .cse10) .cse11)) .cse10 .cse11)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse6) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse12 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse13)) (= (select v_arrayElimCell_44 .cse14) 0) (= (select .cse5 (+ .cse15 0)) 0) (= .cse2 (store v_arrayElimCell_44 .cse14 v_ArrVal_1207))))))))))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)))) (and (= (select .cse5 (@diff .cse5 .cse5)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (|ULTIMATE.start_check_~a0#1.base| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse18 (* v_prenex_6 4))) (let ((.cse16 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|)) (.cse17 (+ .cse18 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (= (select .cse16 (+ .cse3 |ULTIMATE.start_check_~a0#1.offset|)) .cse4) (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse16 (store .cse5 .cse17 v_prenex_7)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (< v_prenex_6 v_prenex_10) (<= .cse12 (+ .cse13 v_prenex_8)) (= (select .cse5 .cse17) 0) (= (select .cse5 (+ .cse18 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse7 (let ((.cse19 (store (store .cse5 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse20 (select .cse19 .cse9))) (store (store .cse19 .cse9 (+ (select .cse19 .cse10) .cse20)) .cse10 .cse20)))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|))))))))) (= |c_ULTIMATE.start_check_~a#1.offset| 0))) is different from true [2023-02-18 04:54:10,185 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 0 1)) (.cse1 (* (- 1) 0)) (.cse21 (+ (- 1) |c_ULTIMATE.start_check_~i~0#1|))) (and (> (+ .cse0 .cse1) 0) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_check_~sum~0#1|)) (.cse4 (* .cse21 4)) (.cse12 (+ (- 1) 1)) (.cse13 (* (- 1) 1)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|)) (.cse10 (+ (* 4 0) 0)) (.cse9 (+ (* .cse0 4) 0)) (.cse5 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_check_~a0#1.base| Int)) (and (exists ((|ULTIMATE.start_check_~a0#1.offset| Int)) (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (= .cse2 (select .cse3 (+ .cse4 |ULTIMATE.start_check_~a0#1.offset|))) (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse5)) (.cse14 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse5 (store v_arrayElimCell_44 .cse6 0)) (= .cse7 (let ((.cse8 (store (store .cse5 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse11 (select .cse8 .cse9))) (store (store .cse8 .cse9 (+ (select .cse8 .cse10) .cse11)) .cse10 .cse11)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse6) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse12 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse13)) (= (select v_arrayElimCell_44 .cse14) 0) (= (select .cse5 (+ .cse15 0)) 0) (= .cse3 (store v_arrayElimCell_44 .cse14 v_ArrVal_1207))))))))))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)))) (and (= (select .cse5 (@diff .cse5 .cse5)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (|ULTIMATE.start_check_~a0#1.base| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse18 (* v_prenex_6 4))) (let ((.cse16 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|)) (.cse17 (+ .cse18 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse16 (store .cse5 .cse17 v_prenex_7)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= .cse2 (select .cse16 (+ .cse4 |ULTIMATE.start_check_~a0#1.offset|))) (< v_prenex_6 v_prenex_10) (<= .cse12 (+ .cse13 v_prenex_8)) (= (select .cse5 .cse17) 0) (= (select .cse5 (+ .cse18 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse7 (let ((.cse19 (store (store .cse5 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse20 (select .cse19 .cse9))) (store (store .cse19 .cse9 (+ (select .cse19 .cse10) .cse20)) .cse10 .cse20)))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|))))))))) (= |c_ULTIMATE.start_check_~a#1.offset| 0) (= .cse21 0))) is different from false [2023-02-18 04:54:10,189 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 0 1)) (.cse1 (* (- 1) 0)) (.cse21 (+ (- 1) |c_ULTIMATE.start_check_~i~0#1|))) (and (> (+ .cse0 .cse1) 0) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_check_~sum~0#1|)) (.cse4 (* .cse21 4)) (.cse12 (+ (- 1) 1)) (.cse13 (* (- 1) 1)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|)) (.cse10 (+ (* 4 0) 0)) (.cse9 (+ (* .cse0 4) 0)) (.cse5 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_check_~a0#1.base| Int)) (and (exists ((|ULTIMATE.start_check_~a0#1.offset| Int)) (let ((.cse3 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (= .cse2 (select .cse3 (+ .cse4 |ULTIMATE.start_check_~a0#1.offset|))) (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse6 (@diff v_arrayElimCell_44 .cse5)) (.cse14 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse5 (store v_arrayElimCell_44 .cse6 0)) (= .cse7 (let ((.cse8 (store (store .cse5 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse11 (select .cse8 .cse9))) (store (store .cse8 .cse9 (+ (select .cse8 .cse10) .cse11)) .cse10 .cse11)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse6) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse12 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse13)) (= (select v_arrayElimCell_44 .cse14) 0) (= (select .cse5 (+ .cse15 0)) 0) (= .cse3 (store v_arrayElimCell_44 .cse14 v_ArrVal_1207))))))))))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)))) (and (= (select .cse5 (@diff .cse5 .cse5)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (|ULTIMATE.start_check_~a0#1.base| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse18 (* v_prenex_6 4))) (let ((.cse16 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|)) (.cse17 (+ .cse18 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse16 (store .cse5 .cse17 v_prenex_7)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= .cse2 (select .cse16 (+ .cse4 |ULTIMATE.start_check_~a0#1.offset|))) (< v_prenex_6 v_prenex_10) (<= .cse12 (+ .cse13 v_prenex_8)) (= (select .cse5 .cse17) 0) (= (select .cse5 (+ .cse18 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse7 (let ((.cse19 (store (store .cse5 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse20 (select .cse19 .cse9))) (store (store .cse19 .cse9 (+ (select .cse19 .cse10) .cse20)) .cse10 .cse20)))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|))))))))) (= |c_ULTIMATE.start_check_~a#1.offset| 0) (= .cse21 0))) is different from true [2023-02-18 04:54:10,232 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 04:54:10,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 447 treesize of output 457 [2023-02-18 04:54:10,308 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse28 (+ 0 1)) (.cse27 (* (- 1) 0))) (and (let ((.cse9 (+ (- 1) 1)) (.cse5 ((as const (Array Int Int)) 0))) (let ((.cse13 (= (select .cse5 (@diff .cse5 .cse5)) 0)) (.cse3 (+ (* 4 0) 0)) (.cse2 (+ (* .cse28 4) 0)) (.cse10 (* (- 1) 1)) (.cse6 (+ .cse27 |c_ULTIMATE.start_check_~sum~0#1|)) (.cse7 (* .cse9 4))) (or (exists ((v_arrayElimCell_44 (Array Int Int)) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_prenex_12 Int) (v_prenex_13 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse12 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse11 (+ .cse12 v_prenex_13))) (let ((.cse8 (@diff v_arrayElimCell_44 .cse5)) (.cse0 (store v_arrayElimCell_44 .cse11 v_ArrVal_1207))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (= .cse0 (let ((.cse1 (store (store .cse5 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse4 (select .cse1 .cse2))) (store (store .cse1 .cse2 (+ (select .cse1 .cse3) .cse4)) .cse3 .cse4)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse6 (select .cse0 (+ .cse7 v_prenex_12))) (= .cse5 (store v_arrayElimCell_44 .cse8 0)) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse8) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse9 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse10)) (= (select v_arrayElimCell_44 .cse11) 0) (<= v_prenex_12 v_prenex_13) (= |c_ULTIMATE.start_check_#t~mem11#1| (select .cse0 (+ (* 4 1) 0))) (= (select .cse5 (+ .cse12 0)) 0)))))) (and .cse13 (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse18 (store (store .cse5 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse19 (select .cse18 .cse2))) (let ((.cse17 (* v_prenex_6 4)) (.cse15 (+ (select .cse18 .cse3) .cse19))) (let ((.cse14 (store (store .cse18 .cse2 .cse15) .cse3 .cse19)) (.cse16 (+ .cse17 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse6 (select .cse14 (+ .cse7 |ULTIMATE.start_check_~a0#1.offset|))) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= |c_ULTIMATE.start_check_#t~mem11#1| .cse15) (< v_prenex_6 v_prenex_10) (<= .cse9 (+ .cse10 v_prenex_8)) (= .cse14 (store .cse5 .cse16 v_prenex_7)) (= (select .cse5 .cse16) 0) (= (select .cse5 (+ .cse17 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1))))))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_prenex_12 Int) (v_prenex_13 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse23 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse21 (@diff v_arrayElimCell_44 .cse5)) (.cse20 (+ .cse23 v_prenex_13))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse6 (select (store v_arrayElimCell_44 .cse20 v_ArrVal_1207) (+ .cse7 v_prenex_12))) (= .cse5 (store v_arrayElimCell_44 .cse21 0)) (= |c_ULTIMATE.start_check_#t~mem11#1| (let ((.cse22 (store (store .cse5 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (+ (select .cse22 .cse3) (select .cse22 .cse2)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse21) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse9 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse10)) (= (select v_arrayElimCell_44 .cse20) 0) (<= v_prenex_12 v_prenex_13) (= (select .cse5 (+ .cse23 0)) 0))))) (and .cse13 (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse26 (* v_prenex_6 4))) (let ((.cse25 (+ .cse26 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= |c_ULTIMATE.start_check_#t~mem11#1| (let ((.cse24 (store (store .cse5 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (+ (select .cse24 .cse3) (select .cse24 .cse2)))) (< v_prenex_6 v_prenex_10) (<= .cse9 (+ .cse10 v_prenex_8)) (= .cse6 (select (store .cse5 .cse25 v_prenex_7) (+ .cse7 |ULTIMATE.start_check_~a0#1.offset|))) (= (select .cse5 .cse25) 0) (= (select .cse5 (+ .cse26 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)))))))))) (> (+ .cse28 .cse27) 0))) is different from false [2023-02-18 04:54:10,314 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse28 (+ 0 1)) (.cse27 (* (- 1) 0))) (and (let ((.cse9 (+ (- 1) 1)) (.cse5 ((as const (Array Int Int)) 0))) (let ((.cse13 (= (select .cse5 (@diff .cse5 .cse5)) 0)) (.cse3 (+ (* 4 0) 0)) (.cse2 (+ (* .cse28 4) 0)) (.cse10 (* (- 1) 1)) (.cse6 (+ .cse27 |c_ULTIMATE.start_check_~sum~0#1|)) (.cse7 (* .cse9 4))) (or (exists ((v_arrayElimCell_44 (Array Int Int)) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_prenex_12 Int) (v_prenex_13 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse12 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse11 (+ .cse12 v_prenex_13))) (let ((.cse8 (@diff v_arrayElimCell_44 .cse5)) (.cse0 (store v_arrayElimCell_44 .cse11 v_ArrVal_1207))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (= .cse0 (let ((.cse1 (store (store .cse5 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse4 (select .cse1 .cse2))) (store (store .cse1 .cse2 (+ (select .cse1 .cse3) .cse4)) .cse3 .cse4)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse6 (select .cse0 (+ .cse7 v_prenex_12))) (= .cse5 (store v_arrayElimCell_44 .cse8 0)) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse8) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse9 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse10)) (= (select v_arrayElimCell_44 .cse11) 0) (<= v_prenex_12 v_prenex_13) (= |c_ULTIMATE.start_check_#t~mem11#1| (select .cse0 (+ (* 4 1) 0))) (= (select .cse5 (+ .cse12 0)) 0)))))) (and .cse13 (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse18 (store (store .cse5 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse19 (select .cse18 .cse2))) (let ((.cse17 (* v_prenex_6 4)) (.cse15 (+ (select .cse18 .cse3) .cse19))) (let ((.cse14 (store (store .cse18 .cse2 .cse15) .cse3 .cse19)) (.cse16 (+ .cse17 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse6 (select .cse14 (+ .cse7 |ULTIMATE.start_check_~a0#1.offset|))) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= |c_ULTIMATE.start_check_#t~mem11#1| .cse15) (< v_prenex_6 v_prenex_10) (<= .cse9 (+ .cse10 v_prenex_8)) (= .cse14 (store .cse5 .cse16 v_prenex_7)) (= (select .cse5 .cse16) 0) (= (select .cse5 (+ .cse17 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1))))))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_prenex_12 Int) (v_prenex_13 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse23 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse21 (@diff v_arrayElimCell_44 .cse5)) (.cse20 (+ .cse23 v_prenex_13))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse6 (select (store v_arrayElimCell_44 .cse20 v_ArrVal_1207) (+ .cse7 v_prenex_12))) (= .cse5 (store v_arrayElimCell_44 .cse21 0)) (= |c_ULTIMATE.start_check_#t~mem11#1| (let ((.cse22 (store (store .cse5 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (+ (select .cse22 .cse3) (select .cse22 .cse2)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse21) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse9 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse10)) (= (select v_arrayElimCell_44 .cse20) 0) (<= v_prenex_12 v_prenex_13) (= (select .cse5 (+ .cse23 0)) 0))))) (and .cse13 (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse26 (* v_prenex_6 4))) (let ((.cse25 (+ .cse26 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= |c_ULTIMATE.start_check_#t~mem11#1| (let ((.cse24 (store (store .cse5 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (+ (select .cse24 .cse3) (select .cse24 .cse2)))) (< v_prenex_6 v_prenex_10) (<= .cse9 (+ .cse10 v_prenex_8)) (= .cse6 (select (store .cse5 .cse25 v_prenex_7) (+ .cse7 |ULTIMATE.start_check_~a0#1.offset|))) (= (select .cse5 .cse25) 0) (= (select .cse5 (+ .cse26 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)))))))))) (> (+ .cse28 .cse27) 0))) is different from true [2023-02-18 04:54:10,419 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 12 not checked. [2023-02-18 04:54:10,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:02:15,620 WARN L837 $PredicateComparison]: unable to prove that (or (not (> 1 0)) (forall ((v_ArrVal_1209 Int) (|v_ULTIMATE.start_upsweep_~right~0#1_73| Int) (|v_ULTIMATE.start_upsweep_~a#1.offset_36| Int) (|v_ULTIMATE.start_check_~a0#1.offset_13| Int)) (or (< |v_ULTIMATE.start_upsweep_~a#1.offset_36| |c_ULTIMATE.start_main_~a~0#1.offset|) (< (+ |v_ULTIMATE.start_upsweep_~right~0#1_73| (* (- 1) 1)) (+ (- 1) 1)) (let ((.cse5 (+ (- 1) (* 2 1)))) (let ((.cse1 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_73| 4) |v_ULTIMATE.start_upsweep_~a#1.offset_36|) v_ArrVal_1209) (+ (* (+ |c_ULTIMATE.start_main_~n~0#1| (- 1)) 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* .cse5 4)))) (let ((.cse4 (select .cse1 .cse2)) (.cse3 (+ (* (+ .cse5 (- 1)) 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (+ .cse4 (select .cse1 .cse3)))) (= .cse0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 .cse2 .cse0) .cse3 .cse4)) |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |v_ULTIMATE.start_check_~a0#1.offset_13| (* 4 0))) 0)))))) (< |c_ULTIMATE.start_main_~a0~0#1.offset| |v_ULTIMATE.start_check_~a0#1.offset_13|)))) is different from false [2023-02-18 05:02:26,268 WARN L837 $PredicateComparison]: unable to prove that (or (not (> 1 0)) (forall ((v_ArrVal_1209 Int) (|v_ULTIMATE.start_upsweep_~right~0#1_73| Int) (|v_ULTIMATE.start_upsweep_~a#1.offset_36| Int) (|v_ULTIMATE.start_check_~a0#1.offset_13| Int) (|ULTIMATE.start_main_~n~0#1| Int) (v_ArrVal_1207 Int)) (or (< |v_ULTIMATE.start_upsweep_~a#1.offset_36| |c_ULTIMATE.start_main_~a~0#1.offset|) (< (+ |v_ULTIMATE.start_upsweep_~right~0#1_73| (* (- 1) 1)) (+ (- 1) 1)) (< (+ |c_ULTIMATE.start_main_~i~1#1| 1) |ULTIMATE.start_main_~n~0#1|) (< |c_ULTIMATE.start_main_~a0~0#1.offset| |v_ULTIMATE.start_check_~a0#1.offset_13|) (let ((.cse6 (+ (- 1) (* 2 1))) (.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |c_ULTIMATE.start_main_~a0~0#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)) v_ArrVal_1207)))) (let ((.cse1 (store (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_73| 4) |v_ULTIMATE.start_upsweep_~a#1.offset_36|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* .cse6 4)))) (let ((.cse4 (+ (* (+ .cse6 (- 1)) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (select .cse1 .cse2))) (let ((.cse3 (+ (select .cse1 .cse4) .cse5))) (= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 .cse2 .cse3) .cse4 .cse5)) |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |v_ULTIMATE.start_check_~a0#1.offset_13| (* 4 0))) 0) .cse3))))) (not (< |c_ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~n~0#1|))))) is different from false [2023-02-18 05:02:28,280 WARN L837 $PredicateComparison]: unable to prove that (or (not (> 1 0)) (forall ((v_ArrVal_1209 Int) (|v_ULTIMATE.start_upsweep_~right~0#1_73| Int) (|v_ULTIMATE.start_upsweep_~a#1.offset_36| Int) (|v_ULTIMATE.start_check_~a0#1.offset_13| Int) (|ULTIMATE.start_main_~n~0#1| Int) (v_ArrVal_1207 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (or (not (< .cse0 |ULTIMATE.start_main_~n~0#1|)) (< (+ .cse0 1) |ULTIMATE.start_main_~n~0#1|) (< |v_ULTIMATE.start_upsweep_~a#1.offset_36| |c_ULTIMATE.start_main_~a~0#1.offset|) (< (+ |v_ULTIMATE.start_upsweep_~right~0#1_73| (* (- 1) 1)) (+ (- 1) 1)) (let ((.cse7 (+ (- 1) (* 2 1))) (.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ (* .cse0 4) |c_ULTIMATE.start_main_~a0~0#1.offset|) v_ArrVal_1207)))) (let ((.cse2 (store (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_73| 4) |v_ULTIMATE.start_upsweep_~a#1.offset_36|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* .cse7 4)))) (let ((.cse6 (select .cse2 .cse3)) (.cse5 (+ (* (+ .cse7 (- 1)) 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (+ .cse6 (select .cse2 .cse5)))) (= (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse2 .cse3 .cse4) .cse5 .cse6)) |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |v_ULTIMATE.start_check_~a0#1.offset_13| (* 4 0))) 0) .cse4))))) (< |c_ULTIMATE.start_main_~a0~0#1.offset| |v_ULTIMATE.start_check_~a0#1.offset_13|))))) is different from false [2023-02-18 05:02:30,297 WARN L837 $PredicateComparison]: unable to prove that (or (not (> 1 0)) (forall ((v_ArrVal_1209 Int) (|v_ULTIMATE.start_upsweep_~right~0#1_73| Int) (|v_ULTIMATE.start_upsweep_~a#1.offset_36| Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (|v_ULTIMATE.start_check_~a0#1.offset_13| Int) (|ULTIMATE.start_main_~n~0#1| Int) (v_ArrVal_1207 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (or (not (< .cse0 |ULTIMATE.start_main_~n~0#1|)) (< (+ .cse0 1) |ULTIMATE.start_main_~n~0#1|) (< |v_ULTIMATE.start_upsweep_~a#1.offset_36| |c_ULTIMATE.start_main_~a~0#1.offset|) (< (+ |v_ULTIMATE.start_upsweep_~right~0#1_73| (* (- 1) 1)) (+ (- 1) 1)) (let ((.cse7 (+ (- 1) (* 2 1))) (.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |ULTIMATE.start_main_~a0~0#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)) |c_ULTIMATE.start_main_#t~mem18#1|) (+ (* .cse0 4) |ULTIMATE.start_main_~a0~0#1.offset|) v_ArrVal_1207)))) (let ((.cse3 (store (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_73| 4) |v_ULTIMATE.start_upsweep_~a#1.offset_36|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* .cse7 4)))) (let ((.cse5 (+ (* (+ .cse7 (- 1)) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select .cse3 .cse4))) (let ((.cse1 (+ (select .cse3 .cse5) .cse6))) (= .cse1 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse3 .cse4 .cse1) .cse5 .cse6)) |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |v_ULTIMATE.start_check_~a0#1.offset_13| (* 4 0))) 0)))))) (< |ULTIMATE.start_main_~a0~0#1.offset| |v_ULTIMATE.start_check_~a0#1.offset_13|))))) is different from false [2023-02-18 05:02:32,314 WARN L837 $PredicateComparison]: unable to prove that (or (not (> 1 0)) (forall ((v_ArrVal_1209 Int) (|v_ULTIMATE.start_upsweep_~right~0#1_73| Int) (|v_ULTIMATE.start_upsweep_~a#1.offset_36| Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (|v_ULTIMATE.start_check_~a0#1.offset_13| Int) (|ULTIMATE.start_main_~n~0#1| Int) (v_ArrVal_1207 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (or (not (< .cse0 |ULTIMATE.start_main_~n~0#1|)) (< (+ .cse0 1) |ULTIMATE.start_main_~n~0#1|) (< |v_ULTIMATE.start_upsweep_~a#1.offset_36| |c_ULTIMATE.start_main_~a~0#1.offset|) (< (+ |v_ULTIMATE.start_upsweep_~right~0#1_73| (* (- 1) 1)) (+ (- 1) 1)) (< |ULTIMATE.start_main_~a0~0#1.offset| |v_ULTIMATE.start_check_~a0#1.offset_13|) (let ((.cse7 (+ (- 1) (* 2 1))) (.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| (store (let ((.cse8 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse8) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse8)))) (+ (* .cse0 4) |ULTIMATE.start_main_~a0~0#1.offset|) v_ArrVal_1207)))) (let ((.cse3 (store (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_73| 4) |v_ULTIMATE.start_upsweep_~a#1.offset_36|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* .cse7 4)))) (let ((.cse5 (+ (* (+ .cse7 (- 1)) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select .cse3 .cse4))) (let ((.cse1 (+ (select .cse3 .cse5) .cse6))) (= .cse1 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse3 .cse4 .cse1) .cse5 .cse6)) |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |v_ULTIMATE.start_check_~a0#1.offset_13| (* 4 0))) 0)))))))))) is different from false [2023-02-18 05:02:34,333 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1209 Int) (|v_ULTIMATE.start_upsweep_~right~0#1_73| Int) (|v_ULTIMATE.start_upsweep_~a#1.offset_36| Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (|v_ULTIMATE.start_check_~a0#1.offset_13| Int) (|ULTIMATE.start_main_~n~0#1| Int) (v_ArrVal_1207 Int)) (let ((.cse0 (+ 0 1))) (or (< |v_ULTIMATE.start_upsweep_~a#1.offset_36| |c_ULTIMATE.start_main_~a~0#1.offset|) (< (+ |v_ULTIMATE.start_upsweep_~right~0#1_73| (* (- 1) 1)) (+ (- 1) 1)) (< |ULTIMATE.start_main_~a0~0#1.offset| |v_ULTIMATE.start_check_~a0#1.offset_13|) (< (+ .cse0 1) |ULTIMATE.start_main_~n~0#1|) (not (< .cse0 |ULTIMATE.start_main_~n~0#1|)) (let ((.cse7 (* 4 0))) (let ((.cse8 (+ (- 1) (* 2 1))) (.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base|) (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse7) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse7))) (+ |ULTIMATE.start_main_~a0~0#1.offset| (* .cse0 4)) v_ArrVal_1207)))) (let ((.cse2 (store (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_upsweep_~right~0#1_73| 4) |v_ULTIMATE.start_upsweep_~a#1.offset_36|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_main_~n~0#1|) 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* .cse8 4)))) (let ((.cse6 (select .cse2 .cse3)) (.cse5 (+ (* (+ .cse8 (- 1)) 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (+ .cse6 (select .cse2 .cse5)))) (= (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse2 .cse3 .cse4) .cse5 .cse6)) |c_ULTIMATE.start_main_#t~malloc16#1.base|) (+ |v_ULTIMATE.start_check_~a0#1.offset_13| .cse7)) 0) .cse4))))))))) (not (> 1 0))) is different from false [2023-02-18 05:04:31,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493479518] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:04:31,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 05:04:31,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 44] total 73 [2023-02-18 05:04:31,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338532829] [2023-02-18 05:04:31,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 05:04:31,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-02-18 05:04:31,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:04:31,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-02-18 05:04:31,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=4754, Unknown=314, NotChecked=5394, Total=10920 [2023-02-18 05:04:31,027 INFO L87 Difference]: Start difference. First operand 262 states and 298 transitions. Second operand has 73 states, 70 states have (on average 1.7714285714285714) internal successors, (124), 69 states have internal predecessors, (124), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 05:04:40,968 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse11 ((as const (Array Int Int)) 0)) (.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse18 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse0 (= 0 (select .cse16 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse18)))) (.cse13 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse18)) (.cse17 (@diff .cse14 .cse11))) (let ((.cse10 (= |c_ULTIMATE.start_main_#t~malloc16#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (or (= (select .cse14 .cse17) 0) (= .cse11 .cse14))) (.cse5 (<= (+ |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~i~1#1|) (+ |c_ULTIMATE.start_main_~n~0#1| 1))) (.cse6 (= (select .cse14 .cse13) 0)) (.cse7 (= .cse11 (store .cse14 .cse17 0))) (.cse3 (not .cse0)) (.cse2 (= .cse11 .cse16)) (.cse12 (<= 0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 2)))) (.cse8 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse9 (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |c_ULTIMATE.start_main_~i~1#1|)))) (and .cse0 (or .cse1 (and .cse0 .cse2 (or .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse2 .cse8 .cse9)))) (not .cse10) (or .cse10 (and .cse2 (= .cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base|)) .cse8)) (not .cse1) .cse5 (or .cse1 (and .cse0 (or (and .cse4 .cse5 .cse6 .cse7 .cse2 (= |c_ULTIMATE.start_main_#t~mem18#1| 0) .cse12 .cse8) .cse3) .cse2)) (= |c_ULTIMATE.start_main_#t~malloc15#1.offset| 0) .cse2 (= .cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc15#1.base|)) (or (and (<= 0 1) (= |c_ULTIMATE.start_is_pow2_#res#1| 1) (< 1 4294967296)) (= |c_ULTIMATE.start_is_pow2_#res#1| 0)) (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc15#1.base|) 1) (or (and (= (select .cse11 .cse13) 0) (= (select .cse11 (@diff .cse11 .cse11)) 0) (exists ((v_ArrVal_1207 Int)) (= (store .cse11 .cse13 v_ArrVal_1207) .cse14))) (exists ((v_arrayElimCell_44 (Array Int Int)) (v_ArrVal_1207 Int)) (let ((.cse15 (@diff v_arrayElimCell_44 .cse11))) (and (= (select v_arrayElimCell_44 .cse13) 0) (= .cse11 (store v_arrayElimCell_44 .cse15 0)) (= (select v_arrayElimCell_44 .cse15) 0) (= (store v_arrayElimCell_44 .cse13 v_ArrVal_1207) .cse14))))) .cse12 .cse8 (< |c_ULTIMATE.start_main_~i~1#1| |c_ULTIMATE.start_main_~n~0#1|) .cse9)))) is different from false [2023-02-18 05:04:40,972 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse11 ((as const (Array Int Int)) 0)) (.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse18 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse0 (= 0 (select .cse16 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse18)))) (.cse13 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse18)) (.cse17 (@diff .cse14 .cse11))) (let ((.cse10 (= |c_ULTIMATE.start_main_#t~malloc16#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (or (= (select .cse14 .cse17) 0) (= .cse11 .cse14))) (.cse5 (<= (+ |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~i~1#1|) (+ |c_ULTIMATE.start_main_~n~0#1| 1))) (.cse6 (= (select .cse14 .cse13) 0)) (.cse7 (= .cse11 (store .cse14 .cse17 0))) (.cse3 (not .cse0)) (.cse2 (= .cse11 .cse16)) (.cse12 (<= 0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 2)))) (.cse8 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse9 (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |c_ULTIMATE.start_main_~i~1#1|)))) (and .cse0 (or .cse1 (and .cse0 .cse2 (or .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse2 .cse8 .cse9)))) (not .cse10) (or .cse10 (and .cse2 (= .cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base|)) .cse8)) (not .cse1) .cse5 (or .cse1 (and .cse0 (or (and .cse4 .cse5 .cse6 .cse7 .cse2 (= |c_ULTIMATE.start_main_#t~mem18#1| 0) .cse12 .cse8) .cse3) .cse2)) (= |c_ULTIMATE.start_main_#t~malloc15#1.offset| 0) .cse2 (= .cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc15#1.base|)) (or (and (<= 0 1) (= |c_ULTIMATE.start_is_pow2_#res#1| 1) (< 1 4294967296)) (= |c_ULTIMATE.start_is_pow2_#res#1| 0)) (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc15#1.base|) 1) (or (and (= (select .cse11 .cse13) 0) (= (select .cse11 (@diff .cse11 .cse11)) 0) (exists ((v_ArrVal_1207 Int)) (= (store .cse11 .cse13 v_ArrVal_1207) .cse14))) (exists ((v_arrayElimCell_44 (Array Int Int)) (v_ArrVal_1207 Int)) (let ((.cse15 (@diff v_arrayElimCell_44 .cse11))) (and (= (select v_arrayElimCell_44 .cse13) 0) (= .cse11 (store v_arrayElimCell_44 .cse15 0)) (= (select v_arrayElimCell_44 .cse15) 0) (= (store v_arrayElimCell_44 .cse13 v_ArrVal_1207) .cse14))))) .cse12 .cse8 (< |c_ULTIMATE.start_main_~i~1#1| |c_ULTIMATE.start_main_~n~0#1|) .cse9)))) is different from true [2023-02-18 05:04:40,976 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((as const (Array Int Int)) 0)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (= 0 (select .cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse12)))) (.cse2 (<= (+ |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~i~1#1|) (+ |c_ULTIMATE.start_main_~n~0#1| 1))) (.cse5 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse12)) (.cse8 (<= 0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 2)))) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse3 (= .cse4 .cse11)) (.cse10 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and .cse0 (not .cse1) .cse2 .cse3 (or (and (= (select .cse4 .cse5) 0) (= (select .cse4 (@diff .cse4 .cse4)) 0) (exists ((v_ArrVal_1207 Int)) (= (store .cse4 .cse5 v_ArrVal_1207) .cse6))) (exists ((v_arrayElimCell_44 (Array Int Int)) (v_ArrVal_1207 Int)) (let ((.cse7 (@diff v_arrayElimCell_44 .cse4))) (and (= (select v_arrayElimCell_44 .cse5) 0) (= .cse4 (store v_arrayElimCell_44 .cse7 0)) (= (select v_arrayElimCell_44 .cse7) 0) (= (store v_arrayElimCell_44 .cse5 v_ArrVal_1207) .cse6))))) .cse8 (or .cse1 (and .cse0 (or (not .cse0) (let ((.cse9 (@diff .cse6 .cse4))) (and (or (= (select .cse6 .cse9) 0) (= .cse4 .cse6)) .cse2 (= (select .cse6 .cse5) 0) (= .cse4 (store .cse6 .cse9 0)) .cse3 .cse8 .cse10))) .cse3)) .cse10 (< |c_ULTIMATE.start_main_~i~1#1| |c_ULTIMATE.start_main_~n~0#1|) (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |c_ULTIMATE.start_main_~i~1#1|))))) is different from false [2023-02-18 05:04:40,978 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((as const (Array Int Int)) 0)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (= 0 (select .cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse12)))) (.cse2 (<= (+ |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~i~1#1|) (+ |c_ULTIMATE.start_main_~n~0#1| 1))) (.cse5 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse12)) (.cse8 (<= 0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 2)))) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse3 (= .cse4 .cse11)) (.cse10 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and .cse0 (not .cse1) .cse2 .cse3 (or (and (= (select .cse4 .cse5) 0) (= (select .cse4 (@diff .cse4 .cse4)) 0) (exists ((v_ArrVal_1207 Int)) (= (store .cse4 .cse5 v_ArrVal_1207) .cse6))) (exists ((v_arrayElimCell_44 (Array Int Int)) (v_ArrVal_1207 Int)) (let ((.cse7 (@diff v_arrayElimCell_44 .cse4))) (and (= (select v_arrayElimCell_44 .cse5) 0) (= .cse4 (store v_arrayElimCell_44 .cse7 0)) (= (select v_arrayElimCell_44 .cse7) 0) (= (store v_arrayElimCell_44 .cse5 v_ArrVal_1207) .cse6))))) .cse8 (or .cse1 (and .cse0 (or (not .cse0) (let ((.cse9 (@diff .cse6 .cse4))) (and (or (= (select .cse6 .cse9) 0) (= .cse4 .cse6)) .cse2 (= (select .cse6 .cse5) 0) (= .cse4 (store .cse6 .cse9 0)) .cse3 .cse8 .cse10))) .cse3)) .cse10 (< |c_ULTIMATE.start_main_~i~1#1| |c_ULTIMATE.start_main_~n~0#1|) (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |c_ULTIMATE.start_main_~i~1#1|))))) is different from true [2023-02-18 05:04:40,982 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse10 (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse11 (<= (+ |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~i~1#1|) (+ |c_ULTIMATE.start_main_~n~0#1| 2))) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse13 (= .cse0 .cse5)) (.cse14 (<= 0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 2)))) (.cse15 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (let ((.cse2 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse3 (+ (- 1) |c_ULTIMATE.start_main_~i~1#1|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse6 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse6))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 .cse1) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse2) (>= |v_ULTIMATE.start_main_~i~1#1_171| .cse3) (= .cse4 (store .cse0 .cse1 v_ArrVal_1207)) (= (select .cse5 (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int)) (let ((.cse9 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse2) (exists ((v_arrayElimCell_44 (Array Int Int)) (v_ArrVal_1207 Int)) (let ((.cse7 (@diff v_arrayElimCell_44 .cse0)) (.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (= .cse0 (store v_arrayElimCell_44 .cse7 0)) (= (select v_arrayElimCell_44 .cse8) 0) (= (select v_arrayElimCell_44 .cse7) 0) (= (store v_arrayElimCell_44 .cse8 v_ArrVal_1207) .cse4)))) (>= |v_ULTIMATE.start_main_~i~1#1_171| .cse3) (= (select .cse5 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (not .cse10) .cse11 (or .cse10 (let ((.cse12 (@diff .cse4 .cse0))) (and (or (= (select .cse4 .cse12) 0) (= .cse0 .cse4)) (= .cse0 (store .cse4 .cse12 0)) .cse11 .cse13 .cse14 .cse15))) .cse13 .cse14 .cse15))) is different from false [2023-02-18 05:04:40,985 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse10 (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse11 (<= (+ |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~i~1#1|) (+ |c_ULTIMATE.start_main_~n~0#1| 2))) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse13 (= .cse0 .cse5)) (.cse14 (<= 0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 2)))) (.cse15 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (let ((.cse2 (+ |c_ULTIMATE.start_main_~n~0#1| 1)) (.cse3 (+ (- 1) |c_ULTIMATE.start_main_~i~1#1|))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse6 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse6))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse0 .cse1) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse2) (>= |v_ULTIMATE.start_main_~i~1#1_171| .cse3) (= .cse4 (store .cse0 .cse1 v_ArrVal_1207)) (= (select .cse5 (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int)) (let ((.cse9 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse2) (exists ((v_arrayElimCell_44 (Array Int Int)) (v_ArrVal_1207 Int)) (let ((.cse7 (@diff v_arrayElimCell_44 .cse0)) (.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (= .cse0 (store v_arrayElimCell_44 .cse7 0)) (= (select v_arrayElimCell_44 .cse8) 0) (= (select v_arrayElimCell_44 .cse7) 0) (= (store v_arrayElimCell_44 .cse8 v_ArrVal_1207) .cse4)))) (>= |v_ULTIMATE.start_main_~i~1#1_171| .cse3) (= (select .cse5 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (not .cse10) .cse11 (or .cse10 (let ((.cse12 (@diff .cse4 .cse0))) (and (or (= (select .cse4 .cse12) 0) (= .cse0 .cse4)) (= .cse0 (store .cse4 .cse12 0)) .cse11 .cse13 .cse14 .cse15))) .cse13 .cse14 .cse15))) is different from true [2023-02-18 05:04:40,989 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 ((as const (Array Int Int)) 0)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (= .cse3 .cse7)) (.cse2 (<= 0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 2)))) (.cse12 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse14 (<= |c_ULTIMATE.start_main_~n~0#1| 2))) (and (not .cse0) .cse1 .cse2 (let ((.cse5 (+ |c_ULTIMATE.start_main_~n~0#1| 1))) (or (and (= (select .cse3 (@diff .cse3 .cse3)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse8 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse8))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse3 .cse4) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse5) (= .cse6 (store .cse3 .cse4 v_ArrVal_1207)) (= (select .cse7 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse11 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse9 (@diff v_arrayElimCell_44 .cse3)) (.cse10 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse11))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse3 (store v_arrayElimCell_44 .cse9 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse10) 0) (= (select v_arrayElimCell_44 .cse9) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse5) (= (store v_arrayElimCell_44 .cse10 v_ArrVal_1207) .cse6) (= (select .cse7 (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) .cse12 (or .cse0 (let ((.cse13 (@diff .cse6 .cse3))) (and (or (= (select .cse6 .cse13) 0) (= .cse3 .cse6)) (= .cse3 (store .cse6 .cse13 0)) .cse1 .cse2 .cse12 .cse14))) .cse14))) is different from false [2023-02-18 05:04:40,991 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((as const (Array Int Int)) 0)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (= .cse3 .cse7)) (.cse2 (<= 0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 2)))) (.cse12 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse14 (<= |c_ULTIMATE.start_main_~n~0#1| 2))) (and (not .cse0) .cse1 .cse2 (let ((.cse5 (+ |c_ULTIMATE.start_main_~n~0#1| 1))) (or (and (= (select .cse3 (@diff .cse3 .cse3)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse8 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse8))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse3 .cse4) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse5) (= .cse6 (store .cse3 .cse4 v_ArrVal_1207)) (= (select .cse7 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse11 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse9 (@diff v_arrayElimCell_44 .cse3)) (.cse10 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse11))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse3 (store v_arrayElimCell_44 .cse9 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse10) 0) (= (select v_arrayElimCell_44 .cse9) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse5) (= (store v_arrayElimCell_44 .cse10 v_ArrVal_1207) .cse6) (= (select .cse7 (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) .cse12 (or .cse0 (let ((.cse13 (@diff .cse6 .cse3))) (and (or (= (select .cse6 .cse13) 0) (= .cse3 .cse6)) (= .cse3 (store .cse6 .cse13 0)) .cse1 .cse2 .cse12 .cse14))) .cse14))) is different from true [2023-02-18 05:04:40,995 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (<= 0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 2)))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 ((as const (Array Int Int)) 0)) (.cse7 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse8 (<= |c_ULTIMATE.start_main_~n~0#1| 2))) (and (= (+ (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|) 0) (<= 0 (+ (- 2) |c_ULTIMATE.start_upsweep_~n#1|)) .cse0 (not .cse1) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_upsweep_~a#1.offset|) (or .cse1 (let ((.cse2 (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a0~0#1.base|))) (and (or .cse1 (not .cse2)) (or .cse2 (let ((.cse4 (@diff .cse3 .cse5))) (and (or (= (select .cse3 .cse4) 0) (= .cse5 .cse3)) .cse0 (= .cse5 (select |c_#memory_int| |c_ULTIMATE.start_upsweep_~a#1.base|)) (= .cse5 (store .cse3 .cse4 0)) .cse6 .cse7 .cse8)))))) (= .cse5 .cse9) (= |c_ULTIMATE.start_upsweep_~a#1.offset| 0) .cse6 (let ((.cse11 (+ |c_ULTIMATE.start_main_~n~0#1| 1))) (or (and (= (select .cse5 (@diff .cse5 .cse5)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse12 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse10 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse12))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse5 .cse10) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse11) (= .cse3 (store .cse5 .cse10 v_ArrVal_1207)) (= (select .cse9 (+ .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse13 (@diff v_arrayElimCell_44 .cse5)) (.cse14 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse5 (store v_arrayElimCell_44 .cse13 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse14) 0) (= (select v_arrayElimCell_44 .cse13) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse11) (= (store v_arrayElimCell_44 .cse14 v_ArrVal_1207) .cse3) (= (select .cse9 (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) .cse7 (= |c_ULTIMATE.start_upsweep_~space~0#1| 1) .cse8)) is different from false [2023-02-18 05:04:40,999 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (<= 0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 2)))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 ((as const (Array Int Int)) 0)) (.cse7 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse8 (<= |c_ULTIMATE.start_main_~n~0#1| 2))) (and (= (+ (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|) 0) (<= 0 (+ (- 2) |c_ULTIMATE.start_upsweep_~n#1|)) .cse0 (not .cse1) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_upsweep_~a#1.offset|) (or .cse1 (let ((.cse2 (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a0~0#1.base|))) (and (or .cse1 (not .cse2)) (or .cse2 (let ((.cse4 (@diff .cse3 .cse5))) (and (or (= (select .cse3 .cse4) 0) (= .cse5 .cse3)) .cse0 (= .cse5 (select |c_#memory_int| |c_ULTIMATE.start_upsweep_~a#1.base|)) (= .cse5 (store .cse3 .cse4 0)) .cse6 .cse7 .cse8)))))) (= .cse5 .cse9) (= |c_ULTIMATE.start_upsweep_~a#1.offset| 0) .cse6 (let ((.cse11 (+ |c_ULTIMATE.start_main_~n~0#1| 1))) (or (and (= (select .cse5 (@diff .cse5 .cse5)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse12 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse10 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse12))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse5 .cse10) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse11) (= .cse3 (store .cse5 .cse10 v_ArrVal_1207)) (= (select .cse9 (+ .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse13 (@diff v_arrayElimCell_44 .cse5)) (.cse14 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse5 (store v_arrayElimCell_44 .cse13 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse14) 0) (= (select v_arrayElimCell_44 .cse13) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse11) (= (store v_arrayElimCell_44 .cse14 v_ArrVal_1207) .cse3) (= (select .cse9 (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) .cse7 (= |c_ULTIMATE.start_upsweep_~space~0#1| 1) .cse8)) is different from true [2023-02-18 05:04:41,007 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 ((as const (Array Int Int)) 0)) (.cse0 (+ (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|)) (.cse7 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (= .cse0 0) (<= 0 (+ (- 2) |c_ULTIMATE.start_upsweep_~n#1|)) .cse1 (<= .cse0 |c_ULTIMATE.start_upsweep_~left~0#1|) (not .cse2) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_upsweep_~a#1.offset|) (<= |c_ULTIMATE.start_upsweep_~left~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 3) |c_ULTIMATE.start_upsweep_~space~0#1|)) (<= |c_ULTIMATE.start_upsweep_~space~0#1| (+ |c_ULTIMATE.start_upsweep_~left~0#1| 1)) (or .cse2 (let ((.cse3 (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a0~0#1.base|))) (and (or .cse2 (not .cse3)) (or .cse3 (let ((.cse5 (@diff .cse4 .cse6))) (and (or (= (select .cse4 .cse5) 0) (= .cse6 .cse4)) .cse1 (= .cse6 (select |c_#memory_int| |c_ULTIMATE.start_upsweep_~a#1.base|)) (= .cse6 (store .cse4 .cse5 0)) (<= 0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 2))) .cse7 (<= |c_ULTIMATE.start_main_~n~0#1| 2))))))) (= .cse6 .cse8) (= |c_ULTIMATE.start_upsweep_~a#1.offset| 0) (let ((.cse10 (+ |c_ULTIMATE.start_main_~n~0#1| 1))) (or (and (= (select .cse6 (@diff .cse6 .cse6)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse11 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse9 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse11))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse6 .cse9) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse10) (= .cse4 (store .cse6 .cse9 v_ArrVal_1207)) (= (select .cse8 (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse14 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse12 (@diff v_arrayElimCell_44 .cse6)) (.cse13 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse14))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse6 (store v_arrayElimCell_44 .cse12 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse13) 0) (= (select v_arrayElimCell_44 .cse12) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse10) (= (store v_arrayElimCell_44 .cse13 v_ArrVal_1207) .cse4) (= (select .cse8 (+ .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (<= |c_ULTIMATE.start_upsweep_~left~0#1| .cse0) .cse7 (= |c_ULTIMATE.start_upsweep_~space~0#1| 1) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_upsweep_~space~0#1|) (+ 3 |c_ULTIMATE.start_upsweep_~left~0#1|)))) is different from false [2023-02-18 05:04:41,010 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 ((as const (Array Int Int)) 0)) (.cse0 (+ (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|)) (.cse7 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (= .cse0 0) (<= 0 (+ (- 2) |c_ULTIMATE.start_upsweep_~n#1|)) .cse1 (<= .cse0 |c_ULTIMATE.start_upsweep_~left~0#1|) (not .cse2) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_upsweep_~a#1.offset|) (<= |c_ULTIMATE.start_upsweep_~left~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 3) |c_ULTIMATE.start_upsweep_~space~0#1|)) (<= |c_ULTIMATE.start_upsweep_~space~0#1| (+ |c_ULTIMATE.start_upsweep_~left~0#1| 1)) (or .cse2 (let ((.cse3 (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a0~0#1.base|))) (and (or .cse2 (not .cse3)) (or .cse3 (let ((.cse5 (@diff .cse4 .cse6))) (and (or (= (select .cse4 .cse5) 0) (= .cse6 .cse4)) .cse1 (= .cse6 (select |c_#memory_int| |c_ULTIMATE.start_upsweep_~a#1.base|)) (= .cse6 (store .cse4 .cse5 0)) (<= 0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 2))) .cse7 (<= |c_ULTIMATE.start_main_~n~0#1| 2))))))) (= .cse6 .cse8) (= |c_ULTIMATE.start_upsweep_~a#1.offset| 0) (let ((.cse10 (+ |c_ULTIMATE.start_main_~n~0#1| 1))) (or (and (= (select .cse6 (@diff .cse6 .cse6)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse11 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse9 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse11))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse6 .cse9) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse10) (= .cse4 (store .cse6 .cse9 v_ArrVal_1207)) (= (select .cse8 (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse14 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse12 (@diff v_arrayElimCell_44 .cse6)) (.cse13 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse14))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse6 (store v_arrayElimCell_44 .cse12 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse13) 0) (= (select v_arrayElimCell_44 .cse12) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse10) (= (store v_arrayElimCell_44 .cse13 v_ArrVal_1207) .cse4) (= (select .cse8 (+ .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (<= |c_ULTIMATE.start_upsweep_~left~0#1| .cse0) .cse7 (= |c_ULTIMATE.start_upsweep_~space~0#1| 1) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_upsweep_~space~0#1|) (+ 3 |c_ULTIMATE.start_upsweep_~left~0#1|)))) is different from true [2023-02-18 05:04:41,025 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|)) (.cse3 (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (* 2 |c_ULTIMATE.start_upsweep_~space~0#1|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 ((as const (Array Int Int)) 0)) (.cse8 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (<= .cse0 (+ |c_ULTIMATE.start_upsweep_~right~0#1| 1)) (= .cse1 0) (<= 0 (+ (- 2) |c_ULTIMATE.start_upsweep_~n#1|)) (<= .cse1 (+ (* (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|) |c_ULTIMATE.start_upsweep_~right~0#1|)) .cse2 (<= (+ |c_ULTIMATE.start_main_~n~0#1| .cse0) (+ 3 |c_ULTIMATE.start_upsweep_~right~0#1|)) (<= |c_ULTIMATE.start_upsweep_~right~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| .cse0 (- 3))) (not .cse3) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_upsweep_~a#1.offset|) (or .cse3 (let ((.cse4 (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a0~0#1.base|))) (and (or .cse3 (not .cse4)) (or .cse4 (let ((.cse6 (@diff .cse5 .cse7))) (and (or (= (select .cse5 .cse6) 0) (= .cse7 .cse5)) .cse2 (= .cse7 (select |c_#memory_int| |c_ULTIMATE.start_upsweep_~a#1.base|)) (= .cse7 (store .cse5 .cse6 0)) (<= 0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 2))) .cse8 (<= |c_ULTIMATE.start_main_~n~0#1| 2))))))) (= .cse7 .cse9) (= |c_ULTIMATE.start_upsweep_~a#1.offset| 0) (<= |c_ULTIMATE.start_upsweep_~right~0#1| (+ (- 1) .cse0)) (let ((.cse11 (+ |c_ULTIMATE.start_main_~n~0#1| 1))) (or (and (= (select .cse7 (@diff .cse7 .cse7)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse12 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse10 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse12))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse7 .cse10) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse11) (= .cse5 (store .cse7 .cse10 v_ArrVal_1207)) (= (select .cse9 (+ .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse13 (@diff v_arrayElimCell_44 .cse7)) (.cse14 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse7 (store v_arrayElimCell_44 .cse13 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse14) 0) (= (select v_arrayElimCell_44 .cse13) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse11) (= (store v_arrayElimCell_44 .cse14 v_ArrVal_1207) .cse5) (= (select .cse9 (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) .cse8 (= |c_ULTIMATE.start_upsweep_~space~0#1| 1))) is different from false [2023-02-18 05:04:41,029 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|)) (.cse3 (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (* 2 |c_ULTIMATE.start_upsweep_~space~0#1|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 ((as const (Array Int Int)) 0)) (.cse8 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (<= .cse0 (+ |c_ULTIMATE.start_upsweep_~right~0#1| 1)) (= .cse1 0) (<= 0 (+ (- 2) |c_ULTIMATE.start_upsweep_~n#1|)) (<= .cse1 (+ (* (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|) |c_ULTIMATE.start_upsweep_~right~0#1|)) .cse2 (<= (+ |c_ULTIMATE.start_main_~n~0#1| .cse0) (+ 3 |c_ULTIMATE.start_upsweep_~right~0#1|)) (<= |c_ULTIMATE.start_upsweep_~right~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| .cse0 (- 3))) (not .cse3) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_upsweep_~a#1.offset|) (or .cse3 (let ((.cse4 (= |c_ULTIMATE.start_upsweep_~a#1.base| |c_ULTIMATE.start_main_~a0~0#1.base|))) (and (or .cse3 (not .cse4)) (or .cse4 (let ((.cse6 (@diff .cse5 .cse7))) (and (or (= (select .cse5 .cse6) 0) (= .cse7 .cse5)) .cse2 (= .cse7 (select |c_#memory_int| |c_ULTIMATE.start_upsweep_~a#1.base|)) (= .cse7 (store .cse5 .cse6 0)) (<= 0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 2))) .cse8 (<= |c_ULTIMATE.start_main_~n~0#1| 2))))))) (= .cse7 .cse9) (= |c_ULTIMATE.start_upsweep_~a#1.offset| 0) (<= |c_ULTIMATE.start_upsweep_~right~0#1| (+ (- 1) .cse0)) (let ((.cse11 (+ |c_ULTIMATE.start_main_~n~0#1| 1))) (or (and (= (select .cse7 (@diff .cse7 .cse7)) 0) (exists ((|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse12 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse10 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse12))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse7 .cse10) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse11) (= .cse5 (store .cse7 .cse10 v_ArrVal_1207)) (= (select .cse9 (+ .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse13 (@diff v_arrayElimCell_44 .cse7)) (.cse14 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse7 (store v_arrayElimCell_44 .cse13 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse14) 0) (= (select v_arrayElimCell_44 .cse13) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse11) (= (store v_arrayElimCell_44 .cse14 v_ArrVal_1207) .cse5) (= (select .cse9 (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) .cse8 (= |c_ULTIMATE.start_upsweep_~space~0#1| 1))) is different from true [2023-02-18 05:04:41,038 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (+ (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|)) (.cse1 (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse4 ((as const (Array Int Int)) 0)) (.cse10 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (= .cse0 0) (<= 0 (+ (- 2) |c_ULTIMATE.start_upsweep_~n#1|)) (or .cse1 (let ((.cse8 (* |c_ULTIMATE.start_main_~n~0#1| 4)) (.cse5 (* |c_ULTIMATE.start_upsweep_~space~0#1| 8))) (let ((.cse3 (@diff .cse2 .cse4)) (.cse6 (@diff .cse7 .cse4)) (.cse9 (+ .cse8 .cse5 (- 12)))) (and (or (= (select .cse2 .cse3) 0) (= .cse4 .cse2)) (or (<= .cse5 (+ 4 .cse6)) (= .cse4 .cse7)) (<= .cse5 (+ .cse8 .cse5 (- 8))) (= .cse7 (store .cse4 .cse9 (select .cse7 .cse9))) (= .cse4 (store .cse2 .cse3 0)) (<= 0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 2))) .cse10 (= .cse4 (store .cse7 .cse6 0)) (= (+ (- 4) .cse5) .cse9) (<= |c_ULTIMATE.start_main_~n~0#1| 2))))) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= .cse7 (store .cse4 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= .cse0 (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (not .cse1) (let ((.cse11 (+ |c_ULTIMATE.start_main_~n~0#1| 1))) (or (and (= (select .cse4 (@diff .cse4 .cse4)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse13 (* v_prenex_6 4))) (let ((.cse12 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse13))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) v_prenex_6)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| v_prenex_6) .cse11) (= (select .cse4 .cse12) 0) (<= |c_ULTIMATE.start_main_~n~0#1| (+ v_prenex_6 1)) (= .cse2 (store .cse4 .cse12 v_prenex_7)) (< v_prenex_6 |c_ULTIMATE.start_main_~n~0#1|) (= (select .cse4 (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse16 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse14 (@diff v_arrayElimCell_44 .cse4)) (.cse15 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse16))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse4 (store v_arrayElimCell_44 .cse14 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse15) 0) (= (select v_arrayElimCell_44 .cse14) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse11) (= (store v_arrayElimCell_44 .cse15 v_ArrVal_1207) .cse2) (= (select .cse4 (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) .cse10 (= |c_ULTIMATE.start_upsweep_~space~0#1| 1))) is different from false [2023-02-18 05:04:41,043 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (+ (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|)) (.cse1 (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse4 ((as const (Array Int Int)) 0)) (.cse10 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (= .cse0 0) (<= 0 (+ (- 2) |c_ULTIMATE.start_upsweep_~n#1|)) (or .cse1 (let ((.cse8 (* |c_ULTIMATE.start_main_~n~0#1| 4)) (.cse5 (* |c_ULTIMATE.start_upsweep_~space~0#1| 8))) (let ((.cse3 (@diff .cse2 .cse4)) (.cse6 (@diff .cse7 .cse4)) (.cse9 (+ .cse8 .cse5 (- 12)))) (and (or (= (select .cse2 .cse3) 0) (= .cse4 .cse2)) (or (<= .cse5 (+ 4 .cse6)) (= .cse4 .cse7)) (<= .cse5 (+ .cse8 .cse5 (- 8))) (= .cse7 (store .cse4 .cse9 (select .cse7 .cse9))) (= .cse4 (store .cse2 .cse3 0)) (<= 0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 2))) .cse10 (= .cse4 (store .cse7 .cse6 0)) (= (+ (- 4) .cse5) .cse9) (<= |c_ULTIMATE.start_main_~n~0#1| 2))))) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= .cse7 (store .cse4 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= .cse0 (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) |c_ULTIMATE.start_upsweep_~space~0#1|))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (not .cse1) (let ((.cse11 (+ |c_ULTIMATE.start_main_~n~0#1| 1))) (or (and (= (select .cse4 (@diff .cse4 .cse4)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse13 (* v_prenex_6 4))) (let ((.cse12 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse13))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) v_prenex_6)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| v_prenex_6) .cse11) (= (select .cse4 .cse12) 0) (<= |c_ULTIMATE.start_main_~n~0#1| (+ v_prenex_6 1)) (= .cse2 (store .cse4 .cse12 v_prenex_7)) (< v_prenex_6 |c_ULTIMATE.start_main_~n~0#1|) (= (select .cse4 (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse16 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse14 (@diff v_arrayElimCell_44 .cse4)) (.cse15 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse16))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse4 (store v_arrayElimCell_44 .cse14 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse15) 0) (= (select v_arrayElimCell_44 .cse14) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse11) (= (store v_arrayElimCell_44 .cse15 v_ArrVal_1207) .cse2) (= (select .cse4 (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) .cse10 (= |c_ULTIMATE.start_upsweep_~space~0#1| 1))) is different from true [2023-02-18 05:04:41,055 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse11 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse10 (+ (- 4) (* |c_ULTIMATE.start_upsweep_~space~0#1| 4)))) (and (<= 0 (+ (- 2) |c_ULTIMATE.start_upsweep_~n#1|)) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= .cse0 (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) 1) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) 1))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (not .cse2) (= |c_ULTIMATE.start_upsweep_~space~0#1| (* 2 1)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1| 1))) (or (and (= (select .cse1 (@diff .cse1 .cse1)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse6 (* v_prenex_6 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse6))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) v_prenex_6)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| v_prenex_6) .cse3) (= (select .cse1 .cse4) 0) (<= |c_ULTIMATE.start_main_~n~0#1| (+ v_prenex_6 1)) (= .cse5 (store .cse1 .cse4 v_prenex_7)) (< v_prenex_6 |c_ULTIMATE.start_main_~n~0#1|) (= (select .cse1 (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse9 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse7 (@diff v_arrayElimCell_44 .cse1)) (.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse1 (store v_arrayElimCell_44 .cse7 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse8) 0) (= (select v_arrayElimCell_44 .cse7) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= (store v_arrayElimCell_44 .cse8 v_ArrVal_1207) .cse5) (= (select .cse1 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (<= .cse10 4) .cse11 (or (and (or .cse2 (let ((.cse13 (* 2 |c_ULTIMATE.start_upsweep_~space~0#1|)) (.cse12 (@diff .cse5 .cse1)) (.cse14 (@diff .cse0 .cse1)) (.cse15 (+ (- 4) (* |c_ULTIMATE.start_main_~n~0#1| 4)))) (and (or (= (select .cse5 .cse12) 0) (= .cse1 .cse5)) (or (= .cse1 .cse0) (<= .cse13 .cse14)) (<= .cse13 .cse15) (= .cse1 (store .cse5 .cse12 0)) (<= 0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 2))) (= .cse15 4) .cse11 (= .cse1 (store .cse0 .cse14 0)) (= (store .cse1 .cse15 (select .cse0 .cse15)) .cse0) (<= |c_ULTIMATE.start_main_~n~0#1| 2)))) (<= 0 (+ (- 2) |c_ULTIMATE.start_upsweep_~space~0#1|))) (< .cse10 4)))) is different from false [2023-02-18 05:04:41,059 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse11 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse10 (+ (- 4) (* |c_ULTIMATE.start_upsweep_~space~0#1| 4)))) (and (<= 0 (+ (- 2) |c_ULTIMATE.start_upsweep_~n#1|)) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= .cse0 (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) 1) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) 1))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (not .cse2) (= |c_ULTIMATE.start_upsweep_~space~0#1| (* 2 1)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1| 1))) (or (and (= (select .cse1 (@diff .cse1 .cse1)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse6 (* v_prenex_6 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse6))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) v_prenex_6)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| v_prenex_6) .cse3) (= (select .cse1 .cse4) 0) (<= |c_ULTIMATE.start_main_~n~0#1| (+ v_prenex_6 1)) (= .cse5 (store .cse1 .cse4 v_prenex_7)) (< v_prenex_6 |c_ULTIMATE.start_main_~n~0#1|) (= (select .cse1 (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse9 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse7 (@diff v_arrayElimCell_44 .cse1)) (.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse1 (store v_arrayElimCell_44 .cse7 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse8) 0) (= (select v_arrayElimCell_44 .cse7) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse3) (= (store v_arrayElimCell_44 .cse8 v_ArrVal_1207) .cse5) (= (select .cse1 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (<= .cse10 4) .cse11 (or (and (or .cse2 (let ((.cse13 (* 2 |c_ULTIMATE.start_upsweep_~space~0#1|)) (.cse12 (@diff .cse5 .cse1)) (.cse14 (@diff .cse0 .cse1)) (.cse15 (+ (- 4) (* |c_ULTIMATE.start_main_~n~0#1| 4)))) (and (or (= (select .cse5 .cse12) 0) (= .cse1 .cse5)) (or (= .cse1 .cse0) (<= .cse13 .cse14)) (<= .cse13 .cse15) (= .cse1 (store .cse5 .cse12 0)) (<= 0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 2))) (= .cse15 4) .cse11 (= .cse1 (store .cse0 .cse14 0)) (= (store .cse1 .cse15 (select .cse0 .cse15)) .cse0) (<= |c_ULTIMATE.start_main_~n~0#1| 2)))) (<= 0 (+ (- 2) |c_ULTIMATE.start_upsweep_~space~0#1|))) (< .cse10 4)))) is different from true [2023-02-18 05:04:41,065 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse3 (<= 0 (+ (- 2) |c_ULTIMATE.start_upsweep_~space~0#1|))) (.cse11 (+ (- 4) (* |c_ULTIMATE.start_upsweep_~space~0#1| 4)))) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= .cse0 (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) 1) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) 1))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (not .cse2) (= |c_ULTIMATE.start_upsweep_~space~0#1| (* 2 1)) .cse3 (let ((.cse4 (+ |c_ULTIMATE.start_main_~n~0#1| 1))) (or (and (= (select .cse1 (@diff .cse1 .cse1)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse7 (* v_prenex_6 4))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) v_prenex_6)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| v_prenex_6) .cse4) (= (select .cse1 .cse5) 0) (<= |c_ULTIMATE.start_main_~n~0#1| (+ v_prenex_6 1)) (= .cse6 (store .cse1 .cse5 v_prenex_7)) (< v_prenex_6 |c_ULTIMATE.start_main_~n~0#1|) (= (select .cse1 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse10 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse8 (@diff v_arrayElimCell_44 .cse1)) (.cse9 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse10))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse1 (store v_arrayElimCell_44 .cse8 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse9) 0) (= (select v_arrayElimCell_44 .cse8) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse4) (= (store v_arrayElimCell_44 .cse9 v_ArrVal_1207) .cse6) (= (select .cse1 (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (<= .cse11 4) .cse12 (or (and (or .cse2 (let ((.cse14 (* 2 |c_ULTIMATE.start_upsweep_~space~0#1|)) (.cse13 (@diff .cse6 .cse1)) (.cse15 (@diff .cse0 .cse1)) (.cse16 (+ (- 4) (* |c_ULTIMATE.start_main_~n~0#1| 4)))) (and (or (= (select .cse6 .cse13) 0) (= .cse1 .cse6)) (or (= .cse1 .cse0) (<= .cse14 .cse15)) (<= .cse14 .cse16) (= .cse1 (store .cse6 .cse13 0)) (<= 0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 2))) (= .cse16 4) .cse12 (= .cse1 (store .cse0 .cse15 0)) (= (store .cse1 .cse16 (select .cse0 .cse16)) .cse0) (<= |c_ULTIMATE.start_main_~n~0#1| 2)))) .cse3) (< .cse11 4)))) is different from false [2023-02-18 05:04:41,070 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse3 (<= 0 (+ (- 2) |c_ULTIMATE.start_upsweep_~space~0#1|))) (.cse11 (+ (- 4) (* |c_ULTIMATE.start_upsweep_~space~0#1| 4)))) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= .cse0 (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) 1) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) 1))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (not .cse2) (= |c_ULTIMATE.start_upsweep_~space~0#1| (* 2 1)) .cse3 (let ((.cse4 (+ |c_ULTIMATE.start_main_~n~0#1| 1))) (or (and (= (select .cse1 (@diff .cse1 .cse1)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse7 (* v_prenex_6 4))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) v_prenex_6)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| v_prenex_6) .cse4) (= (select .cse1 .cse5) 0) (<= |c_ULTIMATE.start_main_~n~0#1| (+ v_prenex_6 1)) (= .cse6 (store .cse1 .cse5 v_prenex_7)) (< v_prenex_6 |c_ULTIMATE.start_main_~n~0#1|) (= (select .cse1 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse10 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse8 (@diff v_arrayElimCell_44 .cse1)) (.cse9 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse10))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse1 (store v_arrayElimCell_44 .cse8 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse9) 0) (= (select v_arrayElimCell_44 .cse8) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse4) (= (store v_arrayElimCell_44 .cse9 v_ArrVal_1207) .cse6) (= (select .cse1 (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) (<= .cse11 4) .cse12 (or (and (or .cse2 (let ((.cse14 (* 2 |c_ULTIMATE.start_upsweep_~space~0#1|)) (.cse13 (@diff .cse6 .cse1)) (.cse15 (@diff .cse0 .cse1)) (.cse16 (+ (- 4) (* |c_ULTIMATE.start_main_~n~0#1| 4)))) (and (or (= (select .cse6 .cse13) 0) (= .cse1 .cse6)) (or (= .cse1 .cse0) (<= .cse14 .cse15)) (<= .cse14 .cse16) (= .cse1 (store .cse6 .cse13 0)) (<= 0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 2))) (= .cse16 4) .cse12 (= .cse1 (store .cse0 .cse15 0)) (= (store .cse1 .cse16 (select .cse0 .cse16)) .cse0) (<= |c_ULTIMATE.start_main_~n~0#1| 2)))) .cse3) (< .cse11 4)))) is different from true [2023-02-18 05:04:41,089 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_upsweep_#res#1| 4) (- 4))) (.cse3 (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse11 (<= 0 (+ (- 2) |c_ULTIMATE.start_upsweep_#res#1|)))) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= .cse0 (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) 1) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) 1))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (<= .cse2 4) (not .cse3) (let ((.cse4 (+ |c_ULTIMATE.start_main_~n~0#1| 1))) (or (and (= (select .cse1 (@diff .cse1 .cse1)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse7 (* v_prenex_6 4))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) v_prenex_6)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| v_prenex_6) .cse4) (= (select .cse1 .cse5) 0) (<= |c_ULTIMATE.start_main_~n~0#1| (+ v_prenex_6 1)) (= .cse6 (store .cse1 .cse5 v_prenex_7)) (< v_prenex_6 |c_ULTIMATE.start_main_~n~0#1|) (= (select .cse1 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse10 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse8 (@diff v_arrayElimCell_44 .cse1)) (.cse9 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse10))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse1 (store v_arrayElimCell_44 .cse8 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse9) 0) (= (select v_arrayElimCell_44 .cse8) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse4) (= (store v_arrayElimCell_44 .cse9 v_ArrVal_1207) .cse6) (= (select .cse1 (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) .cse11 (= |c_ULTIMATE.start_upsweep_#res#1| (* 2 1)) .cse12 (or (< .cse2 4) (and (or .cse3 (let ((.cse13 (@diff .cse6 .cse1)) (.cse14 (* |c_ULTIMATE.start_upsweep_#res#1| 2)) (.cse15 (@diff .cse0 .cse1)) (.cse16 (+ (- 4) (* |c_ULTIMATE.start_main_~n~0#1| 4)))) (and (or (= (select .cse6 .cse13) 0) (= .cse1 .cse6)) (or (= .cse1 .cse0) (<= .cse14 .cse15)) (= .cse1 (store .cse6 .cse13 0)) (<= .cse14 .cse16) (<= 0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 2))) (= .cse16 4) .cse12 (= .cse1 (store .cse0 .cse15 0)) (= (store .cse1 .cse16 (select .cse0 .cse16)) .cse0) (<= |c_ULTIMATE.start_main_~n~0#1| 2)))) .cse11)))) is different from false [2023-02-18 05:04:41,093 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_upsweep_#res#1| 4) (- 4))) (.cse3 (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse11 (<= 0 (+ (- 2) |c_ULTIMATE.start_upsweep_#res#1|)))) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= .cse0 (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) 1) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) 1))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (<= .cse2 4) (not .cse3) (let ((.cse4 (+ |c_ULTIMATE.start_main_~n~0#1| 1))) (or (and (= (select .cse1 (@diff .cse1 .cse1)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse7 (* v_prenex_6 4))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse7))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) v_prenex_6)) (<= (+ |c_ULTIMATE.start_main_~n~0#1| v_prenex_6) .cse4) (= (select .cse1 .cse5) 0) (<= |c_ULTIMATE.start_main_~n~0#1| (+ v_prenex_6 1)) (= .cse6 (store .cse1 .cse5 v_prenex_7)) (< v_prenex_6 |c_ULTIMATE.start_main_~n~0#1|) (= (select .cse1 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse10 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse8 (@diff v_arrayElimCell_44 .cse1)) (.cse9 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse10))) (and (<= |c_ULTIMATE.start_main_~n~0#1| (+ |c_ULTIMATE.start_main_~n~0#1| (- 1) |v_ULTIMATE.start_main_~i~1#1_171|)) (= .cse1 (store v_arrayElimCell_44 .cse8 0)) (<= |c_ULTIMATE.start_main_~n~0#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse9) 0) (= (select v_arrayElimCell_44 .cse8) 0) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_main_~n~0#1|) (<= (+ |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse4) (= (store v_arrayElimCell_44 .cse9 v_ArrVal_1207) .cse6) (= (select .cse1 (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))) .cse11 (= |c_ULTIMATE.start_upsweep_#res#1| (* 2 1)) .cse12 (or (< .cse2 4) (and (or .cse3 (let ((.cse13 (@diff .cse6 .cse1)) (.cse14 (* |c_ULTIMATE.start_upsweep_#res#1| 2)) (.cse15 (@diff .cse0 .cse1)) (.cse16 (+ (- 4) (* |c_ULTIMATE.start_main_~n~0#1| 4)))) (and (or (= (select .cse6 .cse13) 0) (= .cse1 .cse6)) (or (= .cse1 .cse0) (<= .cse14 .cse15)) (= .cse1 (store .cse6 .cse13 0)) (<= .cse14 .cse16) (<= 0 (+ |c_ULTIMATE.start_main_~n~0#1| (- 2))) (= .cse16 4) .cse12 (= .cse1 (store .cse0 .cse15 0)) (= (store .cse1 .cse16 (select .cse0 .cse16)) .cse0) (<= |c_ULTIMATE.start_main_~n~0#1| 2)))) .cse11)))) is different from true [2023-02-18 05:04:41,121 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse4 ((as const (Array Int Int)) 0)) (.cse9 (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (= |c_ULTIMATE.start_downsweep_~a#1.offset| 0) (or (<= 0 (+ (- 1) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (let ((.cse8 (<= 0 (+ |c_ULTIMATE.start_downsweep_~space#1| (- 2)))) (.cse11 (+ (- 4) (* |c_ULTIMATE.start_downsweep_~space#1| 4)))) (and (or (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|))) (let ((.cse0 (* |c_ULTIMATE.start_downsweep_~space#1| 2)) (.cse3 (@diff .cse2 .cse4)) (.cse5 (@diff .cse6 .cse4)) (.cse1 (+ (* |c_ULTIMATE.start_downsweep_~n#1| 4) (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (and (<= .cse0 .cse1) (or (= (select .cse2 .cse3) 0) (= .cse4 .cse2)) (or (<= .cse0 .cse5) (= .cse4 .cse6)) (<= 0 (+ (- 2) |c_ULTIMATE.start_downsweep_~n#1|)) (<= |c_ULTIMATE.start_downsweep_~n#1| 2) .cse7 (= .cse4 (store .cse2 .cse3 0)) .cse8 (= .cse1 4) .cse9 .cse10 (= .cse4 (store .cse6 .cse5 0)) (= (store .cse4 .cse1 (select .cse6 .cse1)) .cse6)))) (< .cse11 4)) .cse8 (<= .cse11 4))) (<= |c_ULTIMATE.start_downsweep_~a#1.offset| (- 1))) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (store .cse4 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) 1) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) 1))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) .cse7 (let ((.cse13 (+ |c_ULTIMATE.start_downsweep_~n#1| 1))) (or (and (= (select .cse4 (@diff .cse4 .cse4)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse14 (* v_prenex_6 4))) (let ((.cse12 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse14))) (and (<= |c_ULTIMATE.start_downsweep_~n#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse4 .cse12) 0) (<= |c_ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (< v_prenex_6 |c_ULTIMATE.start_downsweep_~n#1|) (= .cse2 (store .cse4 .cse12 v_prenex_7)) (<= (+ |c_ULTIMATE.start_downsweep_~n#1| v_prenex_6) .cse13) (= (select .cse4 (+ .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse17 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse15 (@diff v_arrayElimCell_44 .cse4)) (.cse16 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse17))) (and (= .cse4 (store v_arrayElimCell_44 .cse15 0)) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_downsweep_~n#1|) (= (select v_arrayElimCell_44 .cse16) 0) (<= (+ |c_ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse13) (= (select v_arrayElimCell_44 .cse15) 0) (= (store v_arrayElimCell_44 .cse16 v_ArrVal_1207) .cse2) (<= |c_ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse4 (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (<= |c_ULTIMATE.start_downsweep_~n#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_downsweep_~a#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) .cse9 .cse10 (= |c_ULTIMATE.start_downsweep_~space#1| (* 2 1)))) is different from false [2023-02-18 05:04:41,126 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse4 ((as const (Array Int Int)) 0)) (.cse9 (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (= |c_ULTIMATE.start_downsweep_~a#1.offset| 0) (or (<= 0 (+ (- 1) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (let ((.cse8 (<= 0 (+ |c_ULTIMATE.start_downsweep_~space#1| (- 2)))) (.cse11 (+ (- 4) (* |c_ULTIMATE.start_downsweep_~space#1| 4)))) (and (or (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|))) (let ((.cse0 (* |c_ULTIMATE.start_downsweep_~space#1| 2)) (.cse3 (@diff .cse2 .cse4)) (.cse5 (@diff .cse6 .cse4)) (.cse1 (+ (* |c_ULTIMATE.start_downsweep_~n#1| 4) (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (and (<= .cse0 .cse1) (or (= (select .cse2 .cse3) 0) (= .cse4 .cse2)) (or (<= .cse0 .cse5) (= .cse4 .cse6)) (<= 0 (+ (- 2) |c_ULTIMATE.start_downsweep_~n#1|)) (<= |c_ULTIMATE.start_downsweep_~n#1| 2) .cse7 (= .cse4 (store .cse2 .cse3 0)) .cse8 (= .cse1 4) .cse9 .cse10 (= .cse4 (store .cse6 .cse5 0)) (= (store .cse4 .cse1 (select .cse6 .cse1)) .cse6)))) (< .cse11 4)) .cse8 (<= .cse11 4))) (<= |c_ULTIMATE.start_downsweep_~a#1.offset| (- 1))) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (= (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (store .cse4 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209)) (<= (+ (- 1) 1) (+ |ULTIMATE.start_upsweep_~right~0#1| (* (- 1) 1))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) .cse7 (let ((.cse13 (+ |c_ULTIMATE.start_downsweep_~n#1| 1))) (or (and (= (select .cse4 (@diff .cse4 .cse4)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (let ((.cse14 (* v_prenex_6 4))) (let ((.cse12 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse14))) (and (<= |c_ULTIMATE.start_downsweep_~n#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse4 .cse12) 0) (<= |c_ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (< v_prenex_6 |c_ULTIMATE.start_downsweep_~n#1|) (= .cse2 (store .cse4 .cse12 v_prenex_7)) (<= (+ |c_ULTIMATE.start_downsweep_~n#1| v_prenex_6) .cse13) (= (select .cse4 (+ .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse17 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse15 (@diff v_arrayElimCell_44 .cse4)) (.cse16 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse17))) (and (= .cse4 (store v_arrayElimCell_44 .cse15 0)) (< |v_ULTIMATE.start_main_~i~1#1_171| |c_ULTIMATE.start_downsweep_~n#1|) (= (select v_arrayElimCell_44 .cse16) 0) (<= (+ |c_ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) .cse13) (= (select v_arrayElimCell_44 .cse15) 0) (= (store v_arrayElimCell_44 .cse16 v_ArrVal_1207) .cse2) (<= |c_ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select .cse4 (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (<= |c_ULTIMATE.start_downsweep_~n#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)))))))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_downsweep_~a#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) .cse9 .cse10 (= |c_ULTIMATE.start_downsweep_~space#1| (* 2 1)))) is different from true [2023-02-18 05:04:41,147 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0)) (.cse18 (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse19 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (= |c_ULTIMATE.start_downsweep_~a#1.offset| 0) .cse10 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_downsweep_~a#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (or (<= 0 (+ (- 1) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (let ((.cse17 (<= 0 (+ |c_ULTIMATE.start_downsweep_~space#1| (- 2)))) (.cse20 (+ (- 4) (* |c_ULTIMATE.start_downsweep_~space#1| 4)))) (and (or (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|)) (.cse12 (+ (* |c_ULTIMATE.start_downsweep_~n#1| 4) (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse16 (store .cse14 .cse12 0))) (let ((.cse13 (@diff .cse3 .cse0)) (.cse11 (* |c_ULTIMATE.start_downsweep_~space#1| 2)) (.cse15 (@diff .cse16 .cse0))) (and (<= .cse11 .cse12) (or (= (select .cse3 .cse13) 0) (= .cse0 .cse3)) (<= 0 (+ (- 2) |c_ULTIMATE.start_downsweep_~n#1|)) (<= |c_ULTIMATE.start_downsweep_~n#1| 2) .cse10 (= (select .cse14 .cse12) 0) (= .cse0 .cse14) (= .cse0 (store .cse3 .cse13 0)) (or (<= .cse11 .cse15) (= .cse0 .cse16)) .cse17 (= .cse12 4) .cse18 .cse19 (= .cse0 (store .cse16 .cse15 0)))))) (< .cse20 4)) .cse17 (<= .cse20 4))) (<= |c_ULTIMATE.start_downsweep_~a#1.offset| (- 1))) .cse18 .cse19 (= |c_ULTIMATE.start_downsweep_~space#1| (* 2 1)))) is different from false [2023-02-18 05:04:41,153 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0)) (.cse18 (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse19 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (= |c_ULTIMATE.start_downsweep_~a#1.offset| 0) .cse10 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_downsweep_~a#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (or (<= 0 (+ (- 1) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (let ((.cse17 (<= 0 (+ |c_ULTIMATE.start_downsweep_~space#1| (- 2)))) (.cse20 (+ (- 4) (* |c_ULTIMATE.start_downsweep_~space#1| 4)))) (and (or (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|)) (.cse12 (+ (* |c_ULTIMATE.start_downsweep_~n#1| 4) (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse16 (store .cse14 .cse12 0))) (let ((.cse13 (@diff .cse3 .cse0)) (.cse11 (* |c_ULTIMATE.start_downsweep_~space#1| 2)) (.cse15 (@diff .cse16 .cse0))) (and (<= .cse11 .cse12) (or (= (select .cse3 .cse13) 0) (= .cse0 .cse3)) (<= 0 (+ (- 2) |c_ULTIMATE.start_downsweep_~n#1|)) (<= |c_ULTIMATE.start_downsweep_~n#1| 2) .cse10 (= (select .cse14 .cse12) 0) (= .cse0 .cse14) (= .cse0 (store .cse3 .cse13 0)) (or (<= .cse11 .cse15) (= .cse0 .cse16)) .cse17 (= .cse12 4) .cse18 .cse19 (= .cse0 (store .cse16 .cse15 0)))))) (< .cse20 4)) .cse17 (<= .cse20 4))) (<= |c_ULTIMATE.start_downsweep_~a#1.offset| (- 1))) .cse18 .cse19 (= |c_ULTIMATE.start_downsweep_~space#1| (* 2 1)))) is different from true [2023-02-18 05:04:41,170 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0)) (.cse13 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse17 (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse18 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (= |c_ULTIMATE.start_downsweep_~a#1.offset| 0) (or (<= 0 (+ (- 1) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (let ((.cse19 (+ (- 4) (* |c_ULTIMATE.start_downsweep_~space#1| 8)))) (and (or (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|)) (.cse12 (+ (* |c_ULTIMATE.start_downsweep_~n#1| 4) (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse15 (store .cse14 .cse12 0))) (let ((.cse10 (@diff .cse3 .cse0)) (.cse11 (* |c_ULTIMATE.start_downsweep_~space#1| 4)) (.cse16 (@diff .cse15 .cse0))) (and (or (= (select .cse3 .cse10) 0) (= .cse0 .cse3)) (<= .cse11 .cse12) (<= 0 (+ (- 2) |c_ULTIMATE.start_downsweep_~n#1|)) (<= |c_ULTIMATE.start_downsweep_~n#1| 2) .cse13 (= (select .cse14 .cse12) 0) (= .cse0 .cse14) (= .cse0 (store .cse3 .cse10 0)) (or (= .cse0 .cse15) (<= .cse11 .cse16)) (<= 0 (+ |c_ULTIMATE.start_downsweep_~space#1| (- 1))) (= .cse12 4) .cse17 .cse18 (= .cse0 (store .cse15 .cse16 0)))))) (< .cse19 4)) (<= .cse19 4))) (<= |c_ULTIMATE.start_downsweep_~a#1.offset| (- 1))) .cse13 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_downsweep_~a#1.base|)) (= |c_ULTIMATE.start_downsweep_~space#1| 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) .cse17 .cse18)) is different from false [2023-02-18 05:04:41,175 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0)) (.cse13 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse17 (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse18 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (= |c_ULTIMATE.start_downsweep_~a#1.offset| 0) (or (<= 0 (+ (- 1) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (let ((.cse19 (+ (- 4) (* |c_ULTIMATE.start_downsweep_~space#1| 8)))) (and (or (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|)) (.cse12 (+ (* |c_ULTIMATE.start_downsweep_~n#1| 4) (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse15 (store .cse14 .cse12 0))) (let ((.cse10 (@diff .cse3 .cse0)) (.cse11 (* |c_ULTIMATE.start_downsweep_~space#1| 4)) (.cse16 (@diff .cse15 .cse0))) (and (or (= (select .cse3 .cse10) 0) (= .cse0 .cse3)) (<= .cse11 .cse12) (<= 0 (+ (- 2) |c_ULTIMATE.start_downsweep_~n#1|)) (<= |c_ULTIMATE.start_downsweep_~n#1| 2) .cse13 (= (select .cse14 .cse12) 0) (= .cse0 .cse14) (= .cse0 (store .cse3 .cse10 0)) (or (= .cse0 .cse15) (<= .cse11 .cse16)) (<= 0 (+ |c_ULTIMATE.start_downsweep_~space#1| (- 1))) (= .cse12 4) .cse17 .cse18 (= .cse0 (store .cse15 .cse16 0)))))) (< .cse19 4)) (<= .cse19 4))) (<= |c_ULTIMATE.start_downsweep_~a#1.offset| (- 1))) .cse13 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_downsweep_~a#1.base|)) (= |c_ULTIMATE.start_downsweep_~space#1| 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) .cse17 .cse18)) is different from true [2023-02-18 05:04:41,210 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0)) (.cse11 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse20 (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse21 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (= |c_ULTIMATE.start_downsweep_~a#1.offset| 0) (or (let ((.cse19 (* |c_ULTIMATE.start_downsweep_~n#1| 4))) (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|)) (.cse18 (+ .cse19 (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse17 (store .cse12 .cse18 0)) (.cse14 (* |c_ULTIMATE.start_downsweep_~right~1#1| 4))) (let ((.cse10 (@diff .cse3 .cse0)) (.cse13 (+ .cse14 |c_ULTIMATE.start_downsweep_~a#1.offset|)) (.cse16 (* |c_ULTIMATE.start_downsweep_~space#1| 4)) (.cse15 (@diff .cse17 .cse0))) (and (or (= (select .cse3 .cse10) 0) (= .cse0 .cse3)) (<= 0 (+ (- 2) |c_ULTIMATE.start_downsweep_~n#1|)) (<= |c_ULTIMATE.start_downsweep_~n#1| 2) .cse11 (= (select .cse12 .cse13) 0) (= .cse0 .cse12) (= .cse0 (store .cse3 .cse10 0)) (<= 0 (+ |c_ULTIMATE.start_downsweep_~space#1| (- 1))) (or (<= .cse14 (+ .cse15 (- 4) .cse16)) (= .cse0 .cse17)) (= .cse18 .cse13) (<= .cse14 (+ .cse19 .cse16 |c_ULTIMATE.start_downsweep_~a#1.offset| (- 8))) .cse20 .cse21 (= .cse0 (store .cse17 .cse15 0))))))) (<= 0 (+ (- 1) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (<= |c_ULTIMATE.start_downsweep_~a#1.offset| (- 1))) .cse11 (> |c_ULTIMATE.start_downsweep_~space#1| 0) (= |c_ULTIMATE.start_downsweep_~right~1#1| (+ (- 1) (* |c_ULTIMATE.start_downsweep_~space#1| 2))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_downsweep_~a#1.base|)) (= |c_ULTIMATE.start_downsweep_~space#1| 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) .cse20 .cse21)) is different from false [2023-02-18 05:04:41,215 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0)) (.cse11 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse20 (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse21 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (= |c_ULTIMATE.start_downsweep_~a#1.offset| 0) (or (let ((.cse19 (* |c_ULTIMATE.start_downsweep_~n#1| 4))) (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|)) (.cse18 (+ .cse19 (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse17 (store .cse12 .cse18 0)) (.cse14 (* |c_ULTIMATE.start_downsweep_~right~1#1| 4))) (let ((.cse10 (@diff .cse3 .cse0)) (.cse13 (+ .cse14 |c_ULTIMATE.start_downsweep_~a#1.offset|)) (.cse16 (* |c_ULTIMATE.start_downsweep_~space#1| 4)) (.cse15 (@diff .cse17 .cse0))) (and (or (= (select .cse3 .cse10) 0) (= .cse0 .cse3)) (<= 0 (+ (- 2) |c_ULTIMATE.start_downsweep_~n#1|)) (<= |c_ULTIMATE.start_downsweep_~n#1| 2) .cse11 (= (select .cse12 .cse13) 0) (= .cse0 .cse12) (= .cse0 (store .cse3 .cse10 0)) (<= 0 (+ |c_ULTIMATE.start_downsweep_~space#1| (- 1))) (or (<= .cse14 (+ .cse15 (- 4) .cse16)) (= .cse0 .cse17)) (= .cse18 .cse13) (<= .cse14 (+ .cse19 .cse16 |c_ULTIMATE.start_downsweep_~a#1.offset| (- 8))) .cse20 .cse21 (= .cse0 (store .cse17 .cse15 0))))))) (<= 0 (+ (- 1) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (<= |c_ULTIMATE.start_downsweep_~a#1.offset| (- 1))) .cse11 (> |c_ULTIMATE.start_downsweep_~space#1| 0) (= |c_ULTIMATE.start_downsweep_~right~1#1| (+ (- 1) (* |c_ULTIMATE.start_downsweep_~space#1| 2))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_downsweep_~a#1.base|)) (= |c_ULTIMATE.start_downsweep_~space#1| 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) .cse20 .cse21)) is different from true [2023-02-18 05:04:41,254 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0)) (.cse15 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse18 (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse11 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|)) (.cse19 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (= |c_ULTIMATE.start_downsweep_~a#1.offset| 0) (or (<= 0 (+ (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (let ((.cse14 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (.cse16 (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse10 (= .cse14 .cse16))) (and (or (not .cse10) (and (= .cse11 0) (<= |c_ULTIMATE.start_downsweep_~left~1#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~right~1#1|)))) (or (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|)) (.cse12 (@diff .cse3 .cse0)) (.cse17 (+ (* |c_ULTIMATE.start_downsweep_~n#1| 4) (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (and (or (= (select .cse3 .cse12) 0) (= .cse0 .cse3)) (= (select .cse13 .cse14) 0) (<= 0 (+ (- 2) |c_ULTIMATE.start_downsweep_~n#1|)) (<= |c_ULTIMATE.start_downsweep_~n#1| 2) .cse15 (= (select .cse13 .cse16) 0) (= .cse0 (store .cse3 .cse12 0)) (= .cse17 .cse16) .cse18 .cse19 (not (= .cse17 .cse14)))) .cse10)))) (<= 0 (+ (- 1) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (<= |c_ULTIMATE.start_downsweep_~a#1.offset| (- 1))) .cse15 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_downsweep_~a#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse11 0) .cse18 (= (+ (- 1) (* 2 .cse11)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse11 1) .cse19)) is different from false [2023-02-18 05:04:41,259 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0)) (.cse15 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse18 (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse11 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|)) (.cse19 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (= |c_ULTIMATE.start_downsweep_~a#1.offset| 0) (or (<= 0 (+ (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (let ((.cse14 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (.cse16 (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse10 (= .cse14 .cse16))) (and (or (not .cse10) (and (= .cse11 0) (<= |c_ULTIMATE.start_downsweep_~left~1#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~right~1#1|)))) (or (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|)) (.cse12 (@diff .cse3 .cse0)) (.cse17 (+ (* |c_ULTIMATE.start_downsweep_~n#1| 4) (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (and (or (= (select .cse3 .cse12) 0) (= .cse0 .cse3)) (= (select .cse13 .cse14) 0) (<= 0 (+ (- 2) |c_ULTIMATE.start_downsweep_~n#1|)) (<= |c_ULTIMATE.start_downsweep_~n#1| 2) .cse15 (= (select .cse13 .cse16) 0) (= .cse0 (store .cse3 .cse12 0)) (= .cse17 .cse16) .cse18 .cse19 (not (= .cse17 .cse14)))) .cse10)))) (<= 0 (+ (- 1) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (<= |c_ULTIMATE.start_downsweep_~a#1.offset| (- 1))) .cse15 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_downsweep_~a#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse11 0) .cse18 (= (+ (- 1) (* 2 .cse11)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse11 1) .cse19)) is different from true [2023-02-18 05:04:41,305 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|)) (.cse18 (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse10 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse11 (select .cse15 .cse18)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0)) (.cse19 (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse13 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|)) (.cse20 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (= |c_ULTIMATE.start_downsweep_~a#1.offset| 0) .cse10 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_downsweep_~a#1.base|)) (= .cse11 |c_ULTIMATE.start_downsweep_#t~mem7#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (or (<= 0 (+ (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (<= 0 (+ (- 1) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (let ((.cse16 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse12 (= .cse16 .cse18))) (and (or (not .cse12) (and (= .cse13 0) (<= |c_ULTIMATE.start_downsweep_~left~1#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~right~1#1|)))) (or (let ((.cse14 (@diff .cse3 .cse0)) (.cse17 (+ (* |c_ULTIMATE.start_downsweep_~n#1| 4) (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (and (or (= (select .cse3 .cse14) 0) (= .cse0 .cse3)) (= |c_ULTIMATE.start_downsweep_#t~mem7#1| 0) (= (select .cse15 .cse16) 0) (<= 0 (+ (- 2) |c_ULTIMATE.start_downsweep_~n#1|)) (<= |c_ULTIMATE.start_downsweep_~n#1| 2) .cse10 (= .cse11 0) (= .cse0 (store .cse3 .cse14 0)) (= .cse17 .cse18) .cse19 .cse20 (not (= .cse17 .cse16)))) .cse12)))) (<= |c_ULTIMATE.start_downsweep_~a#1.offset| (- 1))) (> .cse13 0) .cse19 (= (+ (- 1) (* 2 .cse13)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse13 1) .cse20))) is different from false [2023-02-18 05:04:41,310 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|)) (.cse18 (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse10 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse11 (select .cse15 .cse18)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0)) (.cse19 (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse13 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|)) (.cse20 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (= |c_ULTIMATE.start_downsweep_~a#1.offset| 0) .cse10 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_downsweep_~a#1.base|)) (= .cse11 |c_ULTIMATE.start_downsweep_#t~mem7#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (or (<= 0 (+ (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (<= 0 (+ (- 1) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (let ((.cse16 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse12 (= .cse16 .cse18))) (and (or (not .cse12) (and (= .cse13 0) (<= |c_ULTIMATE.start_downsweep_~left~1#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~right~1#1|)))) (or (let ((.cse14 (@diff .cse3 .cse0)) (.cse17 (+ (* |c_ULTIMATE.start_downsweep_~n#1| 4) (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (and (or (= (select .cse3 .cse14) 0) (= .cse0 .cse3)) (= |c_ULTIMATE.start_downsweep_#t~mem7#1| 0) (= (select .cse15 .cse16) 0) (<= 0 (+ (- 2) |c_ULTIMATE.start_downsweep_~n#1|)) (<= |c_ULTIMATE.start_downsweep_~n#1| 2) .cse10 (= .cse11 0) (= .cse0 (store .cse3 .cse14 0)) (= .cse17 .cse18) .cse19 .cse20 (not (= .cse17 .cse16)))) .cse12)))) (<= |c_ULTIMATE.start_downsweep_~a#1.offset| (- 1))) (> .cse13 0) .cse19 (= (+ (- 1) (* 2 .cse13)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse13 1) .cse20))) is different from true [2023-02-18 05:04:41,328 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|)) (.cse18 (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse10 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse11 (select .cse15 .cse18)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0)) (.cse19 (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse13 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|)) (.cse20 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (= |c_ULTIMATE.start_downsweep_~a#1.offset| 0) .cse10 (= .cse11 |c_ULTIMATE.start_downsweep_~temp~0#1|) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_downsweep_~a#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (or (<= 0 (+ (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (<= 0 (+ (- 1) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (<= |c_ULTIMATE.start_downsweep_~a#1.offset| (- 1)) (let ((.cse16 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse12 (= .cse16 .cse18))) (and (or (not .cse12) (and (= .cse13 0) (<= |c_ULTIMATE.start_downsweep_~left~1#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~right~1#1|)))) (or (let ((.cse14 (@diff .cse3 .cse0)) (.cse17 (+ (* |c_ULTIMATE.start_downsweep_~n#1| 4) (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (and (or (= (select .cse3 .cse14) 0) (= .cse0 .cse3)) (= (select .cse15 .cse16) 0) (<= 0 (+ (- 2) |c_ULTIMATE.start_downsweep_~n#1|)) (<= |c_ULTIMATE.start_downsweep_~n#1| 2) .cse10 (= .cse11 0) (= .cse0 (store .cse3 .cse14 0)) (= .cse17 .cse18) (= |c_ULTIMATE.start_downsweep_~temp~0#1| 0) .cse19 .cse20 (not (= .cse17 .cse16)))) .cse12))))) (> .cse13 0) .cse19 (= (+ (- 1) (* 2 .cse13)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse13 1) .cse20))) is different from false [2023-02-18 05:04:41,334 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|)) (.cse18 (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse10 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse11 (select .cse15 .cse18)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse0 ((as const (Array Int Int)) 0)) (.cse19 (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse13 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|)) (.cse20 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (- 1) 1)) (.cse7 (* (- 1) 1))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse4 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse1 (@diff v_arrayElimCell_44 .cse0)) (.cse2 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse4))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse1 0)) (= (select v_arrayElimCell_44 .cse2) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse1) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse2 v_ArrVal_1207) .cse3) (= (select .cse0 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse9 (* v_prenex_6 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse9))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse0 .cse8) 0) (= .cse5 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse6 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse7)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse3 (store .cse0 .cse8 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse0 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (= |c_ULTIMATE.start_downsweep_~a#1.offset| 0) .cse10 (= .cse11 |c_ULTIMATE.start_downsweep_~temp~0#1|) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_downsweep_~a#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (or (<= 0 (+ (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (<= 0 (+ (- 1) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (<= |c_ULTIMATE.start_downsweep_~a#1.offset| (- 1)) (let ((.cse16 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse12 (= .cse16 .cse18))) (and (or (not .cse12) (and (= .cse13 0) (<= |c_ULTIMATE.start_downsweep_~left~1#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~right~1#1|)))) (or (let ((.cse14 (@diff .cse3 .cse0)) (.cse17 (+ (* |c_ULTIMATE.start_downsweep_~n#1| 4) (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (and (or (= (select .cse3 .cse14) 0) (= .cse0 .cse3)) (= (select .cse15 .cse16) 0) (<= 0 (+ (- 2) |c_ULTIMATE.start_downsweep_~n#1|)) (<= |c_ULTIMATE.start_downsweep_~n#1| 2) .cse10 (= .cse11 0) (= .cse0 (store .cse3 .cse14 0)) (= .cse17 .cse18) (= |c_ULTIMATE.start_downsweep_~temp~0#1| 0) .cse19 .cse20 (not (= .cse17 .cse16)))) .cse12))))) (> .cse13 0) .cse19 (= (+ (- 1) (* 2 .cse13)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse13 1) .cse20))) is different from true [2023-02-18 05:04:41,363 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (.cse21 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|)) (.cse12 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse5 (select .cse21 .cse12)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse4 ((as const (Array Int Int)) 0)) (.cse6 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse7 (select .cse21 .cse9)) (.cse10 (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|)) (.cse11 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (or (<= 0 (+ (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (let ((.cse0 (= .cse12 .cse9))) (and (or (not .cse0) (and (= .cse1 0) (<= |c_ULTIMATE.start_downsweep_~left~1#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~right~1#1|)))) (or (let ((.cse3 (@diff .cse2 .cse4)) (.cse8 (+ (* |c_ULTIMATE.start_downsweep_~n#1| 4) (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (and (or (= (select .cse2 .cse3) 0) (= .cse4 .cse2)) (= .cse5 0) (<= 0 (+ (- 2) |c_ULTIMATE.start_downsweep_~n#1|)) (<= |c_ULTIMATE.start_downsweep_~n#1| 2) .cse6 (= .cse7 0) (= .cse4 (store .cse2 .cse3 0)) (= .cse8 .cse9) (= |c_ULTIMATE.start_downsweep_~temp~0#1| 0) .cse10 .cse11 (= |c_ULTIMATE.start_downsweep_#t~mem8#1| 0) (not (= .cse8 .cse12)))) .cse0))) (<= 0 (+ (- 1) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (<= |c_ULTIMATE.start_downsweep_~a#1.offset| (- 1))) (= |c_ULTIMATE.start_downsweep_#t~mem8#1| .cse5) (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse17 (+ (- 1) 1)) (.cse18 (* (- 1) 1))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse13 (@diff v_arrayElimCell_44 .cse4)) (.cse14 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse4 (store v_arrayElimCell_44 .cse13 0)) (= (select v_arrayElimCell_44 .cse14) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse13) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse14 v_ArrVal_1207) .cse2) (= (select .cse4 (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse16 (store (store .cse4 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse17 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse18)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse4 (@diff .cse4 .cse4)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse20 (* v_prenex_6 4))) (let ((.cse19 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse20))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse4 .cse19) 0) (= .cse16 (store (store .cse4 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse17 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse18)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse2 (store .cse4 .cse19 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse4 (+ .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (= |c_ULTIMATE.start_downsweep_~a#1.offset| 0) .cse6 (= .cse7 |c_ULTIMATE.start_downsweep_~temp~0#1|) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_downsweep_~a#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse1 0) .cse10 (= (+ (- 1) (* 2 .cse1)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse1 1) .cse11))) is different from false [2023-02-18 05:04:41,369 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (.cse21 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|)) (.cse12 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse5 (select .cse21 .cse12)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse4 ((as const (Array Int Int)) 0)) (.cse6 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse7 (select .cse21 .cse9)) (.cse10 (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|)) (.cse11 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (or (<= 0 (+ (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (let ((.cse0 (= .cse12 .cse9))) (and (or (not .cse0) (and (= .cse1 0) (<= |c_ULTIMATE.start_downsweep_~left~1#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~right~1#1|)))) (or (let ((.cse3 (@diff .cse2 .cse4)) (.cse8 (+ (* |c_ULTIMATE.start_downsweep_~n#1| 4) (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (and (or (= (select .cse2 .cse3) 0) (= .cse4 .cse2)) (= .cse5 0) (<= 0 (+ (- 2) |c_ULTIMATE.start_downsweep_~n#1|)) (<= |c_ULTIMATE.start_downsweep_~n#1| 2) .cse6 (= .cse7 0) (= .cse4 (store .cse2 .cse3 0)) (= .cse8 .cse9) (= |c_ULTIMATE.start_downsweep_~temp~0#1| 0) .cse10 .cse11 (= |c_ULTIMATE.start_downsweep_#t~mem8#1| 0) (not (= .cse8 .cse12)))) .cse0))) (<= 0 (+ (- 1) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (<= |c_ULTIMATE.start_downsweep_~a#1.offset| (- 1))) (= |c_ULTIMATE.start_downsweep_#t~mem8#1| .cse5) (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse17 (+ (- 1) 1)) (.cse18 (* (- 1) 1))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse13 (@diff v_arrayElimCell_44 .cse4)) (.cse14 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse4 (store v_arrayElimCell_44 .cse13 0)) (= (select v_arrayElimCell_44 .cse14) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse13) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse14 v_ArrVal_1207) .cse2) (= (select .cse4 (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse16 (store (store .cse4 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse17 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse18)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse4 (@diff .cse4 .cse4)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse20 (* v_prenex_6 4))) (let ((.cse19 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse20))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse4 .cse19) 0) (= .cse16 (store (store .cse4 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse17 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse18)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse2 (store .cse4 .cse19 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse4 (+ .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (= |c_ULTIMATE.start_downsweep_~a#1.offset| 0) .cse6 (= .cse7 |c_ULTIMATE.start_downsweep_~temp~0#1|) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_downsweep_~a#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse1 0) .cse10 (= (+ (- 1) (* 2 .cse1)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse1 1) .cse11))) is different from true [2023-02-18 05:04:41,380 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse16 (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (.cse21 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|)) (.cse19 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse0 (select .cse21 .cse19)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse14 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse20 (select .cse21 .cse16)) (.cse17 (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|)) (.cse18 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (= |c_ULTIMATE.start_downsweep_#t~mem8#1| .cse0) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ (- 1) 1)) (.cse8 (* (- 1) 1))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (@diff v_arrayElimCell_44 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse1 (store v_arrayElimCell_44 .cse2 0)) (= (select v_arrayElimCell_44 .cse3) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse2) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse3 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse6 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse7 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse8)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse1 (@diff .cse1 .cse1)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse10 (* v_prenex_6 4))) (let ((.cse9 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse10))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse1 .cse9) 0) (= .cse6 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse7 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse8)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse4 (store .cse1 .cse9 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse1 (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (= |c_ULTIMATE.start_downsweep_~a#1.offset| 0) (or (<= 0 (+ (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (let ((.cse11 (= .cse19 .cse16))) (and (or (not .cse11) (and (= .cse12 0) (<= |c_ULTIMATE.start_downsweep_~left~1#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~right~1#1|)))) (or (let ((.cse13 (@diff .cse4 .cse1)) (.cse15 (+ (* |c_ULTIMATE.start_downsweep_~n#1| 4) (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (and (or (= (select .cse4 .cse13) 0) (= .cse1 .cse4)) (= .cse0 0) (<= 0 (+ (- 2) |c_ULTIMATE.start_downsweep_~n#1|)) (<= |c_ULTIMATE.start_downsweep_~n#1| 2) .cse14 (= |c_ULTIMATE.start_downsweep_#t~mem9#1| 0) (= .cse1 (store .cse4 .cse13 0)) (= .cse15 .cse16) (= |c_ULTIMATE.start_downsweep_~temp~0#1| 0) .cse17 .cse18 (= |c_ULTIMATE.start_downsweep_#t~mem8#1| 0) (not (= .cse15 .cse19)))) .cse11))) (<= 0 (+ (- 1) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (<= |c_ULTIMATE.start_downsweep_~a#1.offset| (- 1))) (= .cse20 |c_ULTIMATE.start_downsweep_#t~mem9#1|) .cse14 (= .cse20 |c_ULTIMATE.start_downsweep_~temp~0#1|) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_downsweep_~a#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse12 0) .cse17 (= (+ (- 1) (* 2 .cse12)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse12 1) .cse18))) is different from false [2023-02-18 05:04:41,387 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse16 (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (.cse21 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|)) (.cse19 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse0 (select .cse21 .cse19)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse14 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse20 (select .cse21 .cse16)) (.cse17 (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (+ (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~right~1#1|)) (.cse18 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (= |c_ULTIMATE.start_downsweep_#t~mem8#1| .cse0) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ (- 1) 1)) (.cse8 (* (- 1) 1))) (or (exists ((|ULTIMATE.start_upsweep_~a#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int)) (and (exists ((v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int)) (and (exists ((v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_ArrVal_1207 Int)) (let ((.cse5 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse2 (@diff v_arrayElimCell_44 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse5))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse1 (store v_arrayElimCell_44 .cse2 0)) (= (select v_arrayElimCell_44 .cse3) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse2) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= (store v_arrayElimCell_44 .cse3 v_ArrVal_1207) .cse4) (= (select .cse1 (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))) (= .cse6 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)))) (<= .cse7 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse8)))) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))) (and (= (select .cse1 (@diff .cse1 .cse1)) 0) (exists ((v_prenex_6 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (v_prenex_7 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int)) (let ((.cse10 (* v_prenex_6 4))) (let ((.cse9 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse10))) (and (< v_prenex_6 |ULTIMATE.start_downsweep_~n#1|) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| v_prenex_6)) (= (select .cse1 .cse9) 0) (= .cse6 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0)) (<= .cse7 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse8)) (<= (+ |ULTIMATE.start_downsweep_~n#1| v_prenex_6) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (= .cse4 (store .cse1 .cse9 v_prenex_7)) (<= |ULTIMATE.start_downsweep_~n#1| (+ v_prenex_6 1)) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|) (= (select .cse1 (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))))) (= |c_ULTIMATE.start_downsweep_~a#1.offset| 0) (or (<= 0 (+ (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (let ((.cse11 (= .cse19 .cse16))) (and (or (not .cse11) (and (= .cse12 0) (<= |c_ULTIMATE.start_downsweep_~left~1#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~right~1#1|)))) (or (let ((.cse13 (@diff .cse4 .cse1)) (.cse15 (+ (* |c_ULTIMATE.start_downsweep_~n#1| 4) (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (and (or (= (select .cse4 .cse13) 0) (= .cse1 .cse4)) (= .cse0 0) (<= 0 (+ (- 2) |c_ULTIMATE.start_downsweep_~n#1|)) (<= |c_ULTIMATE.start_downsweep_~n#1| 2) .cse14 (= |c_ULTIMATE.start_downsweep_#t~mem9#1| 0) (= .cse1 (store .cse4 .cse13 0)) (= .cse15 .cse16) (= |c_ULTIMATE.start_downsweep_~temp~0#1| 0) .cse17 .cse18 (= |c_ULTIMATE.start_downsweep_#t~mem8#1| 0) (not (= .cse15 .cse19)))) .cse11))) (<= 0 (+ (- 1) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (<= |c_ULTIMATE.start_downsweep_~a#1.offset| (- 1))) (= .cse20 |c_ULTIMATE.start_downsweep_#t~mem9#1|) .cse14 (= .cse20 |c_ULTIMATE.start_downsweep_~temp~0#1|) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_downsweep_~a#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (> .cse12 0) .cse17 (= (+ (- 1) (* 2 .cse12)) |c_ULTIMATE.start_downsweep_~right~1#1|) (= .cse12 1) .cse18))) is different from true [2023-02-18 05:04:41,422 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|)) (.cse1 (+ 1 |c_ULTIMATE.start_downsweep_~left~1#1|))) (let ((.cse2 (+ .cse4 .cse1)) (.cse0 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse12 (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse13 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse9 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse7 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_downsweep_~a#1.offset| 0) .cse0 (= .cse1 (+ (- 1) (* .cse2 2))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_downsweep_~a#1.base|)) (> .cse2 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (or (<= 0 (+ (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (<= 0 (+ (- 1) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (<= |c_ULTIMATE.start_downsweep_~a#1.offset| (- 1)) (let ((.cse10 (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse3 (= .cse9 .cse10))) (and (or (not .cse3) (and (= (+ .cse4 |c_ULTIMATE.start_downsweep_~right~1#1|) 0) (<= |c_ULTIMATE.start_downsweep_~left~1#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~right~1#1|)))) (or (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|)) (.cse6 (@diff .cse5 .cse7)) (.cse11 (+ (* |c_ULTIMATE.start_downsweep_~n#1| 4) (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (and (or (= (select .cse5 .cse6) 0) (= .cse7 .cse5)) (= (select .cse8 .cse9) 0) (<= 0 (+ (- 2) |c_ULTIMATE.start_downsweep_~n#1|)) (<= |c_ULTIMATE.start_downsweep_~n#1| 2) .cse0 (= (select .cse8 .cse10) 0) (= .cse7 (store .cse5 .cse6 0)) (= .cse11 .cse10) (= |c_ULTIMATE.start_downsweep_~temp~0#1| 0) .cse12 .cse13 (not (= .cse11 .cse9)))) .cse3))))) .cse12 .cse13 (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse20 (+ (- 1) 1)) (.cse21 (* (- 1) 1)) (.cse16 (+ (* .cse1 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (or (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse22 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|)) (.cse15 (store (store .cse7 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0))) (let ((.cse18 (@diff v_arrayElimCell_44 .cse7)) (.cse17 (select .cse15 .cse16)) (.cse19 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse22))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse14 (store .cse15 .cse16 (+ (select .cse15 .cse9) .cse17))) (= .cse7 (store v_arrayElimCell_44 .cse18 0)) (= (select v_arrayElimCell_44 .cse19) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse18) 0) (= .cse17 |c_ULTIMATE.start_downsweep_~temp~0#1|) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse20 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse21)) (= (store v_arrayElimCell_44 .cse19 v_ArrVal_1207) .cse5) (= (select .cse7 (+ .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))))) (and (= (select .cse7 (@diff .cse7 .cse7)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse26 (* v_prenex_6 4)) (.cse23 (store (store .cse7 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0))) (let ((.cse24 (select .cse23 .cse16)) (.cse25 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse26))) (and (<= |c_ULTIMATE.start_main_~a~0#1.offset| v_prenex_11) (= (store .cse23 .cse16 (+ (select .cse23 .cse9) .cse24)) .cse14) (= |c_ULTIMATE.start_downsweep_~temp~0#1| .cse24) (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= (select .cse7 .cse25) 0) (< v_prenex_6 v_prenex_10) (<= .cse20 (+ .cse21 v_prenex_8)) (= .cse5 (store .cse7 .cse25 v_prenex_7)) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= (select .cse7 (+ .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))))))) is different from false [2023-02-18 05:04:41,426 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (* (- 1) |c_ULTIMATE.start_downsweep_~left~1#1|)) (.cse1 (+ 1 |c_ULTIMATE.start_downsweep_~left~1#1|))) (let ((.cse2 (+ .cse4 .cse1)) (.cse0 (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse12 (= |c_ULTIMATE.start_downsweep_~a#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse13 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse9 (+ (* 4 |c_ULTIMATE.start_downsweep_~left~1#1|) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse7 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_downsweep_~a#1.offset| 0) .cse0 (= .cse1 (+ (- 1) (* .cse2 2))) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_downsweep_~a#1.base|)) (> .cse2 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_downsweep_~a#1.offset|) (or (<= 0 (+ (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (<= 0 (+ (- 1) |c_ULTIMATE.start_downsweep_~a#1.offset|)) (<= |c_ULTIMATE.start_downsweep_~a#1.offset| (- 1)) (let ((.cse10 (+ (* |c_ULTIMATE.start_downsweep_~right~1#1| 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (let ((.cse3 (= .cse9 .cse10))) (and (or (not .cse3) (and (= (+ .cse4 |c_ULTIMATE.start_downsweep_~right~1#1|) 0) (<= |c_ULTIMATE.start_downsweep_~left~1#1| (+ (- 1) |c_ULTIMATE.start_downsweep_~right~1#1|)))) (or (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_downsweep_~a#1.base|)) (.cse6 (@diff .cse5 .cse7)) (.cse11 (+ (* |c_ULTIMATE.start_downsweep_~n#1| 4) (- 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (and (or (= (select .cse5 .cse6) 0) (= .cse7 .cse5)) (= (select .cse8 .cse9) 0) (<= 0 (+ (- 2) |c_ULTIMATE.start_downsweep_~n#1|)) (<= |c_ULTIMATE.start_downsweep_~n#1| 2) .cse0 (= (select .cse8 .cse10) 0) (= .cse7 (store .cse5 .cse6 0)) (= .cse11 .cse10) (= |c_ULTIMATE.start_downsweep_~temp~0#1| 0) .cse12 .cse13 (not (= .cse11 .cse9)))) .cse3))))) .cse12 .cse13 (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse20 (+ (- 1) 1)) (.cse21 (* (- 1) 1)) (.cse16 (+ (* .cse1 4) |c_ULTIMATE.start_downsweep_~a#1.offset|))) (or (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse22 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|)) (.cse15 (store (store .cse7 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0))) (let ((.cse18 (@diff v_arrayElimCell_44 .cse7)) (.cse17 (select .cse15 .cse16)) (.cse19 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse22))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse14 (store .cse15 .cse16 (+ (select .cse15 .cse9) .cse17))) (= .cse7 (store v_arrayElimCell_44 .cse18 0)) (= (select v_arrayElimCell_44 .cse19) 0) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse18) 0) (= .cse17 |c_ULTIMATE.start_downsweep_~temp~0#1|) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse20 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse21)) (= (store v_arrayElimCell_44 .cse19 v_ArrVal_1207) .cse5) (= (select .cse7 (+ .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))))) (and (= (select .cse7 (@diff .cse7 .cse7)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse26 (* v_prenex_6 4)) (.cse23 (store (store .cse7 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) |c_ULTIMATE.start_downsweep_~a#1.offset|) 0))) (let ((.cse24 (select .cse23 .cse16)) (.cse25 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse26))) (and (<= |c_ULTIMATE.start_main_~a~0#1.offset| v_prenex_11) (= (store .cse23 .cse16 (+ (select .cse23 .cse9) .cse24)) .cse14) (= |c_ULTIMATE.start_downsweep_~temp~0#1| .cse24) (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= (select .cse7 .cse25) 0) (< v_prenex_6 v_prenex_10) (<= .cse20 (+ .cse21 v_prenex_8)) (= .cse5 (store .cse7 .cse25 v_prenex_7)) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= (select .cse7 (+ .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))))))))))) is different from true [2023-02-18 05:04:41,435 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse17 (+ 0 1)) (.cse1 (@diff .cse0 .cse2)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (or (= (select .cse0 .cse1) 0) (= .cse2 .cse0)) (let ((.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 0))) (.cse8 (+ (* .cse17 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ (- 1) 1)) (.cse5 (* (- 1) 1))) (or (and (= (select .cse2 (@diff .cse2 .cse2)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse11 (* v_prenex_6 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse11))) (and (<= |c_ULTIMATE.start_main_~a~0#1.offset| v_prenex_11) (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= (select .cse2 .cse3) 0) (< v_prenex_6 v_prenex_10) (<= .cse4 (+ .cse5 v_prenex_8)) (= .cse6 (let ((.cse7 (store (store .cse2 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (let ((.cse9 (select .cse7 .cse8))) (store (store .cse7 .cse8 (+ .cse9 (select .cse7 .cse10))) .cse10 .cse9)))) (= .cse0 (store .cse2 .cse3 v_prenex_7)) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= (select .cse2 (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse16 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse12 (@diff v_arrayElimCell_44 .cse2)) (.cse13 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse16))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse2 (store v_arrayElimCell_44 .cse12 0)) (= (select v_arrayElimCell_44 .cse13) 0) (= .cse6 (let ((.cse14 (store (store .cse2 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (let ((.cse15 (select .cse14 .cse8))) (store (store .cse14 .cse8 (+ (select .cse14 .cse10) .cse15)) .cse10 .cse15)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse12) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse4 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse5)) (= (store v_arrayElimCell_44 .cse13 v_ArrVal_1207) .cse0) (= (select .cse2 (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))))))) (> (+ .cse17 (* (- 1) 0)) 0) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse2 (store .cse0 .cse1 0)) (= (select .cse6 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from false [2023-02-18 05:04:41,440 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base|)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse17 (+ 0 1)) (.cse1 (@diff .cse0 .cse2)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (or (= (select .cse0 .cse1) 0) (= .cse2 .cse0)) (let ((.cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 4 0))) (.cse8 (+ (* .cse17 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ (- 1) 1)) (.cse5 (* (- 1) 1))) (or (and (= (select .cse2 (@diff .cse2 .cse2)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse11 (* v_prenex_6 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse11))) (and (<= |c_ULTIMATE.start_main_~a~0#1.offset| v_prenex_11) (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= (select .cse2 .cse3) 0) (< v_prenex_6 v_prenex_10) (<= .cse4 (+ .cse5 v_prenex_8)) (= .cse6 (let ((.cse7 (store (store .cse2 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (let ((.cse9 (select .cse7 .cse8))) (store (store .cse7 .cse8 (+ .cse9 (select .cse7 .cse10))) .cse10 .cse9)))) (= .cse0 (store .cse2 .cse3 v_prenex_7)) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= (select .cse2 (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)))))) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse16 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse12 (@diff v_arrayElimCell_44 .cse2)) (.cse13 (+ |c_ULTIMATE.start_main_~a0~0#1.offset| .cse16))) (and (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse2 (store v_arrayElimCell_44 .cse12 0)) (= (select v_arrayElimCell_44 .cse13) 0) (= .cse6 (let ((.cse14 (store (store .cse2 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (let ((.cse15 (select .cse14 .cse8))) (store (store .cse14 .cse8 (+ (select .cse14 .cse10) .cse15)) .cse10 .cse15)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse12) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse4 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse5)) (= (store v_arrayElimCell_44 .cse13 v_ArrVal_1207) .cse0) (= (select .cse2 (+ .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (<= |c_ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_upsweep_~a#1.offset|))))))) (> (+ .cse17 (* (- 1) 0)) 0) (not (= |c_ULTIMATE.start_main_~a0~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse2 (store .cse0 .cse1 0)) (= (select .cse6 4) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)))) is different from true [2023-02-18 05:04:41,574 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse16 (+ 0 1)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_check_~a0#1.base|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|))) (and (not (= |c_ULTIMATE.start_check_~a0#1.base| |c_ULTIMATE.start_check_~a#1.base|)) (= |c_ULTIMATE.start_check_~i~0#1| 0) (let ((.cse8 (+ (* 4 0) 0)) (.cse7 (+ (* .cse16 4) 0)) (.cse1 (+ (- 1) 1)) (.cse2 (* (- 1) 1)) (.cse0 ((as const (Array Int Int)) 0))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse4 (* v_prenex_6 4))) (let ((.cse3 (+ .cse4 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (< v_prenex_6 v_prenex_10) (<= .cse1 (+ .cse2 v_prenex_8)) (<= |c_ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (= (select .cse0 .cse3) 0) (= (select .cse0 (+ .cse4 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse5 (let ((.cse6 (store (store .cse0 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse9 (select .cse6 .cse7))) (store (store .cse6 .cse7 (+ (select .cse6 .cse8) .cse9)) .cse8 .cse9)))) (= (store .cse0 .cse3 v_prenex_7) .cse10)))))) (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse11 (@diff v_arrayElimCell_44 .cse0)) (.cse14 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse11 0)) (= .cse5 (let ((.cse12 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse13 (select .cse12 .cse7))) (store (store .cse12 .cse7 (+ (select .cse12 .cse8) .cse13)) .cse8 .cse13)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse11) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse1 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse2)) (= (select v_arrayElimCell_44 .cse14) 0) (= (select .cse0 (+ .cse15 0)) 0) (= (store v_arrayElimCell_44 .cse14 v_ArrVal_1207) .cse10))))) (<= |c_ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|))))) (> (+ .cse16 (* (- 1) 0)) 0) (= (select .cse10 (+ (* |c_ULTIMATE.start_check_~i~0#1| 4) |c_ULTIMATE.start_check_~a0#1.offset|)) 0) (= |c_ULTIMATE.start_check_~a#1.offset| 0) (= |c_ULTIMATE.start_check_~sum~0#1| 0) (= (select .cse5 4) 0))) is different from false [2023-02-18 05:04:41,578 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse16 (+ 0 1)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_check_~a0#1.base|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|))) (and (not (= |c_ULTIMATE.start_check_~a0#1.base| |c_ULTIMATE.start_check_~a#1.base|)) (= |c_ULTIMATE.start_check_~i~0#1| 0) (let ((.cse8 (+ (* 4 0) 0)) (.cse7 (+ (* .cse16 4) 0)) (.cse1 (+ (- 1) 1)) (.cse2 (* (- 1) 1)) (.cse0 ((as const (Array Int Int)) 0))) (or (and (= (select .cse0 (@diff .cse0 .cse0)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse4 (* v_prenex_6 4))) (let ((.cse3 (+ .cse4 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (< v_prenex_6 v_prenex_10) (<= .cse1 (+ .cse2 v_prenex_8)) (<= |c_ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (= (select .cse0 .cse3) 0) (= (select .cse0 (+ .cse4 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse5 (let ((.cse6 (store (store .cse0 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse9 (select .cse6 .cse7))) (store (store .cse6 .cse7 (+ (select .cse6 .cse8) .cse9)) .cse8 .cse9)))) (= (store .cse0 .cse3 v_prenex_7) .cse10)))))) (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse15 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse11 (@diff v_arrayElimCell_44 .cse0)) (.cse14 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse15))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse0 (store v_arrayElimCell_44 .cse11 0)) (= .cse5 (let ((.cse12 (store (store .cse0 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse13 (select .cse12 .cse7))) (store (store .cse12 .cse7 (+ (select .cse12 .cse8) .cse13)) .cse8 .cse13)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse11) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse1 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse2)) (= (select v_arrayElimCell_44 .cse14) 0) (= (select .cse0 (+ .cse15 0)) 0) (= (store v_arrayElimCell_44 .cse14 v_ArrVal_1207) .cse10))))) (<= |c_ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|))))) (> (+ .cse16 (* (- 1) 0)) 0) (= (select .cse10 (+ (* |c_ULTIMATE.start_check_~i~0#1| 4) |c_ULTIMATE.start_check_~a0#1.offset|)) 0) (= |c_ULTIMATE.start_check_~a#1.offset| 0) (= |c_ULTIMATE.start_check_~sum~0#1| 0) (= (select .cse5 4) 0))) is different from true [2023-02-18 05:04:41,688 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 0 1)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|))) (and (= |c_ULTIMATE.start_check_~i~0#1| 0) (> (+ .cse0 (* (- 1) 0)) 0) (= |c_ULTIMATE.start_check_~a#1.offset| 0) (= |c_ULTIMATE.start_check_#t~mem12#1| 0) (let ((.cse10 (+ (* 4 0) 0)) (.cse9 (+ (* .cse0 4) 0)) (.cse4 (+ (- 1) 1)) (.cse5 (* (- 1) 1)) (.cse1 ((as const (Array Int Int)) 0)) (.cse12 (* |c_ULTIMATE.start_check_~i~0#1| 4))) (or (and (= (select .cse1 (@diff .cse1 .cse1)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (|ULTIMATE.start_check_~a0#1.base| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse6 (* v_prenex_6 4))) (let ((.cse3 (+ .cse6 |ULTIMATE.start_main_~a0~0#1.offset|)) (.cse2 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse2 (store .cse1 .cse3 v_prenex_7)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (< v_prenex_6 v_prenex_10) (<= .cse4 (+ .cse5 v_prenex_8)) (= (select .cse1 .cse3) 0) (= (select .cse1 (+ .cse6 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse7 (let ((.cse8 (store (store .cse1 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse11 (select .cse8 .cse9))) (store (store .cse8 .cse9 (+ (select .cse8 .cse10) .cse11)) .cse10 .cse11)))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)) (= |c_ULTIMATE.start_check_#t~mem12#1| (select .cse2 (+ .cse12 |ULTIMATE.start_check_~a0#1.offset|)))))))) (exists ((|ULTIMATE.start_check_~a0#1.base| Int)) (and (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)) (exists ((|ULTIMATE.start_check_~a0#1.offset| Int)) (let ((.cse18 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse17 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse13 (@diff v_arrayElimCell_44 .cse1)) (.cse16 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse17))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse1 (store v_arrayElimCell_44 .cse13 0)) (= .cse7 (let ((.cse14 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse15 (select .cse14 .cse9))) (store (store .cse14 .cse9 (+ (select .cse14 .cse10) .cse15)) .cse10 .cse15)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse13) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse4 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse5)) (= (select v_arrayElimCell_44 .cse16) 0) (= (select .cse1 (+ .cse17 0)) 0) (= .cse18 (store v_arrayElimCell_44 .cse16 v_ArrVal_1207)))))))) (= |c_ULTIMATE.start_check_#t~mem12#1| (select .cse18 (+ .cse12 |ULTIMATE.start_check_~a0#1.offset|)))))))))) (= |c_ULTIMATE.start_check_~sum~0#1| 0) (= (select .cse7 4) 0))) is different from false [2023-02-18 05:04:41,691 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 0 1)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|))) (and (= |c_ULTIMATE.start_check_~i~0#1| 0) (> (+ .cse0 (* (- 1) 0)) 0) (= |c_ULTIMATE.start_check_~a#1.offset| 0) (= |c_ULTIMATE.start_check_#t~mem12#1| 0) (let ((.cse10 (+ (* 4 0) 0)) (.cse9 (+ (* .cse0 4) 0)) (.cse4 (+ (- 1) 1)) (.cse5 (* (- 1) 1)) (.cse1 ((as const (Array Int Int)) 0)) (.cse12 (* |c_ULTIMATE.start_check_~i~0#1| 4))) (or (and (= (select .cse1 (@diff .cse1 .cse1)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (|ULTIMATE.start_check_~a0#1.base| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse6 (* v_prenex_6 4))) (let ((.cse3 (+ .cse6 |ULTIMATE.start_main_~a0~0#1.offset|)) (.cse2 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse2 (store .cse1 .cse3 v_prenex_7)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (< v_prenex_6 v_prenex_10) (<= .cse4 (+ .cse5 v_prenex_8)) (= (select .cse1 .cse3) 0) (= (select .cse1 (+ .cse6 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse7 (let ((.cse8 (store (store .cse1 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse11 (select .cse8 .cse9))) (store (store .cse8 .cse9 (+ (select .cse8 .cse10) .cse11)) .cse10 .cse11)))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)) (= |c_ULTIMATE.start_check_#t~mem12#1| (select .cse2 (+ .cse12 |ULTIMATE.start_check_~a0#1.offset|)))))))) (exists ((|ULTIMATE.start_check_~a0#1.base| Int)) (and (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)) (exists ((|ULTIMATE.start_check_~a0#1.offset| Int)) (let ((.cse18 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse17 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse13 (@diff v_arrayElimCell_44 .cse1)) (.cse16 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse17))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse1 (store v_arrayElimCell_44 .cse13 0)) (= .cse7 (let ((.cse14 (store (store .cse1 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse15 (select .cse14 .cse9))) (store (store .cse14 .cse9 (+ (select .cse14 .cse10) .cse15)) .cse10 .cse15)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse13) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse4 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse5)) (= (select v_arrayElimCell_44 .cse16) 0) (= (select .cse1 (+ .cse17 0)) 0) (= .cse18 (store v_arrayElimCell_44 .cse16 v_ArrVal_1207)))))))) (= |c_ULTIMATE.start_check_#t~mem12#1| (select .cse18 (+ .cse12 |ULTIMATE.start_check_~a0#1.offset|)))))))))) (= |c_ULTIMATE.start_check_~sum~0#1| 0) (= (select .cse7 4) 0))) is different from true [2023-02-18 05:04:41,764 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|)) (.cse0 (+ 0 1)) (.cse1 (* (- 1) 0)) (.cse2 (= |c_ULTIMATE.start_check_~sum~0#1| 0))) (and (= |c_ULTIMATE.start_check_~i~0#1| 0) (> (+ .cse0 .cse1) 0) (or (not .cse2) (and (= (select .cse3 4) |c_ULTIMATE.start_check_~sum~0#1|) .cse2)) (let ((.cse5 (* |c_ULTIMATE.start_check_~i~0#1| 4)) (.cse6 (+ .cse1 |c_ULTIMATE.start_check_~sum~0#1|)) (.cse13 (+ (- 1) 1)) (.cse14 (* (- 1) 1)) (.cse11 (+ (* 4 0) 0)) (.cse10 (+ (* .cse0 4) 0)) (.cse7 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_check_~a0#1.base| Int)) (and (exists ((|ULTIMATE.start_check_~a0#1.offset| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (= (select .cse4 (+ .cse5 |ULTIMATE.start_check_~a0#1.offset|)) .cse6) (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse16 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse8 (@diff v_arrayElimCell_44 .cse7)) (.cse15 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse16))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse7 (store v_arrayElimCell_44 .cse8 0)) (= .cse3 (let ((.cse9 (store (store .cse7 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse12 (select .cse9 .cse10))) (store (store .cse9 .cse10 (+ (select .cse9 .cse11) .cse12)) .cse11 .cse12)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse8) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse13 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse14)) (= (select v_arrayElimCell_44 .cse15) 0) (= (select .cse7 (+ .cse16 0)) 0) (= .cse4 (store v_arrayElimCell_44 .cse15 v_ArrVal_1207))))))))))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)))) (and (= (select .cse7 (@diff .cse7 .cse7)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (|ULTIMATE.start_check_~a0#1.base| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse19 (* v_prenex_6 4))) (let ((.cse17 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|)) (.cse18 (+ .cse19 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (= (select .cse17 (+ .cse5 |ULTIMATE.start_check_~a0#1.offset|)) .cse6) (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse17 (store .cse7 .cse18 v_prenex_7)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (< v_prenex_6 v_prenex_10) (<= .cse13 (+ .cse14 v_prenex_8)) (= (select .cse7 .cse18) 0) (= (select .cse7 (+ .cse19 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse3 (let ((.cse20 (store (store .cse7 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse21 (select .cse20 .cse10))) (store (store .cse20 .cse10 (+ (select .cse20 .cse11) .cse21)) .cse11 .cse21)))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|))))))))) (= |c_ULTIMATE.start_check_~a#1.offset| 0) (or (let ((.cse22 (<= |c_ULTIMATE.start_check_~sum~0#1| 0))) (and (or (not (<= (+ |c_ULTIMATE.start_check_~sum~0#1| 1) 0)) (<= 0 |c_ULTIMATE.start_check_~sum~0#1|) (not .cse22)) .cse22)) .cse2))) is different from false [2023-02-18 05:04:41,768 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|)) (.cse0 (+ 0 1)) (.cse1 (* (- 1) 0)) (.cse2 (= |c_ULTIMATE.start_check_~sum~0#1| 0))) (and (= |c_ULTIMATE.start_check_~i~0#1| 0) (> (+ .cse0 .cse1) 0) (or (not .cse2) (and (= (select .cse3 4) |c_ULTIMATE.start_check_~sum~0#1|) .cse2)) (let ((.cse5 (* |c_ULTIMATE.start_check_~i~0#1| 4)) (.cse6 (+ .cse1 |c_ULTIMATE.start_check_~sum~0#1|)) (.cse13 (+ (- 1) 1)) (.cse14 (* (- 1) 1)) (.cse11 (+ (* 4 0) 0)) (.cse10 (+ (* .cse0 4) 0)) (.cse7 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_check_~a0#1.base| Int)) (and (exists ((|ULTIMATE.start_check_~a0#1.offset| Int)) (let ((.cse4 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (= (select .cse4 (+ .cse5 |ULTIMATE.start_check_~a0#1.offset|)) .cse6) (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse16 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse8 (@diff v_arrayElimCell_44 .cse7)) (.cse15 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse16))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse7 (store v_arrayElimCell_44 .cse8 0)) (= .cse3 (let ((.cse9 (store (store .cse7 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse12 (select .cse9 .cse10))) (store (store .cse9 .cse10 (+ (select .cse9 .cse11) .cse12)) .cse11 .cse12)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse8) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse13 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse14)) (= (select v_arrayElimCell_44 .cse15) 0) (= (select .cse7 (+ .cse16 0)) 0) (= .cse4 (store v_arrayElimCell_44 .cse15 v_ArrVal_1207))))))))))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)))) (and (= (select .cse7 (@diff .cse7 .cse7)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (|ULTIMATE.start_check_~a0#1.base| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse19 (* v_prenex_6 4))) (let ((.cse17 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|)) (.cse18 (+ .cse19 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (= (select .cse17 (+ .cse5 |ULTIMATE.start_check_~a0#1.offset|)) .cse6) (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse17 (store .cse7 .cse18 v_prenex_7)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (< v_prenex_6 v_prenex_10) (<= .cse13 (+ .cse14 v_prenex_8)) (= (select .cse7 .cse18) 0) (= (select .cse7 (+ .cse19 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse3 (let ((.cse20 (store (store .cse7 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse21 (select .cse20 .cse10))) (store (store .cse20 .cse10 (+ (select .cse20 .cse11) .cse21)) .cse11 .cse21)))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|))))))))) (= |c_ULTIMATE.start_check_~a#1.offset| 0) (or (let ((.cse22 (<= |c_ULTIMATE.start_check_~sum~0#1| 0))) (and (or (not (<= (+ |c_ULTIMATE.start_check_~sum~0#1| 1) 0)) (<= 0 |c_ULTIMATE.start_check_~sum~0#1|) (not .cse22)) .cse22)) .cse2))) is different from true [2023-02-18 05:04:41,779 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|)) (.cse0 (+ 0 1)) (.cse1 (* (- 1) 0)) (.cse22 (+ (- 1) |c_ULTIMATE.start_check_~i~0#1|)) (.cse2 (= |c_ULTIMATE.start_check_~sum~0#1| 0))) (and (> (+ .cse0 .cse1) 0) (or (not .cse2) (and (or (<= |c_ULTIMATE.start_check_~a#1.offset| (- 1)) (= (select .cse3 (+ (* |c_ULTIMATE.start_check_~i~0#1| 4) |c_ULTIMATE.start_check_~a#1.offset|)) |c_ULTIMATE.start_check_~sum~0#1|) (<= 0 (+ (- 1) |c_ULTIMATE.start_check_~a#1.offset|))) .cse2)) (let ((.cse4 (+ .cse1 |c_ULTIMATE.start_check_~sum~0#1|)) (.cse6 (* .cse22 4)) (.cse13 (+ (- 1) 1)) (.cse14 (* (- 1) 1)) (.cse11 (+ (* 4 0) 0)) (.cse10 (+ (* .cse0 4) 0)) (.cse7 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_check_~a0#1.base| Int)) (and (exists ((|ULTIMATE.start_check_~a0#1.offset| Int)) (let ((.cse5 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (= .cse4 (select .cse5 (+ .cse6 |ULTIMATE.start_check_~a0#1.offset|))) (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse16 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse8 (@diff v_arrayElimCell_44 .cse7)) (.cse15 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse16))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse7 (store v_arrayElimCell_44 .cse8 0)) (= .cse3 (let ((.cse9 (store (store .cse7 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse12 (select .cse9 .cse10))) (store (store .cse9 .cse10 (+ (select .cse9 .cse11) .cse12)) .cse11 .cse12)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse8) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse13 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse14)) (= (select v_arrayElimCell_44 .cse15) 0) (= (select .cse7 (+ .cse16 0)) 0) (= .cse5 (store v_arrayElimCell_44 .cse15 v_ArrVal_1207))))))))))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)))) (and (= (select .cse7 (@diff .cse7 .cse7)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (|ULTIMATE.start_check_~a0#1.base| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse19 (* v_prenex_6 4))) (let ((.cse17 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|)) (.cse18 (+ .cse19 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse17 (store .cse7 .cse18 v_prenex_7)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= .cse4 (select .cse17 (+ .cse6 |ULTIMATE.start_check_~a0#1.offset|))) (< v_prenex_6 v_prenex_10) (<= .cse13 (+ .cse14 v_prenex_8)) (= (select .cse7 .cse18) 0) (= (select .cse7 (+ .cse19 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse3 (let ((.cse20 (store (store .cse7 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse21 (select .cse20 .cse10))) (store (store .cse20 .cse10 (+ (select .cse20 .cse11) .cse21)) .cse11 .cse21)))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|))))))))) (= |c_ULTIMATE.start_check_~a#1.offset| 0) (= .cse22 0) (or (let ((.cse23 (<= |c_ULTIMATE.start_check_~sum~0#1| 0))) (and (or (not (<= (+ |c_ULTIMATE.start_check_~sum~0#1| 1) 0)) (<= 0 |c_ULTIMATE.start_check_~sum~0#1|) (not .cse23)) .cse23)) .cse2))) is different from false [2023-02-18 05:04:41,783 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_check_~a#1.base|)) (.cse0 (+ 0 1)) (.cse1 (* (- 1) 0)) (.cse22 (+ (- 1) |c_ULTIMATE.start_check_~i~0#1|)) (.cse2 (= |c_ULTIMATE.start_check_~sum~0#1| 0))) (and (> (+ .cse0 .cse1) 0) (or (not .cse2) (and (or (<= |c_ULTIMATE.start_check_~a#1.offset| (- 1)) (= (select .cse3 (+ (* |c_ULTIMATE.start_check_~i~0#1| 4) |c_ULTIMATE.start_check_~a#1.offset|)) |c_ULTIMATE.start_check_~sum~0#1|) (<= 0 (+ (- 1) |c_ULTIMATE.start_check_~a#1.offset|))) .cse2)) (let ((.cse4 (+ .cse1 |c_ULTIMATE.start_check_~sum~0#1|)) (.cse6 (* .cse22 4)) (.cse13 (+ (- 1) 1)) (.cse14 (* (- 1) 1)) (.cse11 (+ (* 4 0) 0)) (.cse10 (+ (* .cse0 4) 0)) (.cse7 ((as const (Array Int Int)) 0))) (or (exists ((|ULTIMATE.start_check_~a0#1.base| Int)) (and (exists ((|ULTIMATE.start_check_~a0#1.offset| Int)) (let ((.cse5 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|))) (and (= .cse4 (select .cse5 (+ .cse6 |ULTIMATE.start_check_~a0#1.offset|))) (exists ((|ULTIMATE.start_main_~a0~0#1.offset| Int)) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (exists ((|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (v_arrayElimCell_44 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse16 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse8 (@diff v_arrayElimCell_44 .cse7)) (.cse15 (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse16))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse7 (store v_arrayElimCell_44 .cse8 0)) (= .cse3 (let ((.cse9 (store (store .cse7 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse12 (select .cse9 .cse10))) (store (store .cse9 .cse10 (+ (select .cse9 .cse11) .cse12)) .cse11 .cse12)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse8) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse13 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse14)) (= (select v_arrayElimCell_44 .cse15) 0) (= (select .cse7 (+ .cse16 0)) 0) (= .cse5 (store v_arrayElimCell_44 .cse15 v_ArrVal_1207))))))))))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|)))) (and (= (select .cse7 (@diff .cse7 .cse7)) 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (|ULTIMATE.start_check_~a0#1.base| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse19 (* v_prenex_6 4))) (let ((.cse17 (select |c_#memory_int| |ULTIMATE.start_check_~a0#1.base|)) (.cse18 (+ .cse19 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse17 (store .cse7 .cse18 v_prenex_7)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= .cse4 (select .cse17 (+ .cse6 |ULTIMATE.start_check_~a0#1.offset|))) (< v_prenex_6 v_prenex_10) (<= .cse13 (+ .cse14 v_prenex_8)) (= (select .cse7 .cse18) 0) (= (select .cse7 (+ .cse19 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)) (= .cse3 (let ((.cse20 (store (store .cse7 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse21 (select .cse20 .cse10))) (store (store .cse20 .cse10 (+ (select .cse20 .cse11) .cse21)) .cse11 .cse21)))) (not (= |c_ULTIMATE.start_check_~a#1.base| |ULTIMATE.start_check_~a0#1.base|))))))))) (= |c_ULTIMATE.start_check_~a#1.offset| 0) (= .cse22 0) (or (let ((.cse23 (<= |c_ULTIMATE.start_check_~sum~0#1| 0))) (and (or (not (<= (+ |c_ULTIMATE.start_check_~sum~0#1| 1) 0)) (<= 0 |c_ULTIMATE.start_check_~sum~0#1|) (not .cse23)) .cse23)) .cse2))) is different from true [2023-02-18 05:04:41,871 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse28 (+ 0 1)) (.cse27 (* (- 1) 0)) (.cse29 (= |c_ULTIMATE.start_check_~sum~0#1| 0))) (and (let ((.cse9 (+ (- 1) 1)) (.cse5 ((as const (Array Int Int)) 0))) (let ((.cse13 (= (select .cse5 (@diff .cse5 .cse5)) 0)) (.cse3 (+ (* 4 0) 0)) (.cse2 (+ (* .cse28 4) 0)) (.cse10 (* (- 1) 1)) (.cse6 (+ .cse27 |c_ULTIMATE.start_check_~sum~0#1|)) (.cse7 (* .cse9 4))) (or (exists ((v_arrayElimCell_44 (Array Int Int)) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_prenex_12 Int) (v_prenex_13 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse12 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse11 (+ .cse12 v_prenex_13))) (let ((.cse8 (@diff v_arrayElimCell_44 .cse5)) (.cse0 (store v_arrayElimCell_44 .cse11 v_ArrVal_1207))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (= .cse0 (let ((.cse1 (store (store .cse5 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse4 (select .cse1 .cse2))) (store (store .cse1 .cse2 (+ (select .cse1 .cse3) .cse4)) .cse3 .cse4)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse6 (select .cse0 (+ .cse7 v_prenex_12))) (= .cse5 (store v_arrayElimCell_44 .cse8 0)) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse8) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse9 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse10)) (= (select v_arrayElimCell_44 .cse11) 0) (<= v_prenex_12 v_prenex_13) (= |c_ULTIMATE.start_check_#t~mem11#1| (select .cse0 (+ (* 4 1) 0))) (= (select .cse5 (+ .cse12 0)) 0)))))) (and .cse13 (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse18 (store (store .cse5 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse19 (select .cse18 .cse2))) (let ((.cse17 (* v_prenex_6 4)) (.cse15 (+ (select .cse18 .cse3) .cse19))) (let ((.cse14 (store (store .cse18 .cse2 .cse15) .cse3 .cse19)) (.cse16 (+ .cse17 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse6 (select .cse14 (+ .cse7 |ULTIMATE.start_check_~a0#1.offset|))) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= |c_ULTIMATE.start_check_#t~mem11#1| .cse15) (< v_prenex_6 v_prenex_10) (<= .cse9 (+ .cse10 v_prenex_8)) (= .cse14 (store .cse5 .cse16 v_prenex_7)) (= (select .cse5 .cse16) 0) (= (select .cse5 (+ .cse17 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1))))))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_prenex_12 Int) (v_prenex_13 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse23 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse21 (@diff v_arrayElimCell_44 .cse5)) (.cse20 (+ .cse23 v_prenex_13))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse6 (select (store v_arrayElimCell_44 .cse20 v_ArrVal_1207) (+ .cse7 v_prenex_12))) (= .cse5 (store v_arrayElimCell_44 .cse21 0)) (= |c_ULTIMATE.start_check_#t~mem11#1| (let ((.cse22 (store (store .cse5 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (+ (select .cse22 .cse3) (select .cse22 .cse2)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse21) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse9 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse10)) (= (select v_arrayElimCell_44 .cse20) 0) (<= v_prenex_12 v_prenex_13) (= (select .cse5 (+ .cse23 0)) 0))))) (and .cse13 (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse26 (* v_prenex_6 4))) (let ((.cse25 (+ .cse26 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= |c_ULTIMATE.start_check_#t~mem11#1| (let ((.cse24 (store (store .cse5 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (+ (select .cse24 .cse3) (select .cse24 .cse2)))) (< v_prenex_6 v_prenex_10) (<= .cse9 (+ .cse10 v_prenex_8)) (= .cse6 (select (store .cse5 .cse25 v_prenex_7) (+ .cse7 |ULTIMATE.start_check_~a0#1.offset|))) (= (select .cse5 .cse25) 0) (= (select .cse5 (+ .cse26 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)))))))))) (or (not .cse29) (and (= |c_ULTIMATE.start_check_#t~mem11#1| |c_ULTIMATE.start_check_~sum~0#1|) .cse29)) (> (+ .cse28 .cse27) 0) (or (let ((.cse30 (<= |c_ULTIMATE.start_check_~sum~0#1| 0))) (and (or (not (<= (+ |c_ULTIMATE.start_check_~sum~0#1| 1) 0)) (<= 0 |c_ULTIMATE.start_check_~sum~0#1|) (not .cse30)) .cse30)) .cse29))) is different from false [2023-02-18 05:04:41,878 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse28 (+ 0 1)) (.cse27 (* (- 1) 0)) (.cse29 (= |c_ULTIMATE.start_check_~sum~0#1| 0))) (and (let ((.cse9 (+ (- 1) 1)) (.cse5 ((as const (Array Int Int)) 0))) (let ((.cse13 (= (select .cse5 (@diff .cse5 .cse5)) 0)) (.cse3 (+ (* 4 0) 0)) (.cse2 (+ (* .cse28 4) 0)) (.cse10 (* (- 1) 1)) (.cse6 (+ .cse27 |c_ULTIMATE.start_check_~sum~0#1|)) (.cse7 (* .cse9 4))) (or (exists ((v_arrayElimCell_44 (Array Int Int)) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|ULTIMATE.start_downsweep_~n#1| Int) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_prenex_12 Int) (v_prenex_13 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse12 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse11 (+ .cse12 v_prenex_13))) (let ((.cse8 (@diff v_arrayElimCell_44 .cse5)) (.cse0 (store v_arrayElimCell_44 .cse11 v_ArrVal_1207))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (= .cse0 (let ((.cse1 (store (store .cse5 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (let ((.cse4 (select .cse1 .cse2))) (store (store .cse1 .cse2 (+ (select .cse1 .cse3) .cse4)) .cse3 .cse4)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse6 (select .cse0 (+ .cse7 v_prenex_12))) (= .cse5 (store v_arrayElimCell_44 .cse8 0)) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse8) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse9 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse10)) (= (select v_arrayElimCell_44 .cse11) 0) (<= v_prenex_12 v_prenex_13) (= |c_ULTIMATE.start_check_#t~mem11#1| (select .cse0 (+ (* 4 1) 0))) (= (select .cse5 (+ .cse12 0)) 0)))))) (and .cse13 (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse18 (store (store .cse5 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (let ((.cse19 (select .cse18 .cse2))) (let ((.cse17 (* v_prenex_6 4)) (.cse15 (+ (select .cse18 .cse3) .cse19))) (let ((.cse14 (store (store .cse18 .cse2 .cse15) .cse3 .cse19)) (.cse16 (+ .cse17 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (= .cse6 (select .cse14 (+ .cse7 |ULTIMATE.start_check_~a0#1.offset|))) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= |c_ULTIMATE.start_check_#t~mem11#1| .cse15) (< v_prenex_6 v_prenex_10) (<= .cse9 (+ .cse10 v_prenex_8)) (= .cse14 (store .cse5 .cse16 v_prenex_7)) (= (select .cse5 .cse16) 0) (= (select .cse5 (+ .cse17 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1))))))))) (exists ((v_arrayElimCell_44 (Array Int Int)) (|ULTIMATE.start_downsweep_~n#1| Int) (|ULTIMATE.start_upsweep_~right~0#1| Int) (v_ArrVal_1209 Int) (|v_ULTIMATE.start_main_~i~1#1_171| Int) (v_prenex_12 Int) (v_prenex_13 Int) (|ULTIMATE.start_upsweep_~a#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse23 (* 4 |v_ULTIMATE.start_main_~i~1#1_171|))) (let ((.cse21 (@diff v_arrayElimCell_44 .cse5)) (.cse20 (+ .cse23 v_prenex_13))) (and (<= 0 |ULTIMATE.start_upsweep_~a#1.offset|) (<= |ULTIMATE.start_downsweep_~n#1| (+ 1 |v_ULTIMATE.start_main_~i~1#1_171|)) (< |v_ULTIMATE.start_main_~i~1#1_171| |ULTIMATE.start_downsweep_~n#1|) (= .cse6 (select (store v_arrayElimCell_44 .cse20 v_ArrVal_1207) (+ .cse7 v_prenex_12))) (= .cse5 (store v_arrayElimCell_44 .cse21 0)) (= |c_ULTIMATE.start_check_#t~mem11#1| (let ((.cse22 (store (store .cse5 (+ (* |ULTIMATE.start_upsweep_~right~0#1| 4) |ULTIMATE.start_upsweep_~a#1.offset|) v_ArrVal_1209) (+ (* (+ (- 1) |ULTIMATE.start_downsweep_~n#1|) 4) 0) 0))) (+ (select .cse22 .cse3) (select .cse22 .cse2)))) (<= |ULTIMATE.start_downsweep_~n#1| (+ (- 1) |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|)) (= (select v_arrayElimCell_44 .cse21) 0) (<= (+ |ULTIMATE.start_downsweep_~n#1| |v_ULTIMATE.start_main_~i~1#1_171|) (+ |ULTIMATE.start_downsweep_~n#1| 1)) (<= .cse9 (+ |ULTIMATE.start_upsweep_~right~0#1| .cse10)) (= (select v_arrayElimCell_44 .cse20) 0) (<= v_prenex_12 v_prenex_13) (= (select .cse5 (+ .cse23 0)) 0))))) (and .cse13 (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|ULTIMATE.start_check_~a0#1.offset| Int) (v_prenex_11 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (let ((.cse26 (* v_prenex_6 4))) (let ((.cse25 (+ .cse26 |ULTIMATE.start_main_~a0~0#1.offset|))) (and (<= |ULTIMATE.start_check_~a0#1.offset| |ULTIMATE.start_main_~a0~0#1.offset|) (<= v_prenex_10 (+ v_prenex_6 1)) (<= v_prenex_10 (+ (- 1) v_prenex_10 v_prenex_6)) (= |c_ULTIMATE.start_check_#t~mem11#1| (let ((.cse24 (store (store .cse5 (+ v_prenex_11 (* v_prenex_8 4)) v_prenex_9) (+ (* (+ (- 1) v_prenex_10) 4) 0) 0))) (+ (select .cse24 .cse3) (select .cse24 .cse2)))) (< v_prenex_6 v_prenex_10) (<= .cse9 (+ .cse10 v_prenex_8)) (= .cse6 (select (store .cse5 .cse25 v_prenex_7) (+ .cse7 |ULTIMATE.start_check_~a0#1.offset|))) (= (select .cse5 .cse25) 0) (= (select .cse5 (+ .cse26 0)) 0) (<= 0 v_prenex_11) (<= (+ v_prenex_10 v_prenex_6) (+ v_prenex_10 1)))))))))) (or (not .cse29) (and (= |c_ULTIMATE.start_check_#t~mem11#1| |c_ULTIMATE.start_check_~sum~0#1|) .cse29)) (> (+ .cse28 .cse27) 0) (or (let ((.cse30 (<= |c_ULTIMATE.start_check_~sum~0#1| 0))) (and (or (not (<= (+ |c_ULTIMATE.start_check_~sum~0#1| 1) 0)) (<= 0 |c_ULTIMATE.start_check_~sum~0#1|) (not .cse30)) .cse30)) .cse29))) is different from true [2023-02-18 05:04:42,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:04:42,124 INFO L93 Difference]: Finished difference Result 299 states and 337 transitions. [2023-02-18 05:04:42,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-02-18 05:04:42,125 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 70 states have (on average 1.7714285714285714) internal successors, (124), 69 states have internal predecessors, (124), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 80 [2023-02-18 05:04:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:04:42,126 INFO L225 Difference]: With dead ends: 299 [2023-02-18 05:04:42,126 INFO L226 Difference]: Without dead ends: 299 [2023-02-18 05:04:42,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 72 SyntacticMatches, 9 SemanticMatches, 148 ConstructedPredicates, 58 IntricatePredicates, 0 DeprecatedPredicates, 1735 ImplicationChecksByTransitivity, 632.5s TimeCoverageRelationStatistics Valid=741, Invalid=7491, Unknown=372, NotChecked=13746, Total=22350 [2023-02-18 05:04:42,127 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 116 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 3824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2378 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-18 05:04:42,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1492 Invalid, 3824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1419 Invalid, 0 Unknown, 2378 Unchecked, 1.3s Time] [2023-02-18 05:04:42,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-02-18 05:04:42,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 288. [2023-02-18 05:04:42,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 269 states have (on average 1.1598513011152416) internal successors, (312), 277 states have internal predecessors, (312), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 05:04:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 326 transitions. [2023-02-18 05:04:42,135 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 326 transitions. Word has length 80 [2023-02-18 05:04:42,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:04:42,135 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 326 transitions. [2023-02-18 05:04:42,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 70 states have (on average 1.7714285714285714) internal successors, (124), 69 states have internal predecessors, (124), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 05:04:42,135 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 326 transitions. [2023-02-18 05:04:42,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-02-18 05:04:42,138 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:04:42,138 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:04:42,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2023-02-18 05:04:42,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:04:42,343 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 05:04:42,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:04:42,343 INFO L85 PathProgramCache]: Analyzing trace with hash 7851651, now seen corresponding path program 1 times [2023-02-18 05:04:42,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:04:42,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502622872] [2023-02-18 05:04:42,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:04:42,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:04:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:42,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 05:04:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:42,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 05:04:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:42,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-18 05:04:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:42,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 05:04:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:42,509 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 05:04:42,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:04:42,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502622872] [2023-02-18 05:04:42,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502622872] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:04:42,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881089863] [2023-02-18 05:04:42,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:04:42,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:04:42,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:04:42,511 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 05:04:42,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2023-02-18 05:04:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:42,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-18 05:04:42,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:04:42,670 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 05:04:42,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:04:42,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2023-02-18 05:04:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 05:04:42,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881089863] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:04:42,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 05:04:42,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2023-02-18 05:04:42,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382375986] [2023-02-18 05:04:42,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 05:04:42,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-18 05:04:42,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:04:42,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-18 05:04:42,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2023-02-18 05:04:42,746 INFO L87 Difference]: Start difference. First operand 288 states and 326 transitions. Second operand has 21 states, 20 states have (on average 8.95) internal successors, (179), 20 states have internal predecessors, (179), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 05:04:42,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:04:42,929 INFO L93 Difference]: Finished difference Result 298 states and 335 transitions. [2023-02-18 05:04:42,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 05:04:42,929 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 8.95) internal successors, (179), 20 states have internal predecessors, (179), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 81 [2023-02-18 05:04:42,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:04:42,930 INFO L225 Difference]: With dead ends: 298 [2023-02-18 05:04:42,930 INFO L226 Difference]: Without dead ends: 298 [2023-02-18 05:04:42,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2023-02-18 05:04:42,931 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 366 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 05:04:42,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 306 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 05:04:42,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-02-18 05:04:42,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 292. [2023-02-18 05:04:42,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 273 states have (on average 1.1611721611721613) internal successors, (317), 281 states have internal predecessors, (317), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 05:04:42,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 331 transitions. [2023-02-18 05:04:42,934 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 331 transitions. Word has length 81 [2023-02-18 05:04:42,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:04:42,935 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 331 transitions. [2023-02-18 05:04:42,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 8.95) internal successors, (179), 20 states have internal predecessors, (179), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 05:04:42,935 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 331 transitions. [2023-02-18 05:04:42,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-02-18 05:04:42,936 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:04:42,936 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:04:42,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2023-02-18 05:04:43,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:04:43,141 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 05:04:43,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:04:43,141 INFO L85 PathProgramCache]: Analyzing trace with hash 652412467, now seen corresponding path program 2 times [2023-02-18 05:04:43,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:04:43,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870542684] [2023-02-18 05:04:43,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:04:43,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:04:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:43,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 05:04:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:43,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 05:04:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:43,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 05:04:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:43,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 05:04:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:43,203 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-02-18 05:04:43,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:04:43,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870542684] [2023-02-18 05:04:43,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870542684] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:04:43,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896272658] [2023-02-18 05:04:43,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 05:04:43,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:04:43,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:04:43,205 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 05:04:43,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-02-18 05:04:43,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 05:04:43,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 05:04:43,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 05:04:43,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:04:43,361 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-18 05:04:43,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:04:43,408 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-18 05:04:43,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896272658] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:04:43,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 05:04:43,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2023-02-18 05:04:43,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714682978] [2023-02-18 05:04:43,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 05:04:43,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 05:04:43,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:04:43,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 05:04:43,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-02-18 05:04:43,410 INFO L87 Difference]: Start difference. First operand 292 states and 331 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 17 states have internal predecessors, (105), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 05:04:43,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:04:43,643 INFO L93 Difference]: Finished difference Result 316 states and 352 transitions. [2023-02-18 05:04:43,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-18 05:04:43,644 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 17 states have internal predecessors, (105), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 81 [2023-02-18 05:04:43,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:04:43,645 INFO L225 Difference]: With dead ends: 316 [2023-02-18 05:04:43,645 INFO L226 Difference]: Without dead ends: 316 [2023-02-18 05:04:43,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 156 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2023-02-18 05:04:43,645 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 291 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 05:04:43,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 685 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 05:04:43,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2023-02-18 05:04:43,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 292. [2023-02-18 05:04:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 273 states have (on average 1.1538461538461537) internal successors, (315), 281 states have internal predecessors, (315), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 05:04:43,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 329 transitions. [2023-02-18 05:04:43,649 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 329 transitions. Word has length 81 [2023-02-18 05:04:43,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:04:43,649 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 329 transitions. [2023-02-18 05:04:43,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 17 states have internal predecessors, (105), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 05:04:43,649 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 329 transitions. [2023-02-18 05:04:43,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-02-18 05:04:43,650 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:04:43,650 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:04:43,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2023-02-18 05:04:43,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:04:43,859 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 05:04:43,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:04:43,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1909949515, now seen corresponding path program 2 times [2023-02-18 05:04:43,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:04:43,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795610065] [2023-02-18 05:04:43,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:04:43,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:04:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:44,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 05:04:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:44,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 05:04:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:44,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-18 05:04:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:44,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 05:04:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 05:04:44,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:04:44,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795610065] [2023-02-18 05:04:44,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795610065] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:04:44,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425536820] [2023-02-18 05:04:44,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 05:04:44,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:04:44,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:04:44,075 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 05:04:44,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-02-18 05:04:44,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 05:04:44,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 05:04:44,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-18 05:04:44,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:04:44,331 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-18 05:04:44,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:04:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 05:04:44,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425536820] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:04:44,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 05:04:44,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 9] total 28 [2023-02-18 05:04:44,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536524346] [2023-02-18 05:04:44,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 05:04:44,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-18 05:04:44,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:04:44,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-18 05:04:44,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2023-02-18 05:04:44,650 INFO L87 Difference]: Start difference. First operand 292 states and 329 transitions. Second operand has 28 states, 28 states have (on average 4.178571428571429) internal successors, (117), 27 states have internal predecessors, (117), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 05:04:45,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:04:45,157 INFO L93 Difference]: Finished difference Result 289 states and 320 transitions. [2023-02-18 05:04:45,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-18 05:04:45,161 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.178571428571429) internal successors, (117), 27 states have internal predecessors, (117), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 83 [2023-02-18 05:04:45,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:04:45,162 INFO L225 Difference]: With dead ends: 289 [2023-02-18 05:04:45,162 INFO L226 Difference]: Without dead ends: 289 [2023-02-18 05:04:45,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 156 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=244, Invalid=1238, Unknown=0, NotChecked=0, Total=1482 [2023-02-18 05:04:45,162 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 516 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 05:04:45,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 806 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 05:04:45,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-02-18 05:04:45,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 273. [2023-02-18 05:04:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 254 states have (on average 1.1496062992125984) internal successors, (292), 262 states have internal predecessors, (292), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 05:04:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 306 transitions. [2023-02-18 05:04:45,165 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 306 transitions. Word has length 83 [2023-02-18 05:04:45,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:04:45,166 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 306 transitions. [2023-02-18 05:04:45,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.178571428571429) internal successors, (117), 27 states have internal predecessors, (117), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 05:04:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 306 transitions. [2023-02-18 05:04:45,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-02-18 05:04:45,167 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:04:45,167 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:04:45,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2023-02-18 05:04:45,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2023-02-18 05:04:45,372 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 05:04:45,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:04:45,372 INFO L85 PathProgramCache]: Analyzing trace with hash 208254327, now seen corresponding path program 5 times [2023-02-18 05:04:45,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:04:45,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699153380] [2023-02-18 05:04:45,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:04:45,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:04:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:45,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 05:04:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:45,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 05:04:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:45,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 05:04:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:45,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 05:04:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-18 05:04:45,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:04:45,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699153380] [2023-02-18 05:04:45,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699153380] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:04:45,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848420855] [2023-02-18 05:04:45,451 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 05:04:45,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:04:45,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:04:45,452 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 05:04:45,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2023-02-18 05:04:47,717 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2023-02-18 05:04:47,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 05:04:47,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 05:04:47,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:04:47,783 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 7 proven. 22 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-18 05:04:47,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:04:47,856 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-18 05:04:47,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848420855] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:04:47,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 05:04:47,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2023-02-18 05:04:47,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836422549] [2023-02-18 05:04:47,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 05:04:47,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-18 05:04:47,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:04:47,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-18 05:04:47,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2023-02-18 05:04:47,858 INFO L87 Difference]: Start difference. First operand 273 states and 306 transitions. Second operand has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 05:04:48,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:04:48,098 INFO L93 Difference]: Finished difference Result 561 states and 644 transitions. [2023-02-18 05:04:48,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-18 05:04:48,099 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 83 [2023-02-18 05:04:48,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:04:48,100 INFO L225 Difference]: With dead ends: 561 [2023-02-18 05:04:48,100 INFO L226 Difference]: Without dead ends: 561 [2023-02-18 05:04:48,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=326, Invalid=1156, Unknown=0, NotChecked=0, Total=1482 [2023-02-18 05:04:48,100 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 1024 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 05:04:48,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1024 Valid, 1033 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 05:04:48,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2023-02-18 05:04:48,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 308. [2023-02-18 05:04:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 289 states have (on average 1.1695501730103806) internal successors, (338), 297 states have internal predecessors, (338), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 05:04:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 352 transitions. [2023-02-18 05:04:48,104 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 352 transitions. Word has length 83 [2023-02-18 05:04:48,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:04:48,104 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 352 transitions. [2023-02-18 05:04:48,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 05:04:48,104 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 352 transitions. [2023-02-18 05:04:48,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-02-18 05:04:48,105 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:04:48,105 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:04:48,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2023-02-18 05:04:48,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2023-02-18 05:04:48,311 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 05:04:48,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:04:48,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1262713382, now seen corresponding path program 2 times [2023-02-18 05:04:48,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:04:48,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798235883] [2023-02-18 05:04:48,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:04:48,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:04:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:48,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 05:04:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:48,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 05:04:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:48,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-18 05:04:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:48,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 05:04:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-18 05:04:48,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:04:48,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798235883] [2023-02-18 05:04:48,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798235883] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:04:48,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878909483] [2023-02-18 05:04:48,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 05:04:48,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:04:48,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:04:48,435 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 05:04:48,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2023-02-18 05:04:48,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 05:04:48,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 05:04:48,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 05:04:48,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:04:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 05:04:48,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:04:48,651 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 05:04:48,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878909483] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:04:48,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 05:04:48,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 16 [2023-02-18 05:04:48,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083564130] [2023-02-18 05:04:48,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 05:04:48,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 05:04:48,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:04:48,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 05:04:48,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-02-18 05:04:48,653 INFO L87 Difference]: Start difference. First operand 308 states and 352 transitions. Second operand has 16 states, 16 states have (on average 6.75) internal successors, (108), 15 states have internal predecessors, (108), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 05:04:48,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:04:48,800 INFO L93 Difference]: Finished difference Result 313 states and 356 transitions. [2023-02-18 05:04:48,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 05:04:48,800 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 15 states have internal predecessors, (108), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 85 [2023-02-18 05:04:48,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:04:48,801 INFO L225 Difference]: With dead ends: 313 [2023-02-18 05:04:48,801 INFO L226 Difference]: Without dead ends: 249 [2023-02-18 05:04:48,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 157 SyntacticMatches, 16 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-02-18 05:04:48,801 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 69 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 05:04:48,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 645 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 05:04:48,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-02-18 05:04:48,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2023-02-18 05:04:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 233 states have (on average 1.201716738197425) internal successors, (280), 241 states have internal predecessors, (280), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 05:04:48,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 288 transitions. [2023-02-18 05:04:48,804 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 288 transitions. Word has length 85 [2023-02-18 05:04:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:04:48,804 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 288 transitions. [2023-02-18 05:04:48,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 15 states have internal predecessors, (108), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 05:04:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 288 transitions. [2023-02-18 05:04:48,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-02-18 05:04:48,805 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:04:48,805 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:04:48,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2023-02-18 05:04:49,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2023-02-18 05:04:49,010 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 05:04:49,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:04:49,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1732526820, now seen corresponding path program 2 times [2023-02-18 05:04:49,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:04:49,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18183408] [2023-02-18 05:04:49,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:04:49,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:04:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:49,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 05:04:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:49,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 05:04:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:49,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 05:04:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:49,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 05:04:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:49,181 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 55 proven. 56 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-18 05:04:49,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:04:49,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18183408] [2023-02-18 05:04:49,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18183408] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:04:49,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745463160] [2023-02-18 05:04:49,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 05:04:49,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:04:49,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:04:49,197 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 05:04:49,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2023-02-18 05:04:49,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 05:04:49,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 05:04:49,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-18 05:04:49,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:04:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 76 proven. 33 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-18 05:04:49,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:04:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 76 proven. 33 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-18 05:04:49,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745463160] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:04:49,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 05:04:49,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 26 [2023-02-18 05:04:49,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627966240] [2023-02-18 05:04:49,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 05:04:49,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-18 05:04:49,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:04:49,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-18 05:04:49,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2023-02-18 05:04:49,595 INFO L87 Difference]: Start difference. First operand 249 states and 288 transitions. Second operand has 26 states, 26 states have (on average 4.423076923076923) internal successors, (115), 25 states have internal predecessors, (115), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 05:04:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:04:49,953 INFO L93 Difference]: Finished difference Result 296 states and 338 transitions. [2023-02-18 05:04:49,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 05:04:49,953 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.423076923076923) internal successors, (115), 25 states have internal predecessors, (115), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 85 [2023-02-18 05:04:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:04:49,954 INFO L225 Difference]: With dead ends: 296 [2023-02-18 05:04:49,954 INFO L226 Difference]: Without dead ends: 296 [2023-02-18 05:04:49,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 128 SyntacticMatches, 40 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=277, Invalid=983, Unknown=0, NotChecked=0, Total=1260 [2023-02-18 05:04:49,955 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 281 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 05:04:49,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1061 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 05:04:49,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-02-18 05:04:49,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 241. [2023-02-18 05:04:49,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 225 states have (on average 1.2044444444444444) internal successors, (271), 233 states have internal predecessors, (271), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 05:04:49,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 279 transitions. [2023-02-18 05:04:49,959 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 279 transitions. Word has length 85 [2023-02-18 05:04:49,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:04:49,960 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 279 transitions. [2023-02-18 05:04:49,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.423076923076923) internal successors, (115), 25 states have internal predecessors, (115), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 05:04:49,960 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 279 transitions. [2023-02-18 05:04:49,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-02-18 05:04:49,960 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:04:49,960 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:04:49,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2023-02-18 05:04:50,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2023-02-18 05:04:50,165 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 05:04:50,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:04:50,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1683277778, now seen corresponding path program 6 times [2023-02-18 05:04:50,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:04:50,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435202070] [2023-02-18 05:04:50,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:04:50,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:04:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:50,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 05:04:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:50,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 05:04:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:50,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 05:04:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:50,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 05:04:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:50,463 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 1 proven. 83 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-02-18 05:04:50,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:04:50,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435202070] [2023-02-18 05:04:50,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435202070] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:04:50,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845524633] [2023-02-18 05:04:50,464 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-18 05:04:50,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:04:50,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:04:50,465 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 05:04:50,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2023-02-18 05:04:51,123 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-02-18 05:04:51,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 05:04:51,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-18 05:04:51,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:04:51,497 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 21 proven. 33 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-02-18 05:04:51,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:04:51,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2023-02-18 05:04:51,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845524633] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:04:51,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 05:04:51,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2023-02-18 05:04:51,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735235364] [2023-02-18 05:04:51,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 05:04:51,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-18 05:04:51,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:04:51,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-18 05:04:51,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1069, Unknown=0, NotChecked=0, Total=1190 [2023-02-18 05:04:51,764 INFO L87 Difference]: Start difference. First operand 241 states and 279 transitions. Second operand has 25 states, 25 states have (on average 3.64) internal successors, (91), 24 states have internal predecessors, (91), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 05:04:54,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:04:54,995 INFO L93 Difference]: Finished difference Result 536 states and 615 transitions. [2023-02-18 05:04:54,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-18 05:04:54,995 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.64) internal successors, (91), 24 states have internal predecessors, (91), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 88 [2023-02-18 05:04:54,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:04:54,997 INFO L225 Difference]: With dead ends: 536 [2023-02-18 05:04:54,997 INFO L226 Difference]: Without dead ends: 536 [2023-02-18 05:04:54,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=672, Invalid=3360, Unknown=0, NotChecked=0, Total=4032 [2023-02-18 05:04:54,997 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 779 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 2576 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 2585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-02-18 05:04:54,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1450 Invalid, 2585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2576 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-02-18 05:04:54,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2023-02-18 05:04:55,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 251. [2023-02-18 05:04:55,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 235 states have (on average 1.195744680851064) internal successors, (281), 243 states have internal predecessors, (281), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 05:04:55,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 289 transitions. [2023-02-18 05:04:55,001 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 289 transitions. Word has length 88 [2023-02-18 05:04:55,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:04:55,001 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 289 transitions. [2023-02-18 05:04:55,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.64) internal successors, (91), 24 states have internal predecessors, (91), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 05:04:55,001 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 289 transitions. [2023-02-18 05:04:55,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-02-18 05:04:55,002 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:04:55,002 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:04:55,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2023-02-18 05:04:55,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:04:55,207 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 05:04:55,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:04:55,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1780554796, now seen corresponding path program 3 times [2023-02-18 05:04:55,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:04:55,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444897375] [2023-02-18 05:04:55,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:04:55,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:04:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:55,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 05:04:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:55,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 05:04:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:55,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 05:04:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:55,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 05:04:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:55,437 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-18 05:04:55,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:04:55,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444897375] [2023-02-18 05:04:55,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444897375] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:04:55,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478420338] [2023-02-18 05:04:55,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 05:04:55,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:04:55,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:04:55,438 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 05:04:55,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2023-02-18 05:04:55,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-18 05:04:55,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 05:04:55,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 05:04:55,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:04:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-02-18 05:04:55,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:04:55,734 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-02-18 05:04:55,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478420338] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:04:55,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 05:04:55,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 6] total 28 [2023-02-18 05:04:55,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081540657] [2023-02-18 05:04:55,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 05:04:55,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-18 05:04:55,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:04:55,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-18 05:04:55,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2023-02-18 05:04:55,735 INFO L87 Difference]: Start difference. First operand 251 states and 289 transitions. Second operand has 28 states, 28 states have (on average 4.285714285714286) internal successors, (120), 27 states have internal predecessors, (120), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 05:04:56,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:04:56,652 INFO L93 Difference]: Finished difference Result 356 states and 399 transitions. [2023-02-18 05:04:56,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-18 05:04:56,653 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.285714285714286) internal successors, (120), 27 states have internal predecessors, (120), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 89 [2023-02-18 05:04:56,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:04:56,654 INFO L225 Difference]: With dead ends: 356 [2023-02-18 05:04:56,654 INFO L226 Difference]: Without dead ends: 356 [2023-02-18 05:04:56,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=522, Invalid=2558, Unknown=0, NotChecked=0, Total=3080 [2023-02-18 05:04:56,654 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 607 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 05:04:56,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 638 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 05:04:56,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2023-02-18 05:04:56,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 256. [2023-02-18 05:04:56,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 243 states have (on average 1.1646090534979423) internal successors, (283), 248 states have internal predecessors, (283), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 05:04:56,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 291 transitions. [2023-02-18 05:04:56,657 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 291 transitions. Word has length 89 [2023-02-18 05:04:56,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:04:56,657 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 291 transitions. [2023-02-18 05:04:56,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.285714285714286) internal successors, (120), 27 states have internal predecessors, (120), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 05:04:56,658 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 291 transitions. [2023-02-18 05:04:56,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-02-18 05:04:56,658 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:04:56,658 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:04:56,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2023-02-18 05:04:56,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2023-02-18 05:04:56,863 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 05:04:56,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:04:56,863 INFO L85 PathProgramCache]: Analyzing trace with hash -503001260, now seen corresponding path program 1 times [2023-02-18 05:04:56,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:04:56,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381995849] [2023-02-18 05:04:56,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:04:56,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:04:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:56,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 05:04:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:56,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 05:04:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:56,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 05:04:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:56,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 05:04:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:56,978 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2023-02-18 05:04:56,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:04:56,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381995849] [2023-02-18 05:04:56,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381995849] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:04:56,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172807784] [2023-02-18 05:04:56,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:04:56,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:04:56,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:04:56,980 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 05:04:56,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2023-02-18 05:04:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:57,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-18 05:04:57,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:04:57,234 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 21 proven. 34 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-18 05:04:57,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:04:57,391 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 21 proven. 34 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-18 05:04:57,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172807784] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:04:57,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 05:04:57,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 29 [2023-02-18 05:04:57,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613004958] [2023-02-18 05:04:57,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 05:04:57,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-18 05:04:57,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:04:57,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-18 05:04:57,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2023-02-18 05:04:57,393 INFO L87 Difference]: Start difference. First operand 256 states and 291 transitions. Second operand has 29 states, 29 states have (on average 4.724137931034483) internal successors, (137), 28 states have internal predecessors, (137), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-18 05:04:58,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:04:58,545 INFO L93 Difference]: Finished difference Result 468 states and 523 transitions. [2023-02-18 05:04:58,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-02-18 05:04:58,545 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.724137931034483) internal successors, (137), 28 states have internal predecessors, (137), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 94 [2023-02-18 05:04:58,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:04:58,547 INFO L225 Difference]: With dead ends: 468 [2023-02-18 05:04:58,547 INFO L226 Difference]: Without dead ends: 468 [2023-02-18 05:04:58,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 170 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=966, Invalid=3324, Unknown=0, NotChecked=0, Total=4290 [2023-02-18 05:04:58,548 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 1282 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 05:04:58,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 723 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 05:04:58,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2023-02-18 05:04:58,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 288. [2023-02-18 05:04:58,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 275 states have (on average 1.16) internal successors, (319), 280 states have internal predecessors, (319), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 05:04:58,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 327 transitions. [2023-02-18 05:04:58,551 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 327 transitions. Word has length 94 [2023-02-18 05:04:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:04:58,551 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 327 transitions. [2023-02-18 05:04:58,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.724137931034483) internal successors, (137), 28 states have internal predecessors, (137), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-18 05:04:58,552 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 327 transitions. [2023-02-18 05:04:58,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-02-18 05:04:58,552 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:04:58,552 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:04:58,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2023-02-18 05:04:58,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2023-02-18 05:04:58,758 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 05:04:58,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:04:58,758 INFO L85 PathProgramCache]: Analyzing trace with hash -522283457, now seen corresponding path program 3 times [2023-02-18 05:04:58,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:04:58,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302517337] [2023-02-18 05:04:58,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:04:58,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:04:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:58,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 05:04:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:58,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 05:04:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:58,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 05:04:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:58,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 05:04:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:04:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 68 proven. 81 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-02-18 05:04:58,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:04:58,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302517337] [2023-02-18 05:04:58,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302517337] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:04:58,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846795209] [2023-02-18 05:04:58,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 05:04:58,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:04:58,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:04:58,962 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 05:04:58,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2023-02-18 05:04:59,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-18 05:04:59,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 05:04:59,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-18 05:04:59,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:04:59,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 05:04:59,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 05:04:59,205 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:04:59,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 32 [2023-02-18 05:04:59,208 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:04:59,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-18 05:04:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 41 proven. 15 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2023-02-18 05:04:59,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:05:00,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846795209] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:05:00,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 05:05:00,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2023-02-18 05:05:00,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136531844] [2023-02-18 05:05:00,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 05:05:00,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-18 05:05:00,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:05:00,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-18 05:05:00,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1555, Unknown=0, NotChecked=0, Total=1722 [2023-02-18 05:05:00,151 INFO L87 Difference]: Start difference. First operand 288 states and 327 transitions. Second operand has 31 states, 31 states have (on average 3.5161290322580645) internal successors, (109), 30 states have internal predecessors, (109), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-18 05:05:02,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:05:02,629 INFO L93 Difference]: Finished difference Result 352 states and 391 transitions. [2023-02-18 05:05:02,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-18 05:05:02,630 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.5161290322580645) internal successors, (109), 30 states have internal predecessors, (109), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 95 [2023-02-18 05:05:02,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:05:02,631 INFO L225 Difference]: With dead ends: 352 [2023-02-18 05:05:02,631 INFO L226 Difference]: Without dead ends: 352 [2023-02-18 05:05:02,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 145 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1300, Invalid=5020, Unknown=0, NotChecked=0, Total=6320 [2023-02-18 05:05:02,632 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 1037 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 1685 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-18 05:05:02,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 682 Invalid, 1709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1685 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-18 05:05:02,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2023-02-18 05:05:02,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 287. [2023-02-18 05:05:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 275 states have (on average 1.1490909090909092) internal successors, (316), 279 states have internal predecessors, (316), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 05:05:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 324 transitions. [2023-02-18 05:05:02,635 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 324 transitions. Word has length 95 [2023-02-18 05:05:02,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:05:02,635 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 324 transitions. [2023-02-18 05:05:02,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.5161290322580645) internal successors, (109), 30 states have internal predecessors, (109), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-18 05:05:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 324 transitions. [2023-02-18 05:05:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-02-18 05:05:02,636 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:05:02,636 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:05:02,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2023-02-18 05:05:02,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2023-02-18 05:05:02,840 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 05:05:02,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:05:02,841 INFO L85 PathProgramCache]: Analyzing trace with hash 270919136, now seen corresponding path program 2 times [2023-02-18 05:05:02,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:05:02,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588875950] [2023-02-18 05:05:02,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:05:02,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:05:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:03,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 05:05:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:03,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 05:05:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:03,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 05:05:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:03,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 05:05:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:03,066 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 30 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-02-18 05:05:03,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:05:03,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588875950] [2023-02-18 05:05:03,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588875950] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:05:03,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494689415] [2023-02-18 05:05:03,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 05:05:03,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:05:03,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:05:03,068 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 05:05:03,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2023-02-18 05:05:03,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 05:05:03,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 05:05:03,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-18 05:05:03,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:05:03,356 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-02-18 05:05:03,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:05:03,719 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-02-18 05:05:03,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494689415] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:05:03,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 05:05:03,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 13] total 34 [2023-02-18 05:05:03,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942154146] [2023-02-18 05:05:03,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 05:05:03,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-18 05:05:03,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:05:03,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-18 05:05:03,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2023-02-18 05:05:03,721 INFO L87 Difference]: Start difference. First operand 287 states and 324 transitions. Second operand has 34 states, 34 states have (on average 4.4411764705882355) internal successors, (151), 33 states have internal predecessors, (151), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 05:05:04,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:05:04,142 INFO L93 Difference]: Finished difference Result 402 states and 453 transitions. [2023-02-18 05:05:04,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 05:05:04,142 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.4411764705882355) internal successors, (151), 33 states have internal predecessors, (151), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 96 [2023-02-18 05:05:04,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:05:04,144 INFO L225 Difference]: With dead ends: 402 [2023-02-18 05:05:04,144 INFO L226 Difference]: Without dead ends: 402 [2023-02-18 05:05:04,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=390, Invalid=1590, Unknown=0, NotChecked=0, Total=1980 [2023-02-18 05:05:04,144 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 886 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 05:05:04,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 421 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 05:05:04,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2023-02-18 05:05:04,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 336. [2023-02-18 05:05:04,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 324 states have (on average 1.1512345679012346) internal successors, (373), 328 states have internal predecessors, (373), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 05:05:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 381 transitions. [2023-02-18 05:05:04,148 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 381 transitions. Word has length 96 [2023-02-18 05:05:04,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:05:04,148 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 381 transitions. [2023-02-18 05:05:04,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.4411764705882355) internal successors, (151), 33 states have internal predecessors, (151), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 05:05:04,149 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 381 transitions. [2023-02-18 05:05:04,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-02-18 05:05:04,149 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:05:04,149 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:05:04,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2023-02-18 05:05:04,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:05:04,355 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 05:05:04,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:05:04,355 INFO L85 PathProgramCache]: Analyzing trace with hash -2057999223, now seen corresponding path program 7 times [2023-02-18 05:05:04,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:05:04,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735139103] [2023-02-18 05:05:04,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:05:04,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:05:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:04,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 05:05:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:04,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 05:05:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:04,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 05:05:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:04,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 05:05:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 98 proven. 77 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-18 05:05:04,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:05:04,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735139103] [2023-02-18 05:05:04,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735139103] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:05:04,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436211871] [2023-02-18 05:05:04,561 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-18 05:05:04,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:05:04,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:05:04,563 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 05:05:04,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2023-02-18 05:05:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:04,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-18 05:05:04,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:05:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 124 proven. 49 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 05:05:04,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:05:05,079 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 124 proven. 49 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 05:05:05,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436211871] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:05:05,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 05:05:05,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 28 [2023-02-18 05:05:05,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260924935] [2023-02-18 05:05:05,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 05:05:05,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-18 05:05:05,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:05:05,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-18 05:05:05,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2023-02-18 05:05:05,081 INFO L87 Difference]: Start difference. First operand 336 states and 381 transitions. Second operand has 28 states, 28 states have (on average 4.357142857142857) internal successors, (122), 27 states have internal predecessors, (122), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 05:05:05,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:05:05,518 INFO L93 Difference]: Finished difference Result 401 states and 449 transitions. [2023-02-18 05:05:05,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-18 05:05:05,519 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.357142857142857) internal successors, (122), 27 states have internal predecessors, (122), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 98 [2023-02-18 05:05:05,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:05:05,520 INFO L225 Difference]: With dead ends: 401 [2023-02-18 05:05:05,520 INFO L226 Difference]: Without dead ends: 401 [2023-02-18 05:05:05,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 138 SyntacticMatches, 56 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=285, Invalid=1047, Unknown=0, NotChecked=0, Total=1332 [2023-02-18 05:05:05,521 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 326 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 05:05:05,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1257 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 05:05:05,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2023-02-18 05:05:05,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 336. [2023-02-18 05:05:05,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 324 states have (on average 1.1481481481481481) internal successors, (372), 328 states have internal predecessors, (372), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 05:05:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 380 transitions. [2023-02-18 05:05:05,524 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 380 transitions. Word has length 98 [2023-02-18 05:05:05,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:05:05,525 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 380 transitions. [2023-02-18 05:05:05,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.357142857142857) internal successors, (122), 27 states have internal predecessors, (122), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 05:05:05,525 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 380 transitions. [2023-02-18 05:05:05,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-02-18 05:05:05,525 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:05:05,525 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:05:05,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2023-02-18 05:05:05,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:05:05,728 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 05:05:05,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:05:05,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1752925674, now seen corresponding path program 4 times [2023-02-18 05:05:05,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:05:05,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211161348] [2023-02-18 05:05:05,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:05:05,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:05:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:05,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 05:05:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:05,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 05:05:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:05,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 05:05:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:05,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 05:05:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:05,996 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 93 proven. 114 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 05:05:05,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:05:05,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211161348] [2023-02-18 05:05:05,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211161348] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:05:05,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158813782] [2023-02-18 05:05:05,996 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 05:05:05,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:05:05,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:05:06,017 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 05:05:06,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2023-02-18 05:05:06,141 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 05:05:06,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 05:05:06,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-18 05:05:06,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:05:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 80 proven. 116 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-18 05:05:06,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:05:06,640 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 50 proven. 146 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-18 05:05:06,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158813782] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:05:06,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 05:05:06,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 36 [2023-02-18 05:05:06,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212531349] [2023-02-18 05:05:06,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 05:05:06,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-18 05:05:06,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:05:06,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-18 05:05:06,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1071, Unknown=0, NotChecked=0, Total=1260 [2023-02-18 05:05:06,642 INFO L87 Difference]: Start difference. First operand 336 states and 380 transitions. Second operand has 36 states, 36 states have (on average 4.222222222222222) internal successors, (152), 35 states have internal predecessors, (152), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 05:05:07,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:05:07,502 INFO L93 Difference]: Finished difference Result 1168 states and 1334 transitions. [2023-02-18 05:05:07,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-02-18 05:05:07,502 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.222222222222222) internal successors, (152), 35 states have internal predecessors, (152), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 100 [2023-02-18 05:05:07,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:05:07,505 INFO L225 Difference]: With dead ends: 1168 [2023-02-18 05:05:07,505 INFO L226 Difference]: Without dead ends: 1168 [2023-02-18 05:05:07,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 127 SyntacticMatches, 66 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1670 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1022, Invalid=4234, Unknown=0, NotChecked=0, Total=5256 [2023-02-18 05:05:07,506 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 1148 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 05:05:07,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 1481 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 05:05:07,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2023-02-18 05:05:07,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 450. [2023-02-18 05:05:07,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 438 states have (on average 1.143835616438356) internal successors, (501), 442 states have internal predecessors, (501), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 05:05:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 509 transitions. [2023-02-18 05:05:07,519 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 509 transitions. Word has length 100 [2023-02-18 05:05:07,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:05:07,519 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 509 transitions. [2023-02-18 05:05:07,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.222222222222222) internal successors, (152), 35 states have internal predecessors, (152), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 05:05:07,520 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 509 transitions. [2023-02-18 05:05:07,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-02-18 05:05:07,520 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:05:07,520 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:05:07,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2023-02-18 05:05:07,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:05:07,737 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 05:05:07,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:05:07,737 INFO L85 PathProgramCache]: Analyzing trace with hash 591305304, now seen corresponding path program 8 times [2023-02-18 05:05:07,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:05:07,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732654893] [2023-02-18 05:05:07,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:05:07,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:05:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:07,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 05:05:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:07,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 05:05:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:08,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 05:05:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:08,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 05:05:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:08,004 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 12 proven. 169 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-02-18 05:05:08,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:05:08,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732654893] [2023-02-18 05:05:08,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732654893] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:05:08,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770113338] [2023-02-18 05:05:08,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 05:05:08,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:05:08,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:05:08,006 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 05:05:08,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2023-02-18 05:05:08,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 05:05:08,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 05:05:08,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 05:05:08,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:05:08,381 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 60 proven. 119 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-02-18 05:05:08,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:05:08,661 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 12 proven. 167 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-02-18 05:05:08,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770113338] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:05:08,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 05:05:08,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 32 [2023-02-18 05:05:08,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16611250] [2023-02-18 05:05:08,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 05:05:08,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-18 05:05:08,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 05:05:08,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-18 05:05:08,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2023-02-18 05:05:08,662 INFO L87 Difference]: Start difference. First operand 450 states and 509 transitions. Second operand has 32 states, 32 states have (on average 4.28125) internal successors, (137), 31 states have internal predecessors, (137), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 05:05:09,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:05:09,271 INFO L93 Difference]: Finished difference Result 837 states and 937 transitions. [2023-02-18 05:05:09,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-18 05:05:09,272 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.28125) internal successors, (137), 31 states have internal predecessors, (137), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 103 [2023-02-18 05:05:09,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:05:09,273 INFO L225 Difference]: With dead ends: 837 [2023-02-18 05:05:09,274 INFO L226 Difference]: Without dead ends: 837 [2023-02-18 05:05:09,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 139 SyntacticMatches, 61 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=707, Invalid=2715, Unknown=0, NotChecked=0, Total=3422 [2023-02-18 05:05:09,274 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 1027 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 05:05:09,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 1308 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 05:05:09,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2023-02-18 05:05:09,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 392. [2023-02-18 05:05:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 380 states have (on average 1.131578947368421) internal successors, (430), 384 states have internal predecessors, (430), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 05:05:09,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 438 transitions. [2023-02-18 05:05:09,279 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 438 transitions. Word has length 103 [2023-02-18 05:05:09,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:05:09,279 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 438 transitions. [2023-02-18 05:05:09,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.28125) internal successors, (137), 31 states have internal predecessors, (137), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 05:05:09,279 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 438 transitions. [2023-02-18 05:05:09,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-02-18 05:05:09,280 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:05:09,280 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:05:09,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2023-02-18 05:05:09,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2023-02-18 05:05:09,488 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2023-02-18 05:05:09,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:05:09,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1869793770, now seen corresponding path program 9 times [2023-02-18 05:05:09,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 05:05:09,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871146996] [2023-02-18 05:05:09,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:05:09,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 05:05:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:09,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 05:05:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:09,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-18 05:05:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:09,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-18 05:05:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:09,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 05:05:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:05:09,702 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 18 proven. 87 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2023-02-18 05:05:09,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 05:05:09,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871146996] [2023-02-18 05:05:09,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871146996] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:05:09,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308045301] [2023-02-18 05:05:09,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 05:05:09,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 05:05:09,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:05:09,703 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 05:05:09,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2023-02-18 05:05:10,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-18 05:05:10,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 05:05:10,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 67 conjunts are in the unsatisfiable core [2023-02-18 05:05:10,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:05:11,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9