./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/list_flag-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/AutomizerReach.xml -i ../sv-benchmarks/c/list-properties/list_flag-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:15:07,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:15:07,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:15:07,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:15:07,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:15:07,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:15:07,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:15:07,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:15:07,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:15:07,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:15:07,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:15:07,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:15:07,070 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:15:07,072 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:15:07,073 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:15:07,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:15:07,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:15:07,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:15:07,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:15:07,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:15:07,088 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:15:07,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:15:07,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:15:07,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:15:07,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:15:07,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:15:07,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:15:07,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:15:07,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:15:07,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:15:07,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:15:07,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:15:07,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:15:07,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:15:07,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:15:07,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:15:07,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:15:07,108 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:15:07,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:15:07,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:15:07,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:15:07,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:15:07,112 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:15:07,133 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:15:07,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:15:07,134 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:15:07,134 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:15:07,135 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:15:07,135 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:15:07,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:15:07,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:15:07,136 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:15:07,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:15:07,137 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:15:07,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:15:07,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:15:07,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:15:07,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:15:07,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:15:07,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:15:07,139 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:15:07,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:15:07,140 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:15:07,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:15:07,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:15:07,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:15:07,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:15:07,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:15:07,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:15:07,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:15:07,142 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:15:07,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:15:07,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:15:07,142 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:15:07,143 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:15:07,143 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:15:07,143 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/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 ! call(reach_error())) ) 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 -> 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da [2022-07-12 03:15:07,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:15:07,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:15:07,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:15:07,413 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:15:07,415 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:15:07,417 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_flag-2.i [2022-07-12 03:15:07,492 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba77207ca/200d1b458b67412b80d56412243e163d/FLAGb28d44364 [2022-07-12 03:15:07,953 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:15:07,953 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i [2022-07-12 03:15:07,968 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba77207ca/200d1b458b67412b80d56412243e163d/FLAGb28d44364 [2022-07-12 03:15:08,317 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba77207ca/200d1b458b67412b80d56412243e163d [2022-07-12 03:15:08,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:15:08,321 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:15:08,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:15:08,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:15:08,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:15:08,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:15:08" (1/1) ... [2022-07-12 03:15:08,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e5ecb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:15:08, skipping insertion in model container [2022-07-12 03:15:08,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:15:08" (1/1) ... [2022-07-12 03:15:08,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:15:08,377 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:15:08,616 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i[23375,23388] [2022-07-12 03:15:08,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:15:08,629 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:15:08,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i[23375,23388] [2022-07-12 03:15:08,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:15:08,723 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:15:08,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:15:08 WrapperNode [2022-07-12 03:15:08,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:15:08,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:15:08,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:15:08,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:15:08,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:15:08" (1/1) ... [2022-07-12 03:15:08,759 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:15:08" (1/1) ... [2022-07-12 03:15:08,786 INFO L137 Inliner]: procedures = 124, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2022-07-12 03:15:08,787 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:15:08,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:15:08,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:15:08,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:15:08,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:15:08" (1/1) ... [2022-07-12 03:15:08,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:15:08" (1/1) ... [2022-07-12 03:15:08,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:15:08" (1/1) ... [2022-07-12 03:15:08,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:15:08" (1/1) ... [2022-07-12 03:15:08,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:15:08" (1/1) ... [2022-07-12 03:15:08,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:15:08" (1/1) ... [2022-07-12 03:15:08,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:15:08" (1/1) ... [2022-07-12 03:15:08,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:15:08,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:15:08,840 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:15:08,840 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:15:08,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:15:08" (1/1) ... [2022-07-12 03:15:08,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:15:08,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:08,881 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) [2022-07-12 03:15:08,905 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 [2022-07-12 03:15:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-12 03:15:08,926 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-12 03:15:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:15:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:15:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:15:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:15:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:15:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:15:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:15:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:15:08,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:15:09,067 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:15:09,069 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:15:09,119 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-12 03:15:09,233 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:15:09,238 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:15:09,238 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 03:15:09,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:15:09 BoogieIcfgContainer [2022-07-12 03:15:09,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:15:09,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:15:09,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:15:09,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:15:09,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:15:08" (1/3) ... [2022-07-12 03:15:09,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eaf27b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:15:09, skipping insertion in model container [2022-07-12 03:15:09,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:15:08" (2/3) ... [2022-07-12 03:15:09,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eaf27b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:15:09, skipping insertion in model container [2022-07-12 03:15:09,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:15:09" (3/3) ... [2022-07-12 03:15:09,248 INFO L111 eAbstractionObserver]: Analyzing ICFG list_flag-2.i [2022-07-12 03:15:09,268 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:15:09,268 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:15:09,317 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:15:09,323 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@473036ac, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6600291f [2022-07-12 03:15:09,323 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:15:09,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 25 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:09,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 03:15:09,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:09,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:15:09,336 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:09,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:09,341 INFO L85 PathProgramCache]: Analyzing trace with hash 943582971, now seen corresponding path program 1 times [2022-07-12 03:15:09,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:09,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642481873] [2022-07-12 03:15:09,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:09,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:09,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:09,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:09,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642481873] [2022-07-12 03:15:09,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642481873] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:15:09,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:15:09,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:15:09,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844863820] [2022-07-12 03:15:09,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:15:09,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:15:09,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:09,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:15:09,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:15:09,559 INFO L87 Difference]: Start difference. First operand has 27 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 25 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:09,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:09,578 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2022-07-12 03:15:09,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:15:09,582 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 03:15:09,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:09,595 INFO L225 Difference]: With dead ends: 40 [2022-07-12 03:15:09,596 INFO L226 Difference]: Without dead ends: 20 [2022-07-12 03:15:09,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:15:09,603 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:09,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:15:09,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-12 03:15:09,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-12 03:15:09,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:09,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-07-12 03:15:09,635 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 11 [2022-07-12 03:15:09,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:09,636 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-12 03:15:09,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-07-12 03:15:09,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 03:15:09,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:09,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:15:09,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:15:09,639 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:09,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:09,640 INFO L85 PathProgramCache]: Analyzing trace with hash 267820561, now seen corresponding path program 1 times [2022-07-12 03:15:09,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:09,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689898342] [2022-07-12 03:15:09,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:09,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:09,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:09,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:09,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689898342] [2022-07-12 03:15:09,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689898342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:15:09,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:15:09,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:15:09,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365240833] [2022-07-12 03:15:09,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:15:09,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:15:09,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:09,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:15:09,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:15:09,775 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:09,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:09,891 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-07-12 03:15:09,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:15:09,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-12 03:15:09,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:09,893 INFO L225 Difference]: With dead ends: 44 [2022-07-12 03:15:09,893 INFO L226 Difference]: Without dead ends: 40 [2022-07-12 03:15:09,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:15:09,895 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:09,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 57 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:15:09,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-12 03:15:09,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2022-07-12 03:15:09,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:09,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-07-12 03:15:09,904 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 13 [2022-07-12 03:15:09,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:09,905 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-07-12 03:15:09,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:09,905 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-07-12 03:15:09,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 03:15:09,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:09,906 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:15:09,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:15:09,907 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:09,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:09,908 INFO L85 PathProgramCache]: Analyzing trace with hash -273802420, now seen corresponding path program 1 times [2022-07-12 03:15:09,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:09,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966480456] [2022-07-12 03:15:09,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:09,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:09,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:09,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:09,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966480456] [2022-07-12 03:15:09,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966480456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:15:09,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:15:09,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:15:09,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107657485] [2022-07-12 03:15:09,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:15:09,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:15:09,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:09,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:15:09,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:15:09,971 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:10,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:10,057 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-07-12 03:15:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:15:10,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-12 03:15:10,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:10,063 INFO L225 Difference]: With dead ends: 46 [2022-07-12 03:15:10,064 INFO L226 Difference]: Without dead ends: 38 [2022-07-12 03:15:10,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:15:10,065 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:10,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 61 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:15:10,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-12 03:15:10,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2022-07-12 03:15:10,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:10,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-07-12 03:15:10,071 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 15 [2022-07-12 03:15:10,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:10,071 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-07-12 03:15:10,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:10,072 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-07-12 03:15:10,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 03:15:10,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:10,072 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:15:10,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:15:10,073 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:10,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:10,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1517543941, now seen corresponding path program 1 times [2022-07-12 03:15:10,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:10,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607732985] [2022-07-12 03:15:10,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:10,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:10,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:10,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:10,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607732985] [2022-07-12 03:15:10,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607732985] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:15:10,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:15:10,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:15:10,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846840432] [2022-07-12 03:15:10,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:15:10,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:15:10,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:10,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:15:10,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:15:10,146 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:10,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:10,229 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-07-12 03:15:10,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:15:10,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-12 03:15:10,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:10,233 INFO L225 Difference]: With dead ends: 50 [2022-07-12 03:15:10,233 INFO L226 Difference]: Without dead ends: 40 [2022-07-12 03:15:10,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:15:10,237 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:10,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 56 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:15:10,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-12 03:15:10,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2022-07-12 03:15:10,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-12 03:15:10,243 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2022-07-12 03:15:10,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:10,244 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-12 03:15:10,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:10,244 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-12 03:15:10,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 03:15:10,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:10,245 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:15:10,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 03:15:10,245 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:10,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:10,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1906655974, now seen corresponding path program 1 times [2022-07-12 03:15:10,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:10,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069363732] [2022-07-12 03:15:10,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:10,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:10,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:10,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069363732] [2022-07-12 03:15:10,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069363732] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:15:10,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:15:10,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:15:10,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299397850] [2022-07-12 03:15:10,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:15:10,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:15:10,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:10,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:15:10,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:15:10,303 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:10,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:10,318 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-07-12 03:15:10,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:15:10,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-12 03:15:10,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:10,319 INFO L225 Difference]: With dead ends: 50 [2022-07-12 03:15:10,320 INFO L226 Difference]: Without dead ends: 34 [2022-07-12 03:15:10,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:15:10,322 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:10,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:15:10,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-12 03:15:10,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-07-12 03:15:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-12 03:15:10,333 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 19 [2022-07-12 03:15:10,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:10,334 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-12 03:15:10,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:10,334 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-12 03:15:10,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 03:15:10,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:10,338 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:15:10,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 03:15:10,338 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:10,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:10,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1462919029, now seen corresponding path program 1 times [2022-07-12 03:15:10,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:10,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515431104] [2022-07-12 03:15:10,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:10,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:10,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:10,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515431104] [2022-07-12 03:15:10,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515431104] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:10,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405410988] [2022-07-12 03:15:10,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:10,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:10,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:10,524 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) [2022-07-12 03:15:10,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 03:15:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:10,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 03:15:10,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:10,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:15:10,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:15:10,836 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:10,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 03:15:10,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:10,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 03:15:11,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:15:11,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:15:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:11,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:11,096 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_106 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_106) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-12 03:15:11,123 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_104 Int) (v_ArrVal_106 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_104)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_106) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-12 03:15:11,219 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-12 03:15:11,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-12 03:15:11,231 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:11,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-12 03:15:11,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-12 03:15:11,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 03:15:11,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405410988] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:15:11,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:15:11,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-07-12 03:15:11,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512578817] [2022-07-12 03:15:11,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:15:11,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 03:15:11,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:11,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 03:15:11,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=240, Unknown=2, NotChecked=66, Total=380 [2022-07-12 03:15:11,424 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:11,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:11,584 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-07-12 03:15:11,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 03:15:11,585 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-12 03:15:11,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:11,585 INFO L225 Difference]: With dead ends: 50 [2022-07-12 03:15:11,586 INFO L226 Difference]: Without dead ends: 46 [2022-07-12 03:15:11,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=329, Unknown=2, NotChecked=78, Total=506 [2022-07-12 03:15:11,587 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:11,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 133 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 97 Invalid, 0 Unknown, 83 Unchecked, 0.1s Time] [2022-07-12 03:15:11,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-12 03:15:11,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2022-07-12 03:15:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-07-12 03:15:11,591 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 19 [2022-07-12 03:15:11,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:11,591 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-07-12 03:15:11,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:11,592 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-07-12 03:15:11,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 03:15:11,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:11,592 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:15:11,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:15:11,815 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 [2022-07-12 03:15:11,816 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:11,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:11,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1319849960, now seen corresponding path program 1 times [2022-07-12 03:15:11,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:11,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251691621] [2022-07-12 03:15:11,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:11,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:11,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:11,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251691621] [2022-07-12 03:15:11,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251691621] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:11,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637228377] [2022-07-12 03:15:11,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:11,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:11,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:11,940 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) [2022-07-12 03:15:11,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 03:15:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:12,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 03:15:12,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:12,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:15:12,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:15:12,098 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:12,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 03:15:12,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:12,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 03:15:12,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:15:12,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:15:12,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:12,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:12,225 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_158 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_158) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2022-07-12 03:15:12,245 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_155 Int) (v_ArrVal_158 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_155)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_158) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-12 03:15:12,305 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-12 03:15:12,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-12 03:15:12,314 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:12,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-12 03:15:12,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-12 03:15:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 03:15:12,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637228377] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:15:12,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:15:12,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-07-12 03:15:12,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309782858] [2022-07-12 03:15:12,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:15:12,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 03:15:12,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:12,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 03:15:12,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=240, Unknown=3, NotChecked=66, Total=380 [2022-07-12 03:15:12,408 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:16,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:16,608 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2022-07-12 03:15:16,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 03:15:16,612 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-12 03:15:16,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:16,613 INFO L225 Difference]: With dead ends: 85 [2022-07-12 03:15:16,613 INFO L226 Difference]: Without dead ends: 81 [2022-07-12 03:15:16,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=108, Invalid=317, Unknown=3, NotChecked=78, Total=506 [2022-07-12 03:15:16,614 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 78 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:16,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 191 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 161 Invalid, 0 Unknown, 108 Unchecked, 0.1s Time] [2022-07-12 03:15:16,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-12 03:15:16,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 49. [2022-07-12 03:15:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2022-07-12 03:15:16,620 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 19 [2022-07-12 03:15:16,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:16,621 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2022-07-12 03:15:16,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:16,621 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-07-12 03:15:16,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 03:15:16,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:16,621 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:15:16,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 03:15:16,822 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,SelfDestructingSolverStorable6 [2022-07-12 03:15:16,822 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:16,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:16,823 INFO L85 PathProgramCache]: Analyzing trace with hash 876113015, now seen corresponding path program 1 times [2022-07-12 03:15:16,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:16,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136541053] [2022-07-12 03:15:16,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:16,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:16,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:16,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136541053] [2022-07-12 03:15:16,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136541053] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:15:16,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:15:16,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:15:16,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564347590] [2022-07-12 03:15:16,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:15:16,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:15:16,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:16,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:15:16,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:15:16,860 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:16,872 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2022-07-12 03:15:16,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:15:16,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-12 03:15:16,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:16,873 INFO L225 Difference]: With dead ends: 67 [2022-07-12 03:15:16,873 INFO L226 Difference]: Without dead ends: 53 [2022-07-12 03:15:16,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:15:16,875 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:16,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 49 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:15:16,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-12 03:15:16,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2022-07-12 03:15:16,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:16,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2022-07-12 03:15:16,887 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 19 [2022-07-12 03:15:16,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:16,888 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2022-07-12 03:15:16,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:16,888 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-07-12 03:15:16,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 03:15:16,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:16,893 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:15:16,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 03:15:16,893 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:16,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:16,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1445257616, now seen corresponding path program 1 times [2022-07-12 03:15:16,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:16,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678456724] [2022-07-12 03:15:16,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:16,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:17,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:17,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678456724] [2022-07-12 03:15:17,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678456724] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:17,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54268770] [2022-07-12 03:15:17,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:17,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:17,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:17,024 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) [2022-07-12 03:15:17,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 03:15:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:17,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 03:15:17,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:17,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:15:17,153 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:17,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 03:15:17,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:15:17,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:15:17,237 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:15:17,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-07-12 03:15:17,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2022-07-12 03:15:17,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-07-12 03:15:17,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 21 [2022-07-12 03:15:17,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-12 03:15:17,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:15:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:17,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:17,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 57 [2022-07-12 03:15:17,326 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_231 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_231) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((v_ArrVal_233 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2022-07-12 03:15:17,345 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:17,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-12 03:15:17,352 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:17,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2022-07-12 03:15:17,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:15:17,372 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:17,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-07-12 03:15:17,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 03:15:17,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54268770] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:15:17,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:15:17,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-07-12 03:15:17,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076582257] [2022-07-12 03:15:17,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:15:17,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 03:15:17,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:17,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 03:15:17,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=226, Unknown=1, NotChecked=30, Total=306 [2022-07-12 03:15:17,463 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:17,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:17,663 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-07-12 03:15:17,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 03:15:17,663 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 03:15:17,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:17,664 INFO L225 Difference]: With dead ends: 65 [2022-07-12 03:15:17,664 INFO L226 Difference]: Without dead ends: 61 [2022-07-12 03:15:17,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=381, Unknown=1, NotChecked=40, Total=506 [2022-07-12 03:15:17,665 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 49 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:17,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 135 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 204 Invalid, 0 Unknown, 53 Unchecked, 0.1s Time] [2022-07-12 03:15:17,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-12 03:15:17,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2022-07-12 03:15:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:17,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-07-12 03:15:17,670 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 21 [2022-07-12 03:15:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:17,670 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-07-12 03:15:17,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-07-12 03:15:17,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 03:15:17,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:17,671 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:15:17,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 03:15:17,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:17,881 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:17,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:17,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1652508907, now seen corresponding path program 2 times [2022-07-12 03:15:17,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:17,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916508474] [2022-07-12 03:15:17,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:17,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:18,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:18,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916508474] [2022-07-12 03:15:18,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916508474] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:18,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243297354] [2022-07-12 03:15:18,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:15:18,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:18,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:18,019 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) [2022-07-12 03:15:18,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 03:15:18,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:15:18,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:15:18,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-12 03:15:18,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:18,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:15:18,137 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:18,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 03:15:18,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:15:18,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:15:18,199 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:15:18,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-07-12 03:15:18,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2022-07-12 03:15:18,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-07-12 03:15:18,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 21 [2022-07-12 03:15:18,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-12 03:15:18,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:15:18,262 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:18,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:18,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 30 [2022-07-12 03:15:18,313 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2022-07-12 03:15:18,329 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:18,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-12 03:15:18,339 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:18,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2022-07-12 03:15:18,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:15:18,358 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:18,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-07-12 03:15:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 03:15:18,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243297354] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:15:18,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:15:18,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-07-12 03:15:18,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102144569] [2022-07-12 03:15:18,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:15:18,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 03:15:18,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:18,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 03:15:18,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=362, Unknown=1, NotChecked=38, Total=462 [2022-07-12 03:15:18,454 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:18,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:18,828 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2022-07-12 03:15:18,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 03:15:18,829 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-12 03:15:18,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:18,829 INFO L225 Difference]: With dead ends: 67 [2022-07-12 03:15:18,829 INFO L226 Difference]: Without dead ends: 55 [2022-07-12 03:15:18,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=783, Unknown=1, NotChecked=58, Total=992 [2022-07-12 03:15:18,830 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 38 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:18,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 191 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 317 Invalid, 0 Unknown, 60 Unchecked, 0.2s Time] [2022-07-12 03:15:18,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-12 03:15:18,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2022-07-12 03:15:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-07-12 03:15:18,835 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 23 [2022-07-12 03:15:18,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:18,835 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-07-12 03:15:18,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:18,835 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-07-12 03:15:18,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 03:15:18,836 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:18,836 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:15:18,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 03:15:19,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:19,036 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:19,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:19,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1313154078, now seen corresponding path program 1 times [2022-07-12 03:15:19,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:19,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276996053] [2022-07-12 03:15:19,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:19,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:19,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:19,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:19,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276996053] [2022-07-12 03:15:19,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276996053] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:19,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470246472] [2022-07-12 03:15:19,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:19,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:19,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:19,166 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) [2022-07-12 03:15:19,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 03:15:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:19,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-12 03:15:19,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:19,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:15:19,277 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:19,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 03:15:19,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:15:19,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:15:19,346 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:15:19,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-07-12 03:15:19,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-07-12 03:15:19,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-12 03:15:19,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 21 [2022-07-12 03:15:19,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-12 03:15:19,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:15:19,410 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:19,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:19,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 30 [2022-07-12 03:15:19,461 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_336 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_336) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_338 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_338) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) is different from false [2022-07-12 03:15:19,477 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:19,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-12 03:15:19,484 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:19,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2022-07-12 03:15:19,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:15:19,506 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:19,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-07-12 03:15:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 03:15:19,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470246472] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:15:19,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:15:19,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-07-12 03:15:19,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545933552] [2022-07-12 03:15:19,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:15:19,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 03:15:19,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:19,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 03:15:19,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=362, Unknown=1, NotChecked=38, Total=462 [2022-07-12 03:15:19,608 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:19,926 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-07-12 03:15:19,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 03:15:19,926 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-12 03:15:19,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:19,927 INFO L225 Difference]: With dead ends: 61 [2022-07-12 03:15:19,927 INFO L226 Difference]: Without dead ends: 49 [2022-07-12 03:15:19,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=783, Unknown=1, NotChecked=58, Total=992 [2022-07-12 03:15:19,928 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 34 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:19,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 191 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 206 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2022-07-12 03:15:19,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-12 03:15:19,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2022-07-12 03:15:19,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:19,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-07-12 03:15:19,932 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 23 [2022-07-12 03:15:19,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:19,932 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-07-12 03:15:19,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:19,932 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-07-12 03:15:19,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 03:15:19,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:19,933 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:15:19,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 03:15:20,143 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,SelfDestructingSolverStorable10 [2022-07-12 03:15:20,144 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:20,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:20,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1075490678, now seen corresponding path program 2 times [2022-07-12 03:15:20,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:20,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106681586] [2022-07-12 03:15:20,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:20,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:20,279 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:20,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:20,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106681586] [2022-07-12 03:15:20,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106681586] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:20,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798881485] [2022-07-12 03:15:20,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:15:20,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:20,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:20,281 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) [2022-07-12 03:15:20,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 03:15:20,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:15:20,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:15:20,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-12 03:15:20,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:20,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:15:20,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:15:20,432 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:20,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 03:15:20,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:20,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 03:15:20,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:15:20,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:15:20,570 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 03:15:20,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-12 03:15:20,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:15:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:20,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:22,742 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2022-07-12 03:15:22,777 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 1)))) is different from false [2022-07-12 03:15:22,790 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 1)))) is different from false [2022-07-12 03:15:22,823 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_415 Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_415)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) is different from false [2022-07-12 03:15:22,886 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-12 03:15:22,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 61 [2022-07-12 03:15:22,902 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:22,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 273 [2022-07-12 03:15:22,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 241 [2022-07-12 03:15:22,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:15:22,969 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:22,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 141 [2022-07-12 03:15:23,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 125 [2022-07-12 03:15:23,486 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:23,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 282 treesize of output 266 [2022-07-12 03:15:23,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-12 03:15:23,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798881485] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:15:23,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:15:23,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 32 [2022-07-12 03:15:23,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155744136] [2022-07-12 03:15:23,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:15:23,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 03:15:23,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:23,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 03:15:23,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=645, Unknown=5, NotChecked=220, Total=992 [2022-07-12 03:15:23,768 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:23,857 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 1)))) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-12 03:15:23,863 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 1)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-12 03:15:23,869 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_420))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_59|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 1)))) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-12 03:15:24,924 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0)) is different from false [2022-07-12 03:15:25,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:25,009 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-07-12 03:15:25,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 03:15:25,009 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-12 03:15:25,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:25,010 INFO L225 Difference]: With dead ends: 55 [2022-07-12 03:15:25,010 INFO L226 Difference]: Without dead ends: 51 [2022-07-12 03:15:25,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=160, Invalid=793, Unknown=9, NotChecked=520, Total=1482 [2022-07-12 03:15:25,011 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:25,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 201 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 156 Invalid, 0 Unknown, 133 Unchecked, 0.1s Time] [2022-07-12 03:15:25,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-12 03:15:25,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-12 03:15:25,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:25,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-07-12 03:15:25,015 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 25 [2022-07-12 03:15:25,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:25,015 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-07-12 03:15:25,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:25,016 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-07-12 03:15:25,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 03:15:25,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:25,016 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:15:25,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 03:15:25,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:25,228 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:25,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:25,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1387463807, now seen corresponding path program 2 times [2022-07-12 03:15:25,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:25,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916306129] [2022-07-12 03:15:25,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:25,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:25,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:25,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916306129] [2022-07-12 03:15:25,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916306129] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:25,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203147878] [2022-07-12 03:15:25,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:15:25,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:25,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:25,367 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) [2022-07-12 03:15:25,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 03:15:25,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:15:25,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:15:25,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-12 03:15:25,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:25,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:15:25,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:15:25,553 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:25,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 03:15:25,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:25,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 03:15:25,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:15:25,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:15:25,699 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 03:15:25,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-12 03:15:25,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:15:25,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:25,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:27,870 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 2 .cse0) (= 3 .cse0)))) is different from false [2022-07-12 03:15:27,896 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_67| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 2)))) is different from false [2022-07-12 03:15:27,910 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_67| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) is different from false [2022-07-12 03:15:27,934 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 Int) (v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_67| Int)) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_500)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) is different from false [2022-07-12 03:15:27,995 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-12 03:15:27,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 61 [2022-07-12 03:15:28,009 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:28,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 273 [2022-07-12 03:15:28,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 241 [2022-07-12 03:15:28,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:15:28,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 125 [2022-07-12 03:15:28,342 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:28,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 137 [2022-07-12 03:15:28,534 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:28,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 349 treesize of output 325 [2022-07-12 03:15:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-12 03:15:28,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203147878] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:15:28,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:15:28,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 32 [2022-07-12 03:15:28,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574822517] [2022-07-12 03:15:28,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:15:28,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 03:15:28,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:28,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 03:15:28,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=645, Unknown=5, NotChecked=220, Total=992 [2022-07-12 03:15:28,984 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:29,085 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_67| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-12 03:15:29,088 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_67| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 2) (= .cse0 3)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-12 03:15:29,095 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_507 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_67| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_507))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_67|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (= .cse0 2)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-12 03:15:31,098 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 2 .cse0) (= 3 .cse0)))) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-12 03:15:31,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:31,193 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-07-12 03:15:31,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 03:15:31,194 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-12 03:15:31,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:31,194 INFO L225 Difference]: With dead ends: 75 [2022-07-12 03:15:31,195 INFO L226 Difference]: Without dead ends: 71 [2022-07-12 03:15:31,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=160, Invalid=793, Unknown=9, NotChecked=520, Total=1482 [2022-07-12 03:15:31,196 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 65 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:31,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 211 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 195 Invalid, 0 Unknown, 173 Unchecked, 0.1s Time] [2022-07-12 03:15:31,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-12 03:15:31,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2022-07-12 03:15:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 60 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2022-07-12 03:15:31,200 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 25 [2022-07-12 03:15:31,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:31,200 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2022-07-12 03:15:31,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:31,201 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-07-12 03:15:31,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 03:15:31,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:31,201 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:15:31,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 03:15:31,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:31,423 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:31,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:31,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1574953317, now seen corresponding path program 3 times [2022-07-12 03:15:31,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:31,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041361566] [2022-07-12 03:15:31,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:31,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:31,707 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:31,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:31,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041361566] [2022-07-12 03:15:31,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041361566] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:31,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097887309] [2022-07-12 03:15:31,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 03:15:31,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:31,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:31,709 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) [2022-07-12 03:15:31,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 03:15:31,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-12 03:15:31,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:15:31,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-12 03:15:31,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:31,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:15:31,840 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:31,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 03:15:31,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:15:31,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:15:31,918 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:15:31,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-07-12 03:15:31,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:15:31,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:31,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-12 03:15:32,003 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:15:32,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 92 [2022-07-12 03:15:32,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:32,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2022-07-12 03:15:32,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2022-07-12 03:15:32,071 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:15:32,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 72 [2022-07-12 03:15:32,093 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-07-12 03:15:32,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 70 [2022-07-12 03:15:32,105 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-12 03:15:32,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2022-07-12 03:15:32,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-12 03:15:32,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 57 [2022-07-12 03:15:32,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2022-07-12 03:15:32,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2022-07-12 03:15:32,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 117 treesize of output 93 [2022-07-12 03:15:32,433 INFO L356 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-07-12 03:15:32,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 81 [2022-07-12 03:15:32,648 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:32,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2022-07-12 03:15:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:32,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:34,819 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (or (= .cse0 1) (= .cse0 3)))) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) is different from false [2022-07-12 03:15:34,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_592 Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_592)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_77| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_77|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (= 3 .cse0) (not (= (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= .cse0 1)))))) is different from false [2022-07-12 03:15:34,893 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_592 Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_592)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_77| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_77|) 0 3))))) (let ((.cse0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 0)) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (= .cse0 3) (= .cse0 1) (not (= (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))) is different from false [2022-07-12 03:15:34,923 INFO L356 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2022-07-12 03:15:34,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3943 treesize of output 3711 [2022-07-12 03:15:35,019 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:35,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2122 treesize of output 1860 [2022-07-12 03:15:37,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-12 03:15:37,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-12 03:15:37,566 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse70 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse71 (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (not .cse71)) (.cse12 (not .cse70)) (.cse17 (and .cse71 .cse70)) (.cse25 (and (= |c_ULTIMATE.start_main_~a~0#1.offset| (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) .cse70)) (.cse1 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse69 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse68 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse69))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse68 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse69) |c_ULTIMATE.start_main_~p~0#1.offset|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse68)))))))) (.cse2 (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse67 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse66 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse67))) (or (= .cse66 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse67) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse66))))) .cse9)) (.cse3 (or .cse9 (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse65 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse63 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse65)) (.cse64 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse62 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse65))) (or (= .cse62 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse63 .cse64) (= .cse63 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_11 .cse64) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse62))))))) (.cse4 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse61 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse60 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse61)) (.cse59 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse61))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse59 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse60 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse60 |c_ULTIMATE.start_main_~p~0#1.offset|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse59)))))))) (.cse5 (or .cse9 (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse56 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse58 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse57 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse56))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse56) |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse57 .cse58) (= .cse57 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_11 .cse58) 0)) (= .cse57 0)))))))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse6 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse8) (not (= (select v_arrayElimArr_11 .cse8) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse6))))) .cse9) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse10))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) .cse12) (or .cse0 (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) (= .cse13 0)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse14 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= .cse15 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse15)))))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse16 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse16 0))))))) .cse12 .cse9) (or .cse17 (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse18 0)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (or (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse19 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse19 0)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse21 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse20 |c_ULTIMATE.start_main_~p~0#1.offset|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21)))))))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse22 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= .cse22 0)))) .cse9) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse24 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (or (= .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse23 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24)))))) .cse9)) .cse25) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse26 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse26)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse27 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse27)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse28 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse29 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse29 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse30 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse30 0)))))))) (or (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse31 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse32 0)))))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse33 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse33 0)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse34 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse34)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse35 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse35)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse36 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))))) .cse9))) (or .cse17 (and (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse38 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse38))) (or (= .cse37 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse37 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse38) 0))))) .cse9) (or .cse25 (and .cse1 .cse2 (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse39 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse39))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse39) |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse40 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= .cse40 0))))) .cse9) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse41 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse41))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse41) |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse42 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse42 0))))))))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse46 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse46)) (.cse45 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse44 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse46))) (or (= .cse43 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse43 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse44 .cse45) (not (= (select v_arrayElimArr_11 .cse45) 0)) (= .cse44 0))))) .cse9) .cse3 .cse4 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse47 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse47 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse47)))) .cse5 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse48 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse48))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse48) |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse49 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse49 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse49 0))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse51 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse50 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse51))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse50 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse50 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse51) 0))))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse54 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse52 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse54)) (.cse53 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse54))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse52 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse52 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse53 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse53 0))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (or .cse9 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse55 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse55 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse55 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse55)))))))))) is different from false [2022-07-12 03:15:39,354 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:39,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 58 [2022-07-12 03:15:39,361 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:39,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-07-12 03:15:39,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:39,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 84 treesize of output 78 [2022-07-12 03:15:39,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:39,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:39,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 [2022-07-12 03:15:39,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-12 03:15:39,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:39,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2022-07-12 03:15:39,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 03:15:39,394 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:39,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-07-12 03:15:39,401 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:39,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 1 [2022-07-12 03:15:39,408 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:39,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-12 03:15:39,418 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:39,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2022-07-12 03:15:39,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:39,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:39,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-07-12 03:15:39,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:39,429 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:39,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-07-12 03:15:39,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:39,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-12 03:15:39,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 03:15:39,453 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:39,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 58 [2022-07-12 03:15:39,460 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:39,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-07-12 03:15:39,465 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:39,474 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:39,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 81 [2022-07-12 03:15:39,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:39,489 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:39,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2022-07-12 03:15:39,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:15:39,503 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:39,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 40 [2022-07-12 03:15:39,558 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:39,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-07-12 03:15:39,564 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:39,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2022-07-12 03:15:39,567 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:39,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:39,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 43 [2022-07-12 03:15:39,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 4 [2022-07-12 03:15:39,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:15:39,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 03:15:39,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-12 03:15:39,589 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:39,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-07-12 03:15:39,595 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:39,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 1 [2022-07-12 03:15:39,599 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:15:39,603 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:15:39,608 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:39,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 1 [2022-07-12 03:15:39,612 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:15:39,619 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:39,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 1 [2022-07-12 03:15:39,623 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:15:39,629 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:39,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 1 [2022-07-12 03:15:39,632 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:15:39,639 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:39,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 1 [2022-07-12 03:15:39,646 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:39,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-07-12 03:15:39,652 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:39,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-07-12 03:15:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-12 03:15:39,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097887309] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:15:39,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:15:39,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 36 [2022-07-12 03:15:39,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850943084] [2022-07-12 03:15:39,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:15:39,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-12 03:15:39,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:39,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-12 03:15:39,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=891, Unknown=4, NotChecked=252, Total=1260 [2022-07-12 03:15:39,793 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:40,123 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse72 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse73 (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse0 (not .cse73)) (.cse12 (not .cse72)) (.cse14 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse19 (and .cse73 .cse72)) (.cse27 (and (= |c_ULTIMATE.start_main_~a~0#1.offset| (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) .cse72)) (.cse1 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse71 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse70 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse71))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse70 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse71) |c_ULTIMATE.start_main_~p~0#1.offset|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse70)))))))) (.cse2 (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse69 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse68 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse69))) (or (= .cse68 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse69) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse68))))) .cse9)) (.cse3 (or .cse9 (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse67 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse65 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse67)) (.cse66 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse64 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse67))) (or (= .cse64 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse65 .cse66) (= .cse65 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_11 .cse66) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse64))))))) (.cse4 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse63 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse62 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse63)) (.cse61 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse63))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse61 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse62 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse62 |c_ULTIMATE.start_main_~p~0#1.offset|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse61)))))))) (.cse5 (or .cse9 (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse58 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse60 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse59 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse58))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse58) |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse59 .cse60) (= .cse59 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_11 .cse60) 0)) (= .cse59 0)))))))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse6 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse8) (not (= (select v_arrayElimArr_11 .cse8) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse6))))) .cse9) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse10))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) .cse12) (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= .cse13 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse14 0) (= .cse13 |c_ULTIMATE.start_main_~p~0#1.base|) (or .cse0 (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) (= .cse15 0)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse16 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= .cse17 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse17)))))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse18 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse18 0))))))) .cse12 .cse9) .cse12 (or .cse19 (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse20 0)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (or (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse21 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse21 0)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse23 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse22 |c_ULTIMATE.start_main_~p~0#1.offset|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23)))))))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse24 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= .cse24 0)))) .cse9) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse26 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26))) (or (= .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse25 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26)))))) .cse9)) .cse27) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse28 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse28)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse29 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse29)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse31 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse32 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse32 0)))))))) (or (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse33 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse33 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse34 0)))))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse35 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse35 0)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse36 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse36)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse37 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse37)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse38 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))))) .cse9))) .cse9 (= .cse14 |c_ULTIMATE.start_main_~p~0#1.offset|) (or .cse19 (and (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse40 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse40))) (or (= .cse39 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse39 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse40) 0))))) .cse9) (or .cse27 (and .cse1 .cse2 (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse41 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse41))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse41) |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse42 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= .cse42 0))))) .cse9) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse43 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse44 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse43))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse43) |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse44 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse44 0))))))))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse48 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse48)) (.cse47 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse46 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse48))) (or (= .cse45 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse45 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse46 .cse47) (not (= (select v_arrayElimArr_11 .cse47) 0)) (= .cse46 0))))) .cse9) .cse3 .cse4 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse49 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse49 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse49)))) .cse5 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse50 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse51 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse50))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse50) |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse51 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse51 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse51 0))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse53 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse52 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse53))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse52 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse52 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse53) 0))))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse56 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse54 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse56)) (.cse55 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse56))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse54 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse54 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse55 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse55 0))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (or .cse9 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse57 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse57 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse57 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse57)))))))))) is different from false [2022-07-12 03:15:40,318 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse72 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse73 (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse0 (not .cse73)) (.cse12 (not .cse72)) (.cse14 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse19 (and .cse73 .cse72)) (.cse27 (and (= |c_ULTIMATE.start_main_~a~0#1.offset| (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) .cse72)) (.cse1 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse71 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse70 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse71))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse70 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse71) |c_ULTIMATE.start_main_~p~0#1.offset|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse70)))))))) (.cse2 (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse69 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse68 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse69))) (or (= .cse68 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse69) |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse68))))) .cse9)) (.cse3 (or .cse9 (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse67 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse65 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse67)) (.cse66 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse64 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse67))) (or (= .cse64 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse65 .cse66) (= .cse65 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_11 .cse66) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse64))))))) (.cse4 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse63 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse62 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse63)) (.cse61 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse63))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse61 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse62 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse62 |c_ULTIMATE.start_main_~p~0#1.offset|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse61)))))))) (.cse5 (or .cse9 (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse58 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse60 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse59 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse58))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse58) |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse59 .cse60) (= .cse59 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_11 .cse60) 0)) (= .cse59 0)))))))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse6 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse8) (not (= (select v_arrayElimArr_11 .cse8) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse6))))) .cse9) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse10))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) .cse12) (not (= .cse13 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse14 0) (= .cse13 |c_ULTIMATE.start_main_~p~0#1.base|) (or .cse0 (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|))) (= .cse15 0)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse16 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (not (= .cse17 |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse17)))))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse18 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse18 0))))))) .cse12 .cse9) .cse12 (or .cse19 (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse20 0)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (or (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse21 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse21 0)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse23 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse22 |c_ULTIMATE.start_main_~p~0#1.offset|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23)))))))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse24 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= .cse24 0)))) .cse9) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse26 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26))) (or (= .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse25 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26)))))) .cse9)) .cse27) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse28 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse28)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse29 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse29)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse31 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse32 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse32 0)))))))) (or (and (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse33 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse33 |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_77| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse34 0)))))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_598 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse35 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse35 0)))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse36 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse36)))) (forall ((v_ArrVal_598 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int)) (or (forall ((v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse37 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse37)))) (forall ((v_ArrVal_598 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse38 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))))))))) .cse9))) .cse9 (= .cse14 |c_ULTIMATE.start_main_~p~0#1.offset|) (or .cse19 (and (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse40 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse40))) (or (= .cse39 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse39 |c_ULTIMATE.start_main_~p~0#1.base|) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse40) 0))))) .cse9) (or .cse27 (and .cse1 .cse2 (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse41 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse41))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse41) |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse42 |c_ULTIMATE.start_main_~p~0#1.offset|) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (= .cse42 0))))) .cse9) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse43 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse44 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse43))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse43) |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse44 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse44 0))))))))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse48 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse48)) (.cse47 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse46 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse48))) (or (= .cse45 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse45 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse46 .cse47) (not (= (select v_arrayElimArr_11 .cse47) 0)) (= .cse46 0))))) .cse9) .cse3 .cse4 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse49 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse49 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse49)))) .cse5 (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse50 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse51 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse50))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse50) |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse51 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse51 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse51 0))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse53 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse52 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse53))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse52 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse52 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse53) 0))))))) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse56 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse54 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse56)) (.cse55 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse56))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_77| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse54 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse54 |c_ULTIMATE.start_main_~p~0#1.base|) (= .cse55 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (= .cse55 0))))) (not (= (select v_arrayElimArr_11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (or .cse9 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int))) (let ((.cse57 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse57 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse57 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_77| .cse57)))))))))) is different from false [2022-07-12 03:15:40,342 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse1 0) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_592 Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse3 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 v_ArrVal_592)))) (store .cse6 |v_ULTIMATE.start_main_~p~0#1.base_77| (store (select .cse6 |v_ULTIMATE.start_main_~p~0#1.base_77|) 0 3))))) (let ((.cse2 (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse3 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 0)) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (= .cse2 3) (= .cse2 1) (not (= (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))))) is different from false [2022-07-12 03:15:40,349 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~t~0#1.base|)) (= .cse1 0) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_77| Int) (v_ArrVal_592 Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse3 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 v_ArrVal_592)))) (store .cse6 |v_ULTIMATE.start_main_~p~0#1.base_77| (store (select .cse6 |v_ULTIMATE.start_main_~p~0#1.base_77|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse2 (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse3 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_593) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_77| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (= 3 .cse2) (not (= (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= .cse2 1)))))))) is different from false [2022-07-12 03:15:42,354 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (let ((.cse2 (= (select (select |c_#memory_int| .cse1) .cse6) 1)) (.cse3 (select (select |c_#memory_$Pointer$.offset| .cse1) (+ .cse6 4)))) (and (let ((.cse0 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse0) (and (not (= .cse1 |c_ULTIMATE.start_main_~p~0#1.base|)) (not .cse0) .cse2))) (not (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse3 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (forall ((v_ArrVal_597 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (let ((.cse4 (let ((.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))) (or (= .cse4 1) (= .cse4 3)))) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (= .cse6 0) .cse2 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse3)))) is different from false [2022-07-12 03:15:42,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:42,524 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2022-07-12 03:15:42,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 03:15:42,525 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-12 03:15:42,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:42,525 INFO L225 Difference]: With dead ends: 67 [2022-07-12 03:15:42,526 INFO L226 Difference]: Without dead ends: 63 [2022-07-12 03:15:42,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=193, Invalid=1394, Unknown=9, NotChecked=756, Total=2352 [2022-07-12 03:15:42,527 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:42,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 198 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 201 Invalid, 0 Unknown, 147 Unchecked, 0.1s Time] [2022-07-12 03:15:42,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-12 03:15:42,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-07-12 03:15:42,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-07-12 03:15:42,537 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 27 [2022-07-12 03:15:42,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:42,538 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-07-12 03:15:42,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:42,538 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-07-12 03:15:42,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 03:15:42,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:42,538 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:15:42,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-12 03:15:42,751 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,SelfDestructingSolverStorable13 [2022-07-12 03:15:42,751 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:42,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:42,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1961532986, now seen corresponding path program 2 times [2022-07-12 03:15:42,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:42,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678907589] [2022-07-12 03:15:42,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:42,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:43,015 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:43,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:43,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678907589] [2022-07-12 03:15:43,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678907589] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:43,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457318285] [2022-07-12 03:15:43,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:15:43,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:43,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:43,018 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) [2022-07-12 03:15:43,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 03:15:43,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:15:43,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:15:43,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-12 03:15:43,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:43,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:15:43,143 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:43,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 03:15:43,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:15:43,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:15:43,228 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:15:43,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-07-12 03:15:43,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:15:43,245 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:15:43,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-07-12 03:15:43,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:15:43,332 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:15:43,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 92 [2022-07-12 03:15:43,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:43,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2022-07-12 03:15:43,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2022-07-12 03:15:43,423 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:15:43,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 56 [2022-07-12 03:15:43,438 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-12 03:15:43,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-07-12 03:15:43,461 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-07-12 03:15:43,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 47 [2022-07-12 03:15:43,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-12 03:15:43,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2022-07-12 03:15:43,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 101 treesize of output 77 [2022-07-12 03:15:43,804 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-07-12 03:15:43,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 76 [2022-07-12 03:15:44,029 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:44,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2022-07-12 03:15:44,049 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:44,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:46,192 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (not (= 2 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (or (= 2 .cse0) (= 3 .cse0)))))) is different from false [2022-07-12 03:15:46,235 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_682 Int) (|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_682)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_87| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_87|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse1 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (= .cse1 3) (= .cse1 2)))))) is different from false [2022-07-12 03:15:46,268 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_682 Int) (|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_682)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_87| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_87|) 0 3))))) (let ((.cse1 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 0)) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (not (= 2 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= 3 .cse1) (= 2 .cse1)))))) is different from false [2022-07-12 03:15:46,308 INFO L356 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2022-07-12 03:15:46,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1842 treesize of output 1780 [2022-07-12 03:15:46,354 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:46,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 823 treesize of output 726 [2022-07-12 03:15:46,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-12 03:15:47,144 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse0)))) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse1) (= .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse2) (= .cse2 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_30 (Array Int Int))) (or (forall ((v_ArrVal_686 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse3) (= .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse3 0)))) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse4) (= .cse4 0) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse5 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))))) (or (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_arrayElimArr_30 (Array Int Int))) (or (forall ((v_ArrVal_686 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse6) (= .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse6 0)))) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse8 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse7) (= .cse7 .cse8) (= .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_30 .cse8) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse9 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse10)))) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse11) (= .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse13 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse12) (= .cse12 .cse13) (= .cse12 0) (not (= (select v_arrayElimArr_30 .cse13) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse14) (= .cse14 0) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse15 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse15 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_ArrVal_688 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_683 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse16) (= .cse16 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse17) (= .cse17 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse18) (= .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse19) (= .cse19 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse20) (= .cse20 0) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse21 0) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse23 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse22) (= .cse22 .cse23) (not (= (select v_arrayElimArr_30 .cse23) 0))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse24))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse25) (= .cse25 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse27 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse26) (= .cse26 .cse27) (= .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_30 .cse27) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse28) (= .cse28 0) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse29 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse29 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse31 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse30) (= .cse30 .cse31) (not (= (select v_arrayElimArr_30 .cse31) 0))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse32 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse32)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse33) (= .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse34 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse34) (= .cse34 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse35 0) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse37 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse36) (= .cse36 .cse37) (= .cse36 0) (not (= (select v_arrayElimArr_30 .cse37) 0)))))))) is different from false [2022-07-12 03:15:47,964 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:47,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2022-07-12 03:15:47,969 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:47,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-07-12 03:15:47,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:47,979 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:47,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 58 [2022-07-12 03:15:47,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:47,991 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:47,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2022-07-12 03:15:47,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:15:48,015 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:48,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2022-07-12 03:15:48,059 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:48,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-07-12 03:15:48,065 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:48,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-07-12 03:15:48,072 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:48,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-07-12 03:15:48,079 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:48,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-07-12 03:15:48,085 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:48,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-07-12 03:15:48,095 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:48,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 1 [2022-07-12 03:15:48,106 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:48,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 1 [2022-07-12 03:15:48,116 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:48,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 1 [2022-07-12 03:15:48,126 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:48,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-07-12 03:15:48,133 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:48,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 1 [2022-07-12 03:15:48,141 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:15:48,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 1 [2022-07-12 03:15:48,154 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:48,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2022-07-12 03:15:48,162 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:48,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2022-07-12 03:15:48,165 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:48,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:48,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-07-12 03:15:48,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:48,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:48,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:15:48,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 61 treesize of output 43 [2022-07-12 03:15:48,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:15:48,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:15:48,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-12 03:15:48,192 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:48,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 56 [2022-07-12 03:15:48,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:15:48,210 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:48,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 77 [2022-07-12 03:15:48,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-07-12 03:15:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-12 03:15:48,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457318285] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:15:48,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:15:48,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 36 [2022-07-12 03:15:48,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183394850] [2022-07-12 03:15:48,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:15:48,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-12 03:15:48,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:15:48,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-12 03:15:48,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=890, Unknown=4, NotChecked=252, Total=1260 [2022-07-12 03:15:48,406 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:48,605 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse27 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse0)))) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse1) (= .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse2) (= .cse2 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (not (= .cse3 |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_30 (Array Int Int))) (or (forall ((v_ArrVal_686 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse4) (= .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse4 0)))) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse5) (= .cse5 0) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|))) (= .cse6 0) (= .cse3 |c_ULTIMATE.start_main_~p~0#1.base|) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse7 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))))) (or (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_arrayElimArr_30 (Array Int Int))) (or (forall ((v_ArrVal_686 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse8) (= .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse8 0)))) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse10 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse9) (= .cse9 .cse10) (= .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_30 .cse10) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse11 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse12)))) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse13) (= .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse15 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse14) (= .cse14 .cse15) (= .cse14 0) (not (= (select v_arrayElimArr_30 .cse15) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse16) (= .cse16 0) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse17 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse17 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((v_ArrVal_688 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_683 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse18 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse18) (= .cse18 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse19) (= .cse19 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse20) (= .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse21) (= .cse21 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse22) (= .cse22 0) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse23 0) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse25 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse24) (= .cse24 .cse25) (not (= (select v_arrayElimArr_30 .cse25) 0))))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse26 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse26))))))) .cse27) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse28) (= .cse28 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse29) (= .cse29 .cse30) (= .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_30 .cse30) 0))))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse31) (= .cse31 0) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse32 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse32 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse34 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse33) (= .cse33 .cse34) (not (= (select v_arrayElimArr_30 .cse34) 0))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse35 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse35)))))) .cse27 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse36) (= .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse37 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_87| .cse37) (= .cse37 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (or (= .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse38 0) (not (= (select v_arrayElimArr_30 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_87| Int)) (or (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_683 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |v_ULTIMATE.start_main_~p~0#1.base_87| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_30 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (.cse40 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse39) (= .cse39 .cse40) (= .cse39 0) (not (= (select v_arrayElimArr_30 .cse40) 0))))))) (= .cse6 |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-07-12 03:15:48,647 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse1 0) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_682 Int) (|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse2 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 v_ArrVal_682)))) (store .cse6 |v_ULTIMATE.start_main_~p~0#1.base_87| (store (select .cse6 |v_ULTIMATE.start_main_~p~0#1.base_87|) 0 3))))) (let ((.cse3 (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 0)) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (not (= 2 (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= 3 .cse3) (= 2 .cse3)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-07-12 03:15:48,658 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (and (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~t~0#1.base|)) (= .cse1 0) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_682 Int) (|v_ULTIMATE.start_main_~p~0#1.base_87| Int) (v_ArrVal_683 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse2 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 v_ArrVal_682)))) (store .cse6 |v_ULTIMATE.start_main_~p~0#1.base_87| (store (select .cse6 |v_ULTIMATE.start_main_~p~0#1.base_87|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse3 (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_683) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_87| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))) (or (not (= (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (= .cse3 3) (= .cse3 2)))))) (= |c_ULTIMATE.start_main_~t~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-07-12 03:15:50,667 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| .cse1) 4)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4)) (.cse5 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse3 (select |c_#memory_int| .cse1))) (and (= .cse0 0) (not (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (let ((.cse2 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse2) (and (not (= .cse1 |c_ULTIMATE.start_main_~p~0#1.base|)) (not .cse2) (= (select .cse3 .cse4) 2) .cse5))) (= .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse4 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (not (= 2 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse6 (let ((.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_688) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))))) (or (= 2 .cse6) (= 3 .cse6)))))) .cse5 (= 2 (select .cse3 0))))) is different from false [2022-07-12 03:15:50,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:15:50,948 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-07-12 03:15:50,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 03:15:50,948 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-12 03:15:50,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:15:50,949 INFO L225 Difference]: With dead ends: 76 [2022-07-12 03:15:50,949 INFO L226 Difference]: Without dead ends: 72 [2022-07-12 03:15:50,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=184, Invalid=1400, Unknown=8, NotChecked=664, Total=2256 [2022-07-12 03:15:50,950 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 278 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:15:50,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 250 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 221 Invalid, 0 Unknown, 278 Unchecked, 0.1s Time] [2022-07-12 03:15:50,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-12 03:15:50,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2022-07-12 03:15:50,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-07-12 03:15:50,964 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 27 [2022-07-12 03:15:50,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:15:50,964 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-07-12 03:15:50,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:15:50,964 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-07-12 03:15:50,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 03:15:50,965 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:15:50,965 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:15:50,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 03:15:51,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 03:15:51,180 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:15:51,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:15:51,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1736025984, now seen corresponding path program 4 times [2022-07-12 03:15:51,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:15:51,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939243965] [2022-07-12 03:15:51,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:15:51,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:15:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:15:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:51,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:15:51,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939243965] [2022-07-12 03:15:51,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939243965] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:15:51,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726690613] [2022-07-12 03:15:51,527 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 03:15:51,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:15:51,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:15:51,528 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) [2022-07-12 03:15:51,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 03:15:51,674 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 03:15:51,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:15:51,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-12 03:15:51,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:15:51,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:15:51,732 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:15:51,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 03:15:51,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:15:51,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:15:51,852 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:15:51,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 03:15:51,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:15:51,866 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:15:51,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-12 03:15:51,901 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-12 03:15:51,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 03:15:51,947 INFO L356 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-07-12 03:15:51,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 75 [2022-07-12 03:15:51,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 82 [2022-07-12 03:15:52,018 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-12 03:15:52,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 132 [2022-07-12 03:15:52,042 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-12 03:15:52,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 121 [2022-07-12 03:15:52,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2022-07-12 03:15:52,189 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-07-12 03:15:52,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 58 [2022-07-12 03:15:52,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 19 [2022-07-12 03:15:52,231 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:15:52,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2022-07-12 03:15:52,233 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:15:52,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:15:52,328 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 205 [2022-07-12 03:15:52,550 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (forall ((v_ArrVal_777 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_29| Int) (v_ArrVal_774 (Array Int Int))) (or (= |v_ULTIMATE.start_main_~t~0#1.base_29| |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~t~0#1.base_29| (let ((.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2 |v_ULTIMATE.start_main_~t~0#1.base_29|)) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_777))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2 0)) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_774) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0)))) (or (forall ((v_ArrVal_777 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_29| Int) (v_ArrVal_774 (Array Int Int))) (or (= |v_ULTIMATE.start_main_~t~0#1.base_29| (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 |v_ULTIMATE.start_main_~t~0#1.base_29|)) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_777))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5 0)) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_774) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 4)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0)))) .cse6) (forall ((v_ArrVal_777 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_29| Int) (v_ArrVal_774 (Array Int Int))) (or (= |v_ULTIMATE.start_main_~t~0#1.base_29| |c_ULTIMATE.start_main_~a~0#1.base|) (= (let ((.cse8 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse8 0)) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_774)) (.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse7 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse8 |v_ULTIMATE.start_main_~t~0#1.base_29|)) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_777) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)) (+ (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) 4)))) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0)))) (or (forall ((v_ArrVal_777 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_29| Int) (v_ArrVal_774 (Array Int Int))) (or (= (let ((.cse11 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse11 0)) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_774)) (.cse12 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse10 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse11 |v_ULTIMATE.start_main_~t~0#1.base_29|)) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_777) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12)) (+ (select (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) .cse12) 4)))) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0)))) .cse6))) is different from false [2022-07-12 03:15:52,566 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2022-07-12 03:15:52,572 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2022-07-12 03:15:52,585 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2022-07-12 03:15:52,590 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2022-07-12 03:15:52,605 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-07-12 03:15:52,612 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 64 [2022-07-12 03:15:52,625 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-07-12 03:15:52,631 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 64 [2022-07-12 03:15:52,839 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 86 [2022-07-12 03:15:52,844 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 90 [2022-07-12 03:15:52,852 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:52,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 346 treesize of output 247 [2022-07-12 03:15:53,477 INFO L356 Elim1Store]: treesize reduction 574, result has 48.8 percent of original size [2022-07-12 03:15:53,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 5584 treesize of output 5407 [2022-07-12 03:15:53,647 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:53,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 5054 treesize of output 3558 [2022-07-12 03:15:53,750 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:53,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3436 treesize of output 3044 [2022-07-12 03:15:53,832 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:15:53,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 303 treesize of output 235 [2022-07-12 03:15:54,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 199 [2022-07-12 03:18:44,505 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:18:44,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 82 [2022-07-12 03:18:44,515 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:18:44,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 62 [2022-07-12 03:18:44,600 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:18:44,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 2412 treesize of output 1791 [2022-07-12 03:18:44,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:18:44,631 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:18:44,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2314 treesize of output 1951 [2022-07-12 03:18:44,666 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:18:44,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1942 treesize of output 1494 [2022-07-12 03:18:44,717 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:18:44,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1390 treesize of output 1332 [2022-07-12 03:18:44,821 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:18:44,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 1310 treesize of output 1352 [2022-07-12 03:18:59,469 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:18:59,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 86 [2022-07-12 03:18:59,476 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:18:59,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 90 [2022-07-12 03:18:59,487 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:18:59,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 359 treesize of output 254 [2022-07-12 03:18:59,492 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:18:59,799 INFO L356 Elim1Store]: treesize reduction 222, result has 58.7 percent of original size [2022-07-12 03:18:59,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 2568 treesize of output 2321 [2022-07-12 03:18:59,852 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:18:59,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1143 treesize of output 1095 [2022-07-12 03:18:59,945 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:18:59,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2125 treesize of output 1577 [2022-07-12 03:18:59,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1506 treesize of output 1426 [2022-07-12 03:19:00,038 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:19:00,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1302 treesize of output 1274 [2022-07-12 03:19:17,024 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:19:17,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 82 [2022-07-12 03:19:17,034 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:19:17,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 62 [2022-07-12 03:19:17,097 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:19:17,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 1201 treesize of output 962 [2022-07-12 03:19:17,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:19:17,133 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:19:17,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1228 treesize of output 1057 [2022-07-12 03:19:17,163 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:19:17,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1055 treesize of output 795 [2022-07-12 03:19:17,244 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:19:17,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 688 treesize of output 690 [2022-07-12 03:19:17,322 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:19:17,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 672 treesize of output 728