./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array2_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5317dae 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/array-patterns/array2_pattern.c -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 1a25becec148beba97bef86c2a84619bb26dfafe7c127e8d70246837f0d2d470 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 00:08:08,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:08:08,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:08:08,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:08:08,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:08:08,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:08:08,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:08:08,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:08:08,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:08:08,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:08:08,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:08:08,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:08:08,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:08:08,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:08:08,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:08:08,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:08:08,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:08:08,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:08:08,414 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:08:08,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:08:08,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:08:08,418 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:08:08,419 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:08:08,420 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:08:08,425 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:08:08,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:08:08,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:08:08,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:08:08,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:08:08,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:08:08,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:08:08,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:08:08,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:08:08,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:08:08,449 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:08:08,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:08:08,450 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:08:08,450 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:08:08,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:08:08,451 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:08:08,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:08:08,463 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 00:08:08,514 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:08:08,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:08:08,515 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:08:08,515 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:08:08,516 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:08:08,516 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:08:08,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:08:08,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:08:08,517 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:08:08,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:08:08,517 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:08:08,517 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 00:08:08,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:08:08,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:08:08,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:08:08,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:08:08,518 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:08:08,518 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:08:08,518 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:08:08,518 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:08:08,519 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:08:08,519 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:08:08,519 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:08:08,519 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:08:08,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:08:08,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:08:08,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:08:08,520 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:08:08,520 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 00:08:08,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 00:08:08,520 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:08:08,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:08:08,525 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:08:08,526 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:08:08,526 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:08:08,526 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 1a25becec148beba97bef86c2a84619bb26dfafe7c127e8d70246837f0d2d470 [2023-02-16 00:08:08,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:08:08,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:08:08,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:08:08,910 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:08:08,910 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:08:08,911 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array2_pattern.c [2023-02-16 00:08:10,408 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:08:10,683 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:08:10,686 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array2_pattern.c [2023-02-16 00:08:10,691 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4682e5c8/f916eb0b669d41178f088f9eb39df502/FLAGd33a733b0 [2023-02-16 00:08:10,712 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4682e5c8/f916eb0b669d41178f088f9eb39df502 [2023-02-16 00:08:10,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:08:10,716 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:08:10,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:08:10,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:08:10,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:08:10,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:08:10" (1/1) ... [2023-02-16 00:08:10,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@169cd882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:08:10, skipping insertion in model container [2023-02-16 00:08:10,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:08:10" (1/1) ... [2023-02-16 00:08:10,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:08:10,769 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:08:10,980 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array2_pattern.c[1322,1335] [2023-02-16 00:08:11,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:08:11,023 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:08:11,047 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array2_pattern.c[1322,1335] [2023-02-16 00:08:11,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:08:11,089 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:08:11,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:08:11 WrapperNode [2023-02-16 00:08:11,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:08:11,091 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:08:11,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:08:11,091 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:08:11,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:08:11" (1/1) ... [2023-02-16 00:08:11,124 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:08:11" (1/1) ... [2023-02-16 00:08:11,157 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2023-02-16 00:08:11,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:08:11,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:08:11,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:08:11,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:08:11,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:08:11" (1/1) ... [2023-02-16 00:08:11,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:08:11" (1/1) ... [2023-02-16 00:08:11,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:08:11" (1/1) ... [2023-02-16 00:08:11,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:08:11" (1/1) ... [2023-02-16 00:08:11,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:08:11" (1/1) ... [2023-02-16 00:08:11,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:08:11" (1/1) ... [2023-02-16 00:08:11,202 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:08:11" (1/1) ... [2023-02-16 00:08:11,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:08:11" (1/1) ... [2023-02-16 00:08:11,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:08:11,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:08:11,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:08:11,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:08:11,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:08:11" (1/1) ... [2023-02-16 00:08:11,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:08:11,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:08:11,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-16 00:08:11,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-16 00:08:11,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:08:11,344 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-16 00:08:11,344 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-16 00:08:11,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 00:08:11,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 00:08:11,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 00:08:11,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:08:11,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:08:11,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 00:08:11,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 00:08:11,420 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:08:11,426 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:08:11,661 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:08:11,671 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:08:11,671 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-16 00:08:11,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:08:11 BoogieIcfgContainer [2023-02-16 00:08:11,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:08:11,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:08:11,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:08:11,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:08:11,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:08:10" (1/3) ... [2023-02-16 00:08:11,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5dad56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:08:11, skipping insertion in model container [2023-02-16 00:08:11,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:08:11" (2/3) ... [2023-02-16 00:08:11,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5dad56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:08:11, skipping insertion in model container [2023-02-16 00:08:11,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:08:11" (3/3) ... [2023-02-16 00:08:11,698 INFO L112 eAbstractionObserver]: Analyzing ICFG array2_pattern.c [2023-02-16 00:08:11,709 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:08:11,717 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 00:08:11,761 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:08:11,766 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5b80fdf8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:08:11,767 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 00:08:11,770 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 00:08:11,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 00:08:11,775 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:08:11,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:08:11,776 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:08:11,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:08:11,781 INFO L85 PathProgramCache]: Analyzing trace with hash -800294020, now seen corresponding path program 1 times [2023-02-16 00:08:11,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:08:11,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389833880] [2023-02-16 00:08:11,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:08:11,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:08:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:08:11,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 00:08:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:08:12,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:08:12,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:08:12,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389833880] [2023-02-16 00:08:12,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389833880] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:08:12,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:08:12,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 00:08:12,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017266312] [2023-02-16 00:08:12,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:08:12,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 00:08:12,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:08:12,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 00:08:12,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 00:08:12,089 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:08:12,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:08:12,115 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2023-02-16 00:08:12,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 00:08:12,125 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-02-16 00:08:12,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:08:12,130 INFO L225 Difference]: With dead ends: 47 [2023-02-16 00:08:12,130 INFO L226 Difference]: Without dead ends: 21 [2023-02-16 00:08:12,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 00:08:12,135 INFO L413 NwaCegarLoop]: 28 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, 28 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 [2023-02-16 00:08:12,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:08:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-16 00:08:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-16 00:08:12,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 00:08:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-02-16 00:08:12,164 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2023-02-16 00:08:12,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:08:12,165 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-02-16 00:08:12,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 00:08:12,165 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-02-16 00:08:12,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 00:08:12,167 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:08:12,167 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:08:12,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 00:08:12,167 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:08:12,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:08:12,168 INFO L85 PathProgramCache]: Analyzing trace with hash -952637313, now seen corresponding path program 1 times [2023-02-16 00:08:12,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:08:12,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399658434] [2023-02-16 00:08:12,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:08:12,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:08:12,216 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:08:12,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [198661134] [2023-02-16 00:08:12,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:08:12,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:08:12,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:08:12,223 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:08:12,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 00:08:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:08:12,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 00:08:12,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:08:12,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:08:12,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:08:12,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:08:12,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399658434] [2023-02-16 00:08:12,406 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:08:12,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198661134] [2023-02-16 00:08:12,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198661134] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:08:12,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:08:12,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 00:08:12,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233607440] [2023-02-16 00:08:12,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:08:12,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:08:12,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:08:12,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:08:12,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:08:12,426 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 00:08:12,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:08:12,453 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2023-02-16 00:08:12,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 00:08:12,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-02-16 00:08:12,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:08:12,458 INFO L225 Difference]: With dead ends: 26 [2023-02-16 00:08:12,458 INFO L226 Difference]: Without dead ends: 22 [2023-02-16 00:08:12,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 00:08:12,461 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:08:12,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:08:12,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-16 00:08:12,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-16 00:08:12,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 00:08:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-02-16 00:08:12,486 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 22 [2023-02-16 00:08:12,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:08:12,486 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-02-16 00:08:12,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 00:08:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-02-16 00:08:12,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 00:08:12,487 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:08:12,488 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:08:12,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-16 00:08:12,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:08:12,692 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:08:12,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:08:12,693 INFO L85 PathProgramCache]: Analyzing trace with hash -603190335, now seen corresponding path program 1 times [2023-02-16 00:08:12,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:08:12,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422200153] [2023-02-16 00:08:12,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:08:12,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:08:12,739 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:08:12,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1282907493] [2023-02-16 00:08:12,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:08:12,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:08:12,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:08:12,744 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:08:12,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 00:08:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:08:12,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 00:08:12,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:08:12,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:08:12,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:08:12,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:08:12,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422200153] [2023-02-16 00:08:12,957 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:08:12,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282907493] [2023-02-16 00:08:12,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282907493] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:08:12,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:08:12,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 00:08:12,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701713489] [2023-02-16 00:08:12,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:08:12,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 00:08:12,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:08:12,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 00:08:12,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-16 00:08:12,959 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 00:08:13,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:08:13,031 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2023-02-16 00:08:13,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 00:08:13,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-02-16 00:08:13,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:08:13,032 INFO L225 Difference]: With dead ends: 41 [2023-02-16 00:08:13,032 INFO L226 Difference]: Without dead ends: 25 [2023-02-16 00:08:13,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-16 00:08:13,033 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:08:13,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 68 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:08:13,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-16 00:08:13,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-02-16 00:08:13,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 00:08:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-02-16 00:08:13,043 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 24 [2023-02-16 00:08:13,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:08:13,043 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-02-16 00:08:13,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 00:08:13,043 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-02-16 00:08:13,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 00:08:13,044 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:08:13,044 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:08:13,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 00:08:13,249 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,SelfDestructingSolverStorable2 [2023-02-16 00:08:13,250 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:08:13,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:08:13,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1366149955, now seen corresponding path program 1 times [2023-02-16 00:08:13,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:08:13,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817377512] [2023-02-16 00:08:13,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:08:13,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:08:13,307 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:08:13,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [198934895] [2023-02-16 00:08:13,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:08:13,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:08:13,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:08:13,316 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:08:13,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 00:08:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:08:13,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 56 conjunts are in the unsatisfiable core [2023-02-16 00:08:13,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:08:13,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-16 00:08:13,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:08:13,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2023-02-16 00:08:13,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2023-02-16 00:08:13,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-02-16 00:08:13,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-02-16 00:08:14,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:08:14,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 162 [2023-02-16 00:08:14,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 154 [2023-02-16 00:08:14,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:08:14,294 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:08:14,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 197 [2023-02-16 00:08:14,309 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:08:14,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2023-02-16 00:08:14,342 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:08:14,547 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:08:14,549 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:08:14,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 14 [2023-02-16 00:08:14,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:08:14,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:08:14,835 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (mod (+ (* |c_ULTIMATE.start_main_~index~0#1| 4294967295) c_~ARR_SIZE~0 4294967295) 4294967296))) (let ((.cse5 (<= .cse8 2147483647)) (.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse10 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |c_ULTIMATE.start_main_~index~0#1| 4)))) (store .cse9 .cse10 (+ (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~index~0#1|) (select .cse9 .cse10)))))) (.cse3 (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~index~0#1|)) (.cse4 (* .cse8 4))) (and (or (forall ((v_ArrVal_105 (Array Int Int)) (v_ArrVal_108 (Array Int Int))) (= (let ((.cse0 (let ((.cse2 (+ .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse2 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_105) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse2) .cse3))))) (+ (select .cse0 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1| (select (select (store .cse1 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse0) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) 0)) (not .cse5)) (or .cse5 (forall ((v_ArrVal_105 (Array Int Int)) (v_ArrVal_108 (Array Int Int))) (= (let ((.cse6 (let ((.cse7 (+ .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse7 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_105) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse7) .cse3))))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse6) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (select .cse6 |c_ULTIMATE.start_main_~#array2~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1|)) 0)))))) is different from false [2023-02-16 00:08:19,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:08:19,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817377512] [2023-02-16 00:08:19,608 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:08:19,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198934895] [2023-02-16 00:08:19,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198934895] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:08:19,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-16 00:08:19,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2023-02-16 00:08:19,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910294416] [2023-02-16 00:08:19,608 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-16 00:08:19,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-16 00:08:19,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:08:19,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-16 00:08:19,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=369, Unknown=2, NotChecked=40, Total=506 [2023-02-16 00:08:19,622 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 00:08:23,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:08:23,509 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2023-02-16 00:08:23,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-16 00:08:23,511 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2023-02-16 00:08:23,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:08:23,512 INFO L225 Difference]: With dead ends: 56 [2023-02-16 00:08:23,512 INFO L226 Difference]: Without dead ends: 52 [2023-02-16 00:08:23,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=214, Invalid=780, Unknown=2, NotChecked=60, Total=1056 [2023-02-16 00:08:23,515 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 93 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-16 00:08:23,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 93 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-16 00:08:23,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-16 00:08:23,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2023-02-16 00:08:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 00:08:23,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2023-02-16 00:08:23,545 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 26 [2023-02-16 00:08:23,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:08:23,545 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2023-02-16 00:08:23,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 00:08:23,546 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2023-02-16 00:08:23,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-16 00:08:23,547 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:08:23,547 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:08:23,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 00:08:23,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:08:23,762 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:08:23,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:08:23,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1336652411, now seen corresponding path program 2 times [2023-02-16 00:08:23,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:08:23,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932998696] [2023-02-16 00:08:23,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:08:23,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:08:23,783 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:08:23,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1205889521] [2023-02-16 00:08:23,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:08:23,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:08:23,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:08:23,809 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:08:23,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 00:08:23,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:08:23,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:08:23,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:08:23,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:08:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:08:24,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:08:24,742 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:08:24,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:08:24,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932998696] [2023-02-16 00:08:24,743 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:08:24,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205889521] [2023-02-16 00:08:24,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205889521] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:08:24,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:08:24,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-16 00:08:24,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100987021] [2023-02-16 00:08:24,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:08:24,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 00:08:24,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:08:24,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 00:08:24,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-16 00:08:24,744 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 00:08:25,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:08:25,421 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2023-02-16 00:08:25,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:08:25,423 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2023-02-16 00:08:25,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:08:25,423 INFO L225 Difference]: With dead ends: 55 [2023-02-16 00:08:25,423 INFO L226 Difference]: Without dead ends: 37 [2023-02-16 00:08:25,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-02-16 00:08:25,424 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 45 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 00:08:25,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 86 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 00:08:25,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-16 00:08:25,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2023-02-16 00:08:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 00:08:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-02-16 00:08:25,441 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 28 [2023-02-16 00:08:25,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:08:25,442 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-02-16 00:08:25,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 00:08:25,442 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-02-16 00:08:25,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-16 00:08:25,447 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:08:25,447 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:08:25,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-16 00:08:25,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:08:25,653 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:08:25,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:08:25,653 INFO L85 PathProgramCache]: Analyzing trace with hash -178408891, now seen corresponding path program 3 times [2023-02-16 00:08:25,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:08:25,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158023337] [2023-02-16 00:08:25,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:08:25,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:08:25,675 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:08:25,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [631600314] [2023-02-16 00:08:25,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 00:08:25,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:08:25,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:08:25,722 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:08:25,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 00:08:25,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-16 00:08:25,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:08:25,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:08:25,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:08:26,273 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:08:26,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:08:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:08:26,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:08:26,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158023337] [2023-02-16 00:08:26,562 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:08:26,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631600314] [2023-02-16 00:08:26,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631600314] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:08:26,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:08:26,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-16 00:08:26,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125445233] [2023-02-16 00:08:26,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:08:26,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 00:08:26,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:08:26,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 00:08:26,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-16 00:08:26,563 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 00:08:27,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:08:27,160 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2023-02-16 00:08:27,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 00:08:27,161 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2023-02-16 00:08:27,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:08:27,161 INFO L225 Difference]: With dead ends: 36 [2023-02-16 00:08:27,161 INFO L226 Difference]: Without dead ends: 32 [2023-02-16 00:08:27,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-02-16 00:08:27,162 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 34 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 00:08:27,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 48 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 00:08:27,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-16 00:08:27,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-02-16 00:08:27,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 00:08:27,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2023-02-16 00:08:27,166 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 28 [2023-02-16 00:08:27,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:08:27,167 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2023-02-16 00:08:27,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 00:08:27,167 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2023-02-16 00:08:27,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-16 00:08:27,167 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:08:27,167 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:08:27,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-16 00:08:27,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:08:27,380 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:08:27,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:08:27,381 INFO L85 PathProgramCache]: Analyzing trace with hash 400980999, now seen corresponding path program 4 times [2023-02-16 00:08:27,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:08:27,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960020682] [2023-02-16 00:08:27,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:08:27,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:08:27,416 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:08:27,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1391794232] [2023-02-16 00:08:27,437 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 00:08:27,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:08:27,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:08:27,451 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:08:27,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-16 00:08:27,616 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 00:08:27,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:08:27,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 70 conjunts are in the unsatisfiable core [2023-02-16 00:08:27,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:08:27,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-16 00:08:28,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:08:28,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2023-02-16 00:08:28,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-02-16 00:08:28,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-16 00:08:28,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 53 [2023-02-16 00:08:31,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:08:31,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 176 [2023-02-16 00:08:31,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 161 [2023-02-16 00:08:31,631 INFO L321 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2023-02-16 00:08:31,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 137 treesize of output 212 [2023-02-16 00:08:31,849 INFO L321 Elim1Store]: treesize reduction 57, result has 31.3 percent of original size [2023-02-16 00:08:31,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 45 [2023-02-16 00:08:31,923 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:08:34,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 333 treesize of output 291 [2023-02-16 00:08:35,129 INFO L321 Elim1Store]: treesize reduction 42, result has 51.2 percent of original size [2023-02-16 00:08:35,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 253 treesize of output 232 [2023-02-16 00:08:35,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:08:35,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 245 treesize of output 215 [2023-02-16 00:08:36,357 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:08:36,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:08:42,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:08:42,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960020682] [2023-02-16 00:08:42,381 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:08:42,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391794232] [2023-02-16 00:08:42,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391794232] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:08:42,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-16 00:08:42,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2023-02-16 00:08:42,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970991477] [2023-02-16 00:08:42,381 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-16 00:08:42,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-16 00:08:42,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:08:42,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-16 00:08:42,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=685, Unknown=2, NotChecked=0, Total=812 [2023-02-16 00:08:42,383 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 00:08:47,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:08:47,022 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2023-02-16 00:08:47,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-16 00:08:47,024 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2023-02-16 00:08:47,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:08:47,025 INFO L225 Difference]: With dead ends: 55 [2023-02-16 00:08:47,025 INFO L226 Difference]: Without dead ends: 51 [2023-02-16 00:08:47,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=213, Invalid=1117, Unknown=2, NotChecked=0, Total=1332 [2023-02-16 00:08:47,026 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-02-16 00:08:47,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 111 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-02-16 00:08:47,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-16 00:08:47,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2023-02-16 00:08:47,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 00:08:47,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2023-02-16 00:08:47,047 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 30 [2023-02-16 00:08:47,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:08:47,053 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2023-02-16 00:08:47,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 00:08:47,054 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2023-02-16 00:08:47,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-16 00:08:47,055 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:08:47,055 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:08:47,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-16 00:08:47,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:08:47,262 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:08:47,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:08:47,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1151083191, now seen corresponding path program 5 times [2023-02-16 00:08:47,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:08:47,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15125055] [2023-02-16 00:08:47,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:08:47,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:08:47,305 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:08:47,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [459927528] [2023-02-16 00:08:47,319 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-16 00:08:47,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:08:47,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:08:47,321 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:08:47,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-16 00:08:47,410 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-02-16 00:08:47,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:08:47,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 00:08:47,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:08:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:08:48,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:08:48,608 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:08:48,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:08:48,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15125055] [2023-02-16 00:08:48,608 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:08:48,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459927528] [2023-02-16 00:08:48,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459927528] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:08:48,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:08:48,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2023-02-16 00:08:48,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733908334] [2023-02-16 00:08:48,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:08:48,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 00:08:48,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:08:48,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 00:08:48,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-02-16 00:08:48,610 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 00:08:49,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:08:49,658 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2023-02-16 00:08:49,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 00:08:49,658 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2023-02-16 00:08:49,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:08:49,659 INFO L225 Difference]: With dead ends: 79 [2023-02-16 00:08:49,659 INFO L226 Difference]: Without dead ends: 67 [2023-02-16 00:08:49,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2023-02-16 00:08:49,660 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 53 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 00:08:49,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 120 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-16 00:08:49,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-16 00:08:49,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2023-02-16 00:08:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 00:08:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2023-02-16 00:08:49,702 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 32 [2023-02-16 00:08:49,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:08:49,704 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2023-02-16 00:08:49,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 00:08:49,704 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2023-02-16 00:08:49,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-16 00:08:49,707 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:08:49,707 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:08:49,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-16 00:08:49,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:08:49,913 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:08:49,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:08:49,913 INFO L85 PathProgramCache]: Analyzing trace with hash -475590135, now seen corresponding path program 6 times [2023-02-16 00:08:49,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:08:49,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642388220] [2023-02-16 00:08:49,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:08:49,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:08:49,927 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:08:49,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [842296958] [2023-02-16 00:08:49,947 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-16 00:08:49,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:08:49,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:08:49,948 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:08:49,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-16 00:08:50,110 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-02-16 00:08:50,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:08:50,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 00:08:50,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:08:50,819 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:08:50,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:08:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:08:51,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:08:51,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642388220] [2023-02-16 00:08:51,245 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:08:51,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842296958] [2023-02-16 00:08:51,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842296958] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:08:51,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:08:51,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2023-02-16 00:08:51,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050354905] [2023-02-16 00:08:51,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:08:51,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 00:08:51,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:08:51,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 00:08:51,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-02-16 00:08:51,246 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 00:08:52,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:08:52,209 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2023-02-16 00:08:52,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 00:08:52,210 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2023-02-16 00:08:52,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:08:52,210 INFO L225 Difference]: With dead ends: 66 [2023-02-16 00:08:52,210 INFO L226 Difference]: Without dead ends: 62 [2023-02-16 00:08:52,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2023-02-16 00:08:52,211 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 48 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 00:08:52,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 94 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 00:08:52,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-02-16 00:08:52,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2023-02-16 00:08:52,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 00:08:52,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2023-02-16 00:08:52,242 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 32 [2023-02-16 00:08:52,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:08:52,243 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2023-02-16 00:08:52,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 00:08:52,243 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2023-02-16 00:08:52,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-16 00:08:52,245 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:08:52,245 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:08:52,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-16 00:08:52,451 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,SelfDestructingSolverStorable8 [2023-02-16 00:08:52,451 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:08:52,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:08:52,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1722352949, now seen corresponding path program 7 times [2023-02-16 00:08:52,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:08:52,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425097662] [2023-02-16 00:08:52,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:08:52,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:08:52,465 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:08:52,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1939886519] [2023-02-16 00:08:52,478 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-16 00:08:52,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:08:52,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:08:52,487 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:08:52,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-16 00:08:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:08:52,734 WARN L261 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 96 conjunts are in the unsatisfiable core [2023-02-16 00:08:52,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:08:53,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-16 00:08:53,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:08:53,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2023-02-16 00:08:53,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2023-02-16 00:08:53,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-02-16 00:08:53,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-02-16 00:08:53,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:08:53,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:08:53,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2023-02-16 00:08:54,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:08:54,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:08:54,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:08:54,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:08:54,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 73 [2023-02-16 00:08:58,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:08:58,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 190 [2023-02-16 00:08:58,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 168 [2023-02-16 00:08:58,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:08:58,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:08:58,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:08:58,256 INFO L321 Elim1Store]: treesize reduction 170, result has 0.6 percent of original size [2023-02-16 00:08:58,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 222 [2023-02-16 00:08:58,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:08:58,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:08:58,618 INFO L321 Elim1Store]: treesize reduction 85, result has 32.5 percent of original size [2023-02-16 00:08:58,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 63 [2023-02-16 00:08:59,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:08:59,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:08:59,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:08:59,028 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:08:59,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:08:59,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:08:59,040 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:09:00,356 INFO L321 Elim1Store]: treesize reduction 712, result has 14.2 percent of original size [2023-02-16 00:09:00,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 9 select indices, 9 select index equivalence classes, 10 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 26 case distinctions, treesize of input 448 treesize of output 863 [2023-02-16 00:09:06,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:06,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:06,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:06,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:06,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:06,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:06,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:06,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:06,245 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:09:06,252 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:09:06,286 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:09:06,296 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:09:06,366 INFO L217 Elim1Store]: Index analysis took 244 ms [2023-02-16 00:09:06,424 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:09:06,425 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:09:06,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 309 treesize of output 313 [2023-02-16 00:09:06,961 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:09:06,989 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:09:07,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:07,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:07,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:07,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:07,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:07,137 INFO L217 Elim1Store]: Index analysis took 139 ms [2023-02-16 00:09:07,161 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:09:07,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 101 [2023-02-16 00:09:07,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:07,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:07,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:07,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:07,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:07,389 INFO L217 Elim1Store]: Index analysis took 155 ms [2023-02-16 00:09:07,400 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:09:07,874 INFO L321 Elim1Store]: treesize reduction 485, result has 15.2 percent of original size [2023-02-16 00:09:07,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 523 treesize of output 570 [2023-02-16 00:09:08,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:08,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:08,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:08,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:08,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:08,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:08,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:08,722 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:09:08,732 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:09:08,732 INFO L217 Elim1Store]: Index analysis took 365 ms [2023-02-16 00:09:08,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:08,780 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:09:08,806 INFO L321 Elim1Store]: treesize reduction 148, result has 0.7 percent of original size [2023-02-16 00:09:08,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 19 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 380 treesize of output 382 [2023-02-16 00:09:08,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:08,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:08,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:08,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:08,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:08,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:08,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:08,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:09:08,954 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:09:09,024 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:09:09,095 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:09:09,112 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:09:09,154 INFO L217 Elim1Store]: Index analysis took 285 ms [2023-02-16 00:09:09,236 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:09:09,237 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:09:09,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 313 treesize of output 317 [2023-02-16 00:09:16,310 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse46 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= 0 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (let ((.cse40 (select .cse46 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 8))) (.cse104 (select .cse46 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 4))) (.cse8 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| 8)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse1 (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse105 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse106 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (+ (select .cse9 (+ (* (mod (+ aux_mod_~ARR_SIZE~0_91 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0) (< .cse105 (+ .cse106 aux_mod_~ARR_SIZE~0_91 18446744056529682433)) (= (select .cse9 (+ (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse105 (+ .cse106 aux_mod_~ARR_SIZE~0_91 18446744056529682432))))))) (.cse0 (= (select .cse9 .cse8) 0)) (.cse2 (= .cse104 1)) (.cse3 (= (+ .cse40 1) .cse104)) (.cse4 (= .cse104 0)) (.cse25 (= .cse40 2))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (aux_div_~ARR_SIZE~0_91 Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_87| Int) (v_DerPreprocessor_37 Int) (aux_mod_~ARR_SIZE~0_91 Int) (v_DerPreprocessor_38 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse24 (* (mod (+ |aux_mod_ULTIMATE.start_main_~index~0#1_87| 1) 4294967296) 4))) (let ((.cse16 (+ .cse24 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse14 (+ .cse24 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse22 (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4)) (.cse23 (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) 4))) (let ((.cse10 (+ .cse23 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse12 (+ .cse23 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse6 (+ .cse22 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse18 (+ .cse22 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse15 (select .cse9 .cse14)) (.cse7 (select .cse9 .cse16))) (let ((.cse5 (store (store (store (store (store (store (store (store .cse9 .cse10 v_DerPreprocessor_13) .cse12 v_DerPreprocessor_14) .cse6 (select .cse9 .cse6)) .cse18 (select .cse9 .cse18)) .cse6 v_DerPreprocessor_37) .cse18 v_DerPreprocessor_38) .cse14 .cse15) .cse16 .cse7))) (let ((.cse11 (select .cse5 .cse10)) (.cse17 (select .cse9 .cse12)) (.cse13 (select .cse5 .cse12)) (.cse19 (+ (* |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967295) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse20 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse21 (* aux_mod_~ARR_SIZE~0_91 4294967296))) (and (= v_DerPreprocessor_37 (select .cse5 .cse6)) (<= 0 aux_mod_~ARR_SIZE~0_91) (= .cse7 0) (= (select .cse5 .cse8) 0) (= (store (store (store (store .cse9 .cse10 .cse11) .cse12 .cse13) .cse14 .cse15) .cse16 .cse7) .cse5) (= .cse11 .cse17) (= v_DerPreprocessor_38 (select .cse5 .cse18)) (= (+ .cse17 2) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (not (= (* 4 aux_mod_~ARR_SIZE~0_91) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_87|))) (= .cse13 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (< .cse19 (+ .cse20 .cse21 18446744056529682433)) (not (< .cse19 (+ .cse20 .cse21 18446744056529682432)))))))))) .cse25) (and (exists ((aux_div_~ARR_SIZE~0_91 Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_87| Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse26 (+ (* |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967295) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse27 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse28 (* aux_mod_~ARR_SIZE~0_91 4294967296))) (and (= (+ (select .cse9 (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~index~0#1_87| 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) (not (= (* 4 aux_mod_~ARR_SIZE~0_91) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_87|))) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse26 (+ .cse27 .cse28 18446744056529682432))) (< .cse26 (+ .cse27 .cse28 18446744056529682433)) (= (select .cse9 (+ (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0)))) .cse0 .cse2 .cse3) (and .cse4 (exists ((aux_div_~ARR_SIZE~0_91 Int) (v_DerPreprocessor_33 Int) (v_DerPreprocessor_34 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse37 (* (mod (+ aux_mod_~ARR_SIZE~0_91 1) 4294967296) 4))) (let ((.cse38 (+ .cse37 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse39 (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4))) (let ((.cse34 (+ .cse39 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse30 (select .cse9 .cse38)) (.cse35 (+ .cse39 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse33 (select .cse9 .cse35)) (.cse29 (store (let ((.cse36 (+ .cse37 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (store (store (store .cse9 .cse34 v_DerPreprocessor_33) .cse35 v_DerPreprocessor_34) .cse36 (select .cse9 .cse36))) .cse38 .cse30)) (.cse31 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse32 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (select .cse29 .cse8) 0) (= .cse30 0) (< .cse31 (+ .cse32 aux_mod_~ARR_SIZE~0_91 18446744056529682433)) (= (+ .cse33 2) 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (= (select .cse29 .cse34) .cse33) (<= 0 aux_mod_~ARR_SIZE~0_91) (= (select .cse29 .cse35) 0) (not (< .cse31 (+ .cse32 aux_mod_~ARR_SIZE~0_91 18446744056529682432))))))))) .cse25) (and (exists ((~ARR_SIZE~0 Int) (v_DerPreprocessor_29 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_30 Int)) (let ((.cse49 (* (mod (+ ~ARR_SIZE~0 4294967294) 4294967296) 4))) (let ((.cse50 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse49)) (.cse51 (* (mod (+ ~ARR_SIZE~0 (* |ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295) 4294967296) 4))) (let ((.cse43 (+ .cse51 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse47 (+ .cse51 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse45 (select .cse9 .cse50))) (let ((.cse42 (store (let ((.cse48 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse49 (- 17179869184)))) (store (store (store .cse9 .cse43 v_DerPreprocessor_29) .cse47 v_DerPreprocessor_30) .cse48 (select .cse9 .cse48))) .cse50 .cse45)) (.cse44 (select .cse9 .cse47)) (.cse41 (select .cse46 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~index~0#1| 4))))) (and (= (+ .cse40 |ULTIMATE.start_main_~index~0#1|) .cse41) (= (select .cse42 (+ (* (mod (+ ~ARR_SIZE~0 4294967293) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (= (select .cse42 .cse43) .cse44) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (select .cse42 .cse8) 0) (not (< 3 ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (< 2 ~ARR_SIZE~0) (= (+ .cse44 |ULTIMATE.start_main_~index~0#1|) 0) (= .cse41 |ULTIMATE.start_main_~index~0#1|) (= .cse45 0))))))) .cse4) (and (or (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse52 (select .cse9 (+ (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (.cse55 (* (mod (+ aux_mod_~ARR_SIZE~0_91 4294967295) 4294967296) 4)) (.cse53 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse54 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (+ .cse52 1) 0) (not (< .cse53 (+ .cse54 aux_mod_~ARR_SIZE~0_91 18446744060824649727))) (= (select .cse9 (+ .cse55 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) .cse52) (= (select .cse9 (+ .cse55 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (< .cse53 (+ .cse54 aux_mod_~ARR_SIZE~0_91 18446744060824649728)) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91)))) (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_div_aux_mod_~ARR_SIZE~0_91_39 Int) (aux_mod_aux_mod_~ARR_SIZE~0_91_39 Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse56 (+ (* aux_div_aux_mod_~ARR_SIZE~0_91_39 4294967296) aux_mod_aux_mod_~ARR_SIZE~0_91_39)) (.cse61 (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967295) (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 18446744069414584320) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse62 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse63 (* aux_div_aux_mod_~ARR_SIZE~0_91_39 18446744073709551616)) (.cse64 (* aux_mod_aux_mod_~ARR_SIZE~0_91_39 4294967296)) (.cse58 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967296) 4)) (.cse60 (* 4 aux_mod_aux_mod_~ARR_SIZE~0_91_39)) (.cse59 (* 4 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75|)) (.cse57 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967296)))) (and (< |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967296) (< .cse56 4294967296) (<= 4294967295 .cse57) (= (select .cse9 (+ .cse58 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (= (+ (select .cse9 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| (* (mod (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 1) 4294967296) 4))) 1) 0) (not (= .cse59 (+ (* 17179869184 aux_div_aux_mod_~ARR_SIZE~0_91_39) .cse60))) (<= 0 .cse56) (< .cse61 (+ .cse62 .cse63 .cse64 36893488125944266753)) (<= 0 aux_mod_aux_mod_~ARR_SIZE~0_91_39) (not (< .cse61 (+ .cse62 .cse63 .cse64 36893488125944266752))) (= (select .cse9 (+ (* (mod aux_mod_aux_mod_~ARR_SIZE~0_91_39 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (select .cse9 (+ .cse58 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (< aux_mod_aux_mod_~ARR_SIZE~0_91_39 4294967296) (not (= (+ .cse60 17179869180) (+ .cse59 (* 17179869184 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75|)))) (<= 0 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75|) (< .cse57 8589934591)))) .cse1 (exists ((aux_div_~ARR_SIZE~0_91 Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_87| Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse70 (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) 4))) (let ((.cse66 (select .cse9 (+ .cse70 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (.cse65 (select .cse9 (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~index~0#1_87| 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (.cse67 (+ (* |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967295) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse68 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse69 (* aux_mod_~ARR_SIZE~0_91 4294967296))) (and (= (+ .cse65 1) 0) (not (= (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (* 4 aux_mod_~ARR_SIZE~0_91))) (= (select .cse9 (+ (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) .cse66) (< |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (= .cse66 .cse65) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse67 (+ .cse68 .cse69 18446744056529682432))) (< .cse67 (+ .cse68 .cse69 18446744056529682433)) (= (select .cse9 (+ .cse70 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0))))) (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse72 (select .cse9 (+ (* (mod (+ aux_mod_~ARR_SIZE~0_91 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (.cse71 (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4)) (.cse73 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse74 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (select .cse9 (+ .cse71 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) .cse72) (= (+ .cse72 1) 0) (< .cse73 (+ .cse74 aux_mod_~ARR_SIZE~0_91 18446744056529682433)) (= (select .cse9 (+ .cse71 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse73 (+ .cse74 aux_mod_~ARR_SIZE~0_91 18446744056529682432))))))) .cse0 .cse2 .cse3) (and .cse4 (exists ((v_DerPreprocessor_25 Int) (~ARR_SIZE~0 Int) (v_DerPreprocessor_26 Int) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse84 (* (mod (+ ~ARR_SIZE~0 4294967294) 4294967296) 4))) (let ((.cse85 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse84)) (.cse86 (* (mod (+ ~ARR_SIZE~0 (* |ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295) 4294967296) 4))) (let ((.cse77 (+ .cse86 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse82 (+ .cse86 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse81 (select .cse9 .cse85))) (let ((.cse76 (store (let ((.cse83 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse84 (- 17179869184)))) (store (store (store .cse9 .cse77 v_DerPreprocessor_25) .cse82 v_DerPreprocessor_26) .cse83 (select .cse9 .cse83))) .cse85 .cse81)) (.cse79 (* (mod (+ ~ARR_SIZE~0 4294967293) 4294967296) 4))) (let ((.cse75 (select .cse46 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~index~0#1| 4)))) (.cse78 (select .cse76 (+ .cse79 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (.cse80 (select .cse9 .cse82))) (and (= (+ .cse40 |ULTIMATE.start_main_~index~0#1|) .cse75) (= (select .cse76 .cse77) .cse78) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (select .cse76 (+ .cse79 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (not (< 3 ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (= (select .cse76 .cse8) 0) (< 2 ~ARR_SIZE~0) (= (+ .cse80 |ULTIMATE.start_main_~index~0#1|) 0) (= .cse75 |ULTIMATE.start_main_~index~0#1|) (= .cse78 .cse80) (= .cse81 0))))))))) (and .cse4 .cse25 (exists ((v_DerPreprocessor_22 Int) (~ARR_SIZE~0 Int) (v_DerPreprocessor_42 Int) (v_DerPreprocessor_21 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_41 Int)) (let ((.cse101 (* (mod (+ ~ARR_SIZE~0 (* |ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295) 4294967296) 4))) (let ((.cse100 (+ .cse101 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse102 (* (mod (+ ~ARR_SIZE~0 4294967293) 4294967296) 4)) (.cse103 (* (mod (+ ~ARR_SIZE~0 4294967294) 4294967296) 4))) (let ((.cse98 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse103)) (.cse96 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse103 (- 17179869184))) (.cse91 (+ .cse102 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse90 (+ .cse102 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse92 (select .cse9 .cse100)) (.cse94 (+ .cse101 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse89 (store (store (store (store .cse9 .cse91 v_DerPreprocessor_21) .cse90 v_DerPreprocessor_22) .cse100 .cse92) .cse94 (select .cse9 .cse94))) (.cse97 (select .cse9 .cse96)) (.cse99 (select .cse9 .cse98))) (let ((.cse93 (store (store (store (store .cse89 .cse100 v_DerPreprocessor_41) .cse94 v_DerPreprocessor_42) .cse96 .cse97) .cse98 .cse99))) (let ((.cse88 (select .cse9 .cse90)) (.cse87 (select .cse93 .cse91)) (.cse95 (select .cse93 .cse90))) (and (= .cse87 .cse88) (= v_DerPreprocessor_22 (select .cse89 .cse90)) (= v_DerPreprocessor_21 (select .cse89 .cse91)) (not (< 3 ~ARR_SIZE~0)) (= .cse92 .cse87) (< 2 ~ARR_SIZE~0) (= v_DerPreprocessor_42 (select .cse93 .cse94)) (= (+ .cse88 2) 0) (= (store (store (store (store .cse9 .cse91 .cse87) .cse90 .cse95) .cse96 .cse97) .cse98 .cse99) .cse93) (= .cse95 0) (= v_DerPreprocessor_41 (select .cse93 .cse100)) (= (select .cse93 .cse8) 0) (= .cse99 0))))))))))))) (= |c_ULTIMATE.start_main_~sum~0#1| 0) (= 0 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (= (select .cse46 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)))) is different from false [2023-02-16 00:09:21,496 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse30 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= 0 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (= |c_ULTIMATE.start_main_~sum~0#1| 0) (= 0 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (let ((.cse29 (select .cse30 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 8))) (.cse102 (select .cse30 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 4))) (.cse8 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| 8)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse1 (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse103 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse104 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (+ (select .cse9 (+ (* (mod (+ aux_mod_~ARR_SIZE~0_91 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0) (< .cse103 (+ .cse104 aux_mod_~ARR_SIZE~0_91 18446744056529682433)) (= (select .cse9 (+ (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse103 (+ .cse104 aux_mod_~ARR_SIZE~0_91 18446744056529682432))))))) (.cse0 (= (select .cse9 .cse8) 0)) (.cse2 (= .cse102 1)) (.cse3 (= (+ .cse29 1) .cse102)) (.cse25 (= .cse29 2)) (.cse4 (= .cse102 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (aux_div_~ARR_SIZE~0_91 Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_87| Int) (v_DerPreprocessor_37 Int) (aux_mod_~ARR_SIZE~0_91 Int) (v_DerPreprocessor_38 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse24 (* (mod (+ |aux_mod_ULTIMATE.start_main_~index~0#1_87| 1) 4294967296) 4))) (let ((.cse16 (+ .cse24 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse14 (+ .cse24 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse22 (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4)) (.cse23 (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) 4))) (let ((.cse10 (+ .cse23 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse12 (+ .cse23 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse6 (+ .cse22 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse18 (+ .cse22 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse15 (select .cse9 .cse14)) (.cse7 (select .cse9 .cse16))) (let ((.cse5 (store (store (store (store (store (store (store (store .cse9 .cse10 v_DerPreprocessor_13) .cse12 v_DerPreprocessor_14) .cse6 (select .cse9 .cse6)) .cse18 (select .cse9 .cse18)) .cse6 v_DerPreprocessor_37) .cse18 v_DerPreprocessor_38) .cse14 .cse15) .cse16 .cse7))) (let ((.cse11 (select .cse5 .cse10)) (.cse17 (select .cse9 .cse12)) (.cse13 (select .cse5 .cse12)) (.cse19 (+ (* |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967295) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse20 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse21 (* aux_mod_~ARR_SIZE~0_91 4294967296))) (and (= v_DerPreprocessor_37 (select .cse5 .cse6)) (<= 0 aux_mod_~ARR_SIZE~0_91) (= .cse7 0) (= (select .cse5 .cse8) 0) (= (store (store (store (store .cse9 .cse10 .cse11) .cse12 .cse13) .cse14 .cse15) .cse16 .cse7) .cse5) (= .cse11 .cse17) (= v_DerPreprocessor_38 (select .cse5 .cse18)) (= (+ .cse17 2) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (not (= (* 4 aux_mod_~ARR_SIZE~0_91) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_87|))) (= .cse13 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (< .cse19 (+ .cse20 .cse21 18446744056529682433)) (not (< .cse19 (+ .cse20 .cse21 18446744056529682432)))))))))) .cse25) (and (exists ((aux_div_~ARR_SIZE~0_91 Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_87| Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse26 (+ (* |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967295) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse27 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse28 (* aux_mod_~ARR_SIZE~0_91 4294967296))) (and (= (+ (select .cse9 (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~index~0#1_87| 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) (not (= (* 4 aux_mod_~ARR_SIZE~0_91) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_87|))) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse26 (+ .cse27 .cse28 18446744056529682432))) (< .cse26 (+ .cse27 .cse28 18446744056529682433)) (= (select .cse9 (+ (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0)))) .cse0 .cse2 .cse3) (and .cse4 (exists ((~ARR_SIZE~0 Int) (v_DerPreprocessor_29 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_30 Int)) (let ((.cse37 (* (mod (+ ~ARR_SIZE~0 4294967294) 4294967296) 4))) (let ((.cse38 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse37)) (.cse39 (* (mod (+ ~ARR_SIZE~0 (* |ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295) 4294967296) 4))) (let ((.cse32 (+ .cse39 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse35 (+ .cse39 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse34 (select .cse9 .cse38))) (let ((.cse31 (store (let ((.cse36 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse37 (- 17179869184)))) (store (store (store .cse9 .cse32 v_DerPreprocessor_29) .cse35 v_DerPreprocessor_30) .cse36 (select .cse9 .cse36))) .cse38 .cse34)) (.cse33 (select .cse9 .cse35))) (and (= (+ .cse29 |ULTIMATE.start_main_~index~0#1|) (select .cse30 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~index~0#1| 4)))) (= (select .cse31 (+ (* (mod (+ ~ARR_SIZE~0 4294967293) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (= (select .cse31 .cse32) .cse33) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (select .cse31 .cse8) 0) (not (< 3 ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (< 2 ~ARR_SIZE~0) (= (+ .cse33 |ULTIMATE.start_main_~index~0#1|) 0) (= .cse34 0)))))))) (and .cse4 (exists ((aux_div_~ARR_SIZE~0_91 Int) (v_DerPreprocessor_33 Int) (v_DerPreprocessor_34 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse48 (* (mod (+ aux_mod_~ARR_SIZE~0_91 1) 4294967296) 4))) (let ((.cse49 (+ .cse48 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse50 (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4))) (let ((.cse45 (+ .cse50 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse41 (select .cse9 .cse49)) (.cse46 (+ .cse50 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse44 (select .cse9 .cse46)) (.cse40 (store (let ((.cse47 (+ .cse48 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (store (store (store .cse9 .cse45 v_DerPreprocessor_33) .cse46 v_DerPreprocessor_34) .cse47 (select .cse9 .cse47))) .cse49 .cse41)) (.cse42 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse43 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (select .cse40 .cse8) 0) (= .cse41 0) (< .cse42 (+ .cse43 aux_mod_~ARR_SIZE~0_91 18446744056529682433)) (= (+ .cse44 2) 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (= (select .cse40 .cse45) .cse44) (<= 0 aux_mod_~ARR_SIZE~0_91) (= (select .cse40 .cse46) 0) (not (< .cse42 (+ .cse43 aux_mod_~ARR_SIZE~0_91 18446744056529682432))))))))) .cse25) (and (or (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse51 (select .cse9 (+ (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (.cse54 (* (mod (+ aux_mod_~ARR_SIZE~0_91 4294967295) 4294967296) 4)) (.cse52 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse53 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (+ .cse51 1) 0) (not (< .cse52 (+ .cse53 aux_mod_~ARR_SIZE~0_91 18446744060824649727))) (= (select .cse9 (+ .cse54 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) .cse51) (= (select .cse9 (+ .cse54 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (< .cse52 (+ .cse53 aux_mod_~ARR_SIZE~0_91 18446744060824649728)) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91)))) (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_div_aux_mod_~ARR_SIZE~0_91_39 Int) (aux_mod_aux_mod_~ARR_SIZE~0_91_39 Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse55 (+ (* aux_div_aux_mod_~ARR_SIZE~0_91_39 4294967296) aux_mod_aux_mod_~ARR_SIZE~0_91_39)) (.cse60 (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967295) (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 18446744069414584320) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse61 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse62 (* aux_div_aux_mod_~ARR_SIZE~0_91_39 18446744073709551616)) (.cse63 (* aux_mod_aux_mod_~ARR_SIZE~0_91_39 4294967296)) (.cse57 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967296) 4)) (.cse59 (* 4 aux_mod_aux_mod_~ARR_SIZE~0_91_39)) (.cse58 (* 4 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75|)) (.cse56 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967296)))) (and (< |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967296) (< .cse55 4294967296) (<= 4294967295 .cse56) (= (select .cse9 (+ .cse57 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (= (+ (select .cse9 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| (* (mod (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 1) 4294967296) 4))) 1) 0) (not (= .cse58 (+ (* 17179869184 aux_div_aux_mod_~ARR_SIZE~0_91_39) .cse59))) (<= 0 .cse55) (< .cse60 (+ .cse61 .cse62 .cse63 36893488125944266753)) (<= 0 aux_mod_aux_mod_~ARR_SIZE~0_91_39) (not (< .cse60 (+ .cse61 .cse62 .cse63 36893488125944266752))) (= (select .cse9 (+ (* (mod aux_mod_aux_mod_~ARR_SIZE~0_91_39 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (select .cse9 (+ .cse57 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (< aux_mod_aux_mod_~ARR_SIZE~0_91_39 4294967296) (not (= (+ .cse59 17179869180) (+ .cse58 (* 17179869184 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75|)))) (<= 0 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75|) (< .cse56 8589934591)))) .cse1 (exists ((aux_div_~ARR_SIZE~0_91 Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_87| Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse69 (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) 4))) (let ((.cse65 (select .cse9 (+ .cse69 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (.cse64 (select .cse9 (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~index~0#1_87| 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (.cse66 (+ (* |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967295) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse67 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse68 (* aux_mod_~ARR_SIZE~0_91 4294967296))) (and (= (+ .cse64 1) 0) (not (= (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (* 4 aux_mod_~ARR_SIZE~0_91))) (= (select .cse9 (+ (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) .cse65) (< |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (= .cse65 .cse64) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse66 (+ .cse67 .cse68 18446744056529682432))) (< .cse66 (+ .cse67 .cse68 18446744056529682433)) (= (select .cse9 (+ .cse69 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0))))) (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse71 (select .cse9 (+ (* (mod (+ aux_mod_~ARR_SIZE~0_91 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (.cse70 (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4)) (.cse72 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse73 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (select .cse9 (+ .cse70 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) .cse71) (= (+ .cse71 1) 0) (< .cse72 (+ .cse73 aux_mod_~ARR_SIZE~0_91 18446744056529682433)) (= (select .cse9 (+ .cse70 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse72 (+ .cse73 aux_mod_~ARR_SIZE~0_91 18446744056529682432))))))) .cse0 .cse2 .cse3) (and .cse4 .cse25 (exists ((v_DerPreprocessor_22 Int) (~ARR_SIZE~0 Int) (v_DerPreprocessor_42 Int) (v_DerPreprocessor_21 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_41 Int)) (let ((.cse88 (* (mod (+ ~ARR_SIZE~0 (* |ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295) 4294967296) 4))) (let ((.cse87 (+ .cse88 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse89 (* (mod (+ ~ARR_SIZE~0 4294967293) 4294967296) 4)) (.cse90 (* (mod (+ ~ARR_SIZE~0 4294967294) 4294967296) 4))) (let ((.cse85 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse90)) (.cse83 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse90 (- 17179869184))) (.cse78 (+ .cse89 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse77 (+ .cse89 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse79 (select .cse9 .cse87)) (.cse81 (+ .cse88 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse76 (store (store (store (store .cse9 .cse78 v_DerPreprocessor_21) .cse77 v_DerPreprocessor_22) .cse87 .cse79) .cse81 (select .cse9 .cse81))) (.cse84 (select .cse9 .cse83)) (.cse86 (select .cse9 .cse85))) (let ((.cse80 (store (store (store (store .cse76 .cse87 v_DerPreprocessor_41) .cse81 v_DerPreprocessor_42) .cse83 .cse84) .cse85 .cse86))) (let ((.cse75 (select .cse9 .cse77)) (.cse74 (select .cse80 .cse78)) (.cse82 (select .cse80 .cse77))) (and (= .cse74 .cse75) (= v_DerPreprocessor_22 (select .cse76 .cse77)) (= v_DerPreprocessor_21 (select .cse76 .cse78)) (not (< 3 ~ARR_SIZE~0)) (= .cse79 .cse74) (< 2 ~ARR_SIZE~0) (= v_DerPreprocessor_42 (select .cse80 .cse81)) (= (+ .cse75 2) 0) (= (store (store (store (store .cse9 .cse78 .cse74) .cse77 .cse82) .cse83 .cse84) .cse85 .cse86) .cse80) (= .cse82 0) (= v_DerPreprocessor_41 (select .cse80 .cse87)) (= (select .cse80 .cse8) 0) (= .cse86 0)))))))))) (and .cse4 (exists ((v_DerPreprocessor_25 Int) (~ARR_SIZE~0 Int) (v_DerPreprocessor_26 Int) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse99 (* (mod (+ ~ARR_SIZE~0 4294967294) 4294967296) 4))) (let ((.cse100 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse99)) (.cse101 (* (mod (+ ~ARR_SIZE~0 (* |ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295) 4294967296) 4))) (let ((.cse92 (+ .cse101 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse97 (+ .cse101 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse96 (select .cse9 .cse100))) (let ((.cse91 (store (let ((.cse98 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse99 (- 17179869184)))) (store (store (store .cse9 .cse92 v_DerPreprocessor_25) .cse97 v_DerPreprocessor_26) .cse98 (select .cse9 .cse98))) .cse100 .cse96)) (.cse94 (* (mod (+ ~ARR_SIZE~0 4294967293) 4294967296) 4))) (let ((.cse93 (select .cse91 (+ .cse94 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (.cse95 (select .cse9 .cse97))) (and (= (+ .cse29 |ULTIMATE.start_main_~index~0#1|) (select .cse30 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~index~0#1| 4)))) (= (select .cse91 .cse92) .cse93) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (select .cse91 (+ .cse94 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (not (< 3 ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (= (select .cse91 .cse8) 0) (< 2 ~ARR_SIZE~0) (= (+ .cse95 |ULTIMATE.start_main_~index~0#1|) 0) (= .cse93 .cse95) (= .cse96 0)))))))))))) (= (select .cse30 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)))) is different from false [2023-02-16 00:09:26,368 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse30 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= 0 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (= |c_ULTIMATE.start_main_~sum~0#1| 0) (= 0 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (let ((.cse29 (select .cse30 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 8))) (.cse102 (select .cse30 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 4))) (.cse8 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| 8)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse1 (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse103 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse104 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (+ (select .cse9 (+ (* (mod (+ aux_mod_~ARR_SIZE~0_91 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0) (< .cse103 (+ .cse104 aux_mod_~ARR_SIZE~0_91 18446744056529682433)) (= (select .cse9 (+ (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse103 (+ .cse104 aux_mod_~ARR_SIZE~0_91 18446744056529682432))))))) (.cse0 (= (select .cse9 .cse8) 0)) (.cse2 (= .cse102 1)) (.cse3 (= (+ .cse29 1) .cse102)) (.cse25 (= .cse29 2)) (.cse4 (= .cse102 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (aux_div_~ARR_SIZE~0_91 Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_87| Int) (v_DerPreprocessor_37 Int) (aux_mod_~ARR_SIZE~0_91 Int) (v_DerPreprocessor_38 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse24 (* (mod (+ |aux_mod_ULTIMATE.start_main_~index~0#1_87| 1) 4294967296) 4))) (let ((.cse16 (+ .cse24 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse14 (+ .cse24 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse22 (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4)) (.cse23 (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) 4))) (let ((.cse10 (+ .cse23 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse12 (+ .cse23 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse6 (+ .cse22 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse18 (+ .cse22 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse15 (select .cse9 .cse14)) (.cse7 (select .cse9 .cse16))) (let ((.cse5 (store (store (store (store (store (store (store (store .cse9 .cse10 v_DerPreprocessor_13) .cse12 v_DerPreprocessor_14) .cse6 (select .cse9 .cse6)) .cse18 (select .cse9 .cse18)) .cse6 v_DerPreprocessor_37) .cse18 v_DerPreprocessor_38) .cse14 .cse15) .cse16 .cse7))) (let ((.cse11 (select .cse5 .cse10)) (.cse17 (select .cse9 .cse12)) (.cse13 (select .cse5 .cse12)) (.cse19 (+ (* |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967295) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse20 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse21 (* aux_mod_~ARR_SIZE~0_91 4294967296))) (and (= v_DerPreprocessor_37 (select .cse5 .cse6)) (<= 0 aux_mod_~ARR_SIZE~0_91) (= .cse7 0) (= (select .cse5 .cse8) 0) (= (store (store (store (store .cse9 .cse10 .cse11) .cse12 .cse13) .cse14 .cse15) .cse16 .cse7) .cse5) (= .cse11 .cse17) (= v_DerPreprocessor_38 (select .cse5 .cse18)) (= (+ .cse17 2) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (not (= (* 4 aux_mod_~ARR_SIZE~0_91) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_87|))) (= .cse13 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (< .cse19 (+ .cse20 .cse21 18446744056529682433)) (not (< .cse19 (+ .cse20 .cse21 18446744056529682432)))))))))) .cse25) (and (exists ((aux_div_~ARR_SIZE~0_91 Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_87| Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse26 (+ (* |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967295) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse27 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse28 (* aux_mod_~ARR_SIZE~0_91 4294967296))) (and (= (+ (select .cse9 (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~index~0#1_87| 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) (not (= (* 4 aux_mod_~ARR_SIZE~0_91) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_87|))) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse26 (+ .cse27 .cse28 18446744056529682432))) (< .cse26 (+ .cse27 .cse28 18446744056529682433)) (= (select .cse9 (+ (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0)))) .cse0 .cse2 .cse3) (and .cse4 (exists ((~ARR_SIZE~0 Int) (v_DerPreprocessor_29 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_30 Int)) (let ((.cse37 (* (mod (+ ~ARR_SIZE~0 4294967294) 4294967296) 4))) (let ((.cse38 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse37)) (.cse39 (* (mod (+ ~ARR_SIZE~0 (* |ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295) 4294967296) 4))) (let ((.cse32 (+ .cse39 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse35 (+ .cse39 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse34 (select .cse9 .cse38))) (let ((.cse31 (store (let ((.cse36 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse37 (- 17179869184)))) (store (store (store .cse9 .cse32 v_DerPreprocessor_29) .cse35 v_DerPreprocessor_30) .cse36 (select .cse9 .cse36))) .cse38 .cse34)) (.cse33 (select .cse9 .cse35))) (and (= (+ .cse29 |ULTIMATE.start_main_~index~0#1|) (select .cse30 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~index~0#1| 4)))) (= (select .cse31 (+ (* (mod (+ ~ARR_SIZE~0 4294967293) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (= (select .cse31 .cse32) .cse33) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (select .cse31 .cse8) 0) (not (< 3 ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (< 2 ~ARR_SIZE~0) (= (+ .cse33 |ULTIMATE.start_main_~index~0#1|) 0) (= .cse34 0)))))))) (and .cse4 (exists ((aux_div_~ARR_SIZE~0_91 Int) (v_DerPreprocessor_33 Int) (v_DerPreprocessor_34 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse48 (* (mod (+ aux_mod_~ARR_SIZE~0_91 1) 4294967296) 4))) (let ((.cse49 (+ .cse48 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse50 (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4))) (let ((.cse45 (+ .cse50 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse41 (select .cse9 .cse49)) (.cse46 (+ .cse50 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse44 (select .cse9 .cse46)) (.cse40 (store (let ((.cse47 (+ .cse48 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (store (store (store .cse9 .cse45 v_DerPreprocessor_33) .cse46 v_DerPreprocessor_34) .cse47 (select .cse9 .cse47))) .cse49 .cse41)) (.cse42 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse43 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (select .cse40 .cse8) 0) (= .cse41 0) (< .cse42 (+ .cse43 aux_mod_~ARR_SIZE~0_91 18446744056529682433)) (= (+ .cse44 2) 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (= (select .cse40 .cse45) .cse44) (<= 0 aux_mod_~ARR_SIZE~0_91) (= (select .cse40 .cse46) 0) (not (< .cse42 (+ .cse43 aux_mod_~ARR_SIZE~0_91 18446744056529682432))))))))) .cse25) (and (or (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse51 (select .cse9 (+ (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (.cse54 (* (mod (+ aux_mod_~ARR_SIZE~0_91 4294967295) 4294967296) 4)) (.cse52 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse53 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (+ .cse51 1) 0) (not (< .cse52 (+ .cse53 aux_mod_~ARR_SIZE~0_91 18446744060824649727))) (= (select .cse9 (+ .cse54 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) .cse51) (= (select .cse9 (+ .cse54 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (< .cse52 (+ .cse53 aux_mod_~ARR_SIZE~0_91 18446744060824649728)) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91)))) (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_div_aux_mod_~ARR_SIZE~0_91_39 Int) (aux_mod_aux_mod_~ARR_SIZE~0_91_39 Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse55 (+ (* aux_div_aux_mod_~ARR_SIZE~0_91_39 4294967296) aux_mod_aux_mod_~ARR_SIZE~0_91_39)) (.cse60 (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967295) (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 18446744069414584320) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse61 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse62 (* aux_div_aux_mod_~ARR_SIZE~0_91_39 18446744073709551616)) (.cse63 (* aux_mod_aux_mod_~ARR_SIZE~0_91_39 4294967296)) (.cse57 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967296) 4)) (.cse59 (* 4 aux_mod_aux_mod_~ARR_SIZE~0_91_39)) (.cse58 (* 4 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75|)) (.cse56 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967296)))) (and (< |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967296) (< .cse55 4294967296) (<= 4294967295 .cse56) (= (select .cse9 (+ .cse57 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (= (+ (select .cse9 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| (* (mod (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 1) 4294967296) 4))) 1) 0) (not (= .cse58 (+ (* 17179869184 aux_div_aux_mod_~ARR_SIZE~0_91_39) .cse59))) (<= 0 .cse55) (< .cse60 (+ .cse61 .cse62 .cse63 36893488125944266753)) (<= 0 aux_mod_aux_mod_~ARR_SIZE~0_91_39) (not (< .cse60 (+ .cse61 .cse62 .cse63 36893488125944266752))) (= (select .cse9 (+ (* (mod aux_mod_aux_mod_~ARR_SIZE~0_91_39 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (select .cse9 (+ .cse57 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (< aux_mod_aux_mod_~ARR_SIZE~0_91_39 4294967296) (not (= (+ .cse59 17179869180) (+ .cse58 (* 17179869184 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75|)))) (<= 0 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75|) (< .cse56 8589934591)))) .cse1 (exists ((aux_div_~ARR_SIZE~0_91 Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_87| Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse69 (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) 4))) (let ((.cse65 (select .cse9 (+ .cse69 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (.cse64 (select .cse9 (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~index~0#1_87| 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (.cse66 (+ (* |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967295) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse67 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse68 (* aux_mod_~ARR_SIZE~0_91 4294967296))) (and (= (+ .cse64 1) 0) (not (= (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (* 4 aux_mod_~ARR_SIZE~0_91))) (= (select .cse9 (+ (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) .cse65) (< |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (= .cse65 .cse64) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse66 (+ .cse67 .cse68 18446744056529682432))) (< .cse66 (+ .cse67 .cse68 18446744056529682433)) (= (select .cse9 (+ .cse69 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0))))) (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse71 (select .cse9 (+ (* (mod (+ aux_mod_~ARR_SIZE~0_91 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (.cse70 (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4)) (.cse72 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse73 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (select .cse9 (+ .cse70 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) .cse71) (= (+ .cse71 1) 0) (< .cse72 (+ .cse73 aux_mod_~ARR_SIZE~0_91 18446744056529682433)) (= (select .cse9 (+ .cse70 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse72 (+ .cse73 aux_mod_~ARR_SIZE~0_91 18446744056529682432))))))) .cse0 .cse2 .cse3) (and .cse4 .cse25 (exists ((v_DerPreprocessor_22 Int) (~ARR_SIZE~0 Int) (v_DerPreprocessor_42 Int) (v_DerPreprocessor_21 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_41 Int)) (let ((.cse88 (* (mod (+ ~ARR_SIZE~0 (* |ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295) 4294967296) 4))) (let ((.cse87 (+ .cse88 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse89 (* (mod (+ ~ARR_SIZE~0 4294967293) 4294967296) 4)) (.cse90 (* (mod (+ ~ARR_SIZE~0 4294967294) 4294967296) 4))) (let ((.cse85 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse90)) (.cse83 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse90 (- 17179869184))) (.cse78 (+ .cse89 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse77 (+ .cse89 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse79 (select .cse9 .cse87)) (.cse81 (+ .cse88 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse76 (store (store (store (store .cse9 .cse78 v_DerPreprocessor_21) .cse77 v_DerPreprocessor_22) .cse87 .cse79) .cse81 (select .cse9 .cse81))) (.cse84 (select .cse9 .cse83)) (.cse86 (select .cse9 .cse85))) (let ((.cse80 (store (store (store (store .cse76 .cse87 v_DerPreprocessor_41) .cse81 v_DerPreprocessor_42) .cse83 .cse84) .cse85 .cse86))) (let ((.cse75 (select .cse9 .cse77)) (.cse74 (select .cse80 .cse78)) (.cse82 (select .cse80 .cse77))) (and (= .cse74 .cse75) (= v_DerPreprocessor_22 (select .cse76 .cse77)) (= v_DerPreprocessor_21 (select .cse76 .cse78)) (not (< 3 ~ARR_SIZE~0)) (= .cse79 .cse74) (< 2 ~ARR_SIZE~0) (= v_DerPreprocessor_42 (select .cse80 .cse81)) (= (+ .cse75 2) 0) (= (store (store (store (store .cse9 .cse78 .cse74) .cse77 .cse82) .cse83 .cse84) .cse85 .cse86) .cse80) (= .cse82 0) (= v_DerPreprocessor_41 (select .cse80 .cse87)) (= (select .cse80 .cse8) 0) (= .cse86 0)))))))))) (and .cse4 (exists ((v_DerPreprocessor_25 Int) (~ARR_SIZE~0 Int) (v_DerPreprocessor_26 Int) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse99 (* (mod (+ ~ARR_SIZE~0 4294967294) 4294967296) 4))) (let ((.cse100 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse99)) (.cse101 (* (mod (+ ~ARR_SIZE~0 (* |ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295) 4294967296) 4))) (let ((.cse92 (+ .cse101 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse97 (+ .cse101 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse96 (select .cse9 .cse100))) (let ((.cse91 (store (let ((.cse98 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse99 (- 17179869184)))) (store (store (store .cse9 .cse92 v_DerPreprocessor_25) .cse97 v_DerPreprocessor_26) .cse98 (select .cse9 .cse98))) .cse100 .cse96)) (.cse94 (* (mod (+ ~ARR_SIZE~0 4294967293) 4294967296) 4))) (let ((.cse93 (select .cse91 (+ .cse94 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (.cse95 (select .cse9 .cse97))) (and (= (+ .cse29 |ULTIMATE.start_main_~index~0#1|) (select .cse30 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~index~0#1| 4)))) (= (select .cse91 .cse92) .cse93) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (select .cse91 (+ .cse94 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (not (< 3 ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (= (select .cse91 .cse8) 0) (< 2 ~ARR_SIZE~0) (= (+ .cse95 |ULTIMATE.start_main_~index~0#1|) 0) (= .cse93 .cse95) (= .cse96 0)))))))))))) (= |c_ULTIMATE.start_main_~count~0#1| 0) (= (select .cse30 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)))) is different from false [2023-02-16 00:09:31,217 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse30 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= 0 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (let ((.cse29 (select .cse30 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 8))) (.cse102 (select .cse30 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 4))) (.cse8 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| 8))) (let ((.cse1 (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse103 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse104 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (+ (select .cse9 (+ (* (mod (+ aux_mod_~ARR_SIZE~0_91 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0) (< .cse103 (+ .cse104 aux_mod_~ARR_SIZE~0_91 18446744056529682433)) (= (select .cse9 (+ (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse103 (+ .cse104 aux_mod_~ARR_SIZE~0_91 18446744056529682432))))))) (.cse0 (= (select .cse9 .cse8) 0)) (.cse2 (= .cse102 1)) (.cse3 (= (+ .cse29 1) .cse102)) (.cse25 (= .cse29 2)) (.cse4 (= .cse102 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (aux_div_~ARR_SIZE~0_91 Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_87| Int) (v_DerPreprocessor_37 Int) (aux_mod_~ARR_SIZE~0_91 Int) (v_DerPreprocessor_38 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse24 (* (mod (+ |aux_mod_ULTIMATE.start_main_~index~0#1_87| 1) 4294967296) 4))) (let ((.cse16 (+ .cse24 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse14 (+ .cse24 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse22 (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4)) (.cse23 (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) 4))) (let ((.cse10 (+ .cse23 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse12 (+ .cse23 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse6 (+ .cse22 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse18 (+ .cse22 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse15 (select .cse9 .cse14)) (.cse7 (select .cse9 .cse16))) (let ((.cse5 (store (store (store (store (store (store (store (store .cse9 .cse10 v_DerPreprocessor_13) .cse12 v_DerPreprocessor_14) .cse6 (select .cse9 .cse6)) .cse18 (select .cse9 .cse18)) .cse6 v_DerPreprocessor_37) .cse18 v_DerPreprocessor_38) .cse14 .cse15) .cse16 .cse7))) (let ((.cse11 (select .cse5 .cse10)) (.cse17 (select .cse9 .cse12)) (.cse13 (select .cse5 .cse12)) (.cse19 (+ (* |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967295) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse20 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse21 (* aux_mod_~ARR_SIZE~0_91 4294967296))) (and (= v_DerPreprocessor_37 (select .cse5 .cse6)) (<= 0 aux_mod_~ARR_SIZE~0_91) (= .cse7 0) (= (select .cse5 .cse8) 0) (= (store (store (store (store .cse9 .cse10 .cse11) .cse12 .cse13) .cse14 .cse15) .cse16 .cse7) .cse5) (= .cse11 .cse17) (= v_DerPreprocessor_38 (select .cse5 .cse18)) (= (+ .cse17 2) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (not (= (* 4 aux_mod_~ARR_SIZE~0_91) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_87|))) (= .cse13 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (< .cse19 (+ .cse20 .cse21 18446744056529682433)) (not (< .cse19 (+ .cse20 .cse21 18446744056529682432)))))))))) .cse25) (and (exists ((aux_div_~ARR_SIZE~0_91 Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_87| Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse26 (+ (* |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967295) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse27 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse28 (* aux_mod_~ARR_SIZE~0_91 4294967296))) (and (= (+ (select .cse9 (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~index~0#1_87| 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) (not (= (* 4 aux_mod_~ARR_SIZE~0_91) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_87|))) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse26 (+ .cse27 .cse28 18446744056529682432))) (< .cse26 (+ .cse27 .cse28 18446744056529682433)) (= (select .cse9 (+ (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0)))) .cse0 .cse2 .cse3) (and .cse4 (exists ((~ARR_SIZE~0 Int) (v_DerPreprocessor_29 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_30 Int)) (let ((.cse37 (* (mod (+ ~ARR_SIZE~0 4294967294) 4294967296) 4))) (let ((.cse38 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse37)) (.cse39 (* (mod (+ ~ARR_SIZE~0 (* |ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295) 4294967296) 4))) (let ((.cse32 (+ .cse39 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse35 (+ .cse39 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse34 (select .cse9 .cse38))) (let ((.cse31 (store (let ((.cse36 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse37 (- 17179869184)))) (store (store (store .cse9 .cse32 v_DerPreprocessor_29) .cse35 v_DerPreprocessor_30) .cse36 (select .cse9 .cse36))) .cse38 .cse34)) (.cse33 (select .cse9 .cse35))) (and (= (+ .cse29 |ULTIMATE.start_main_~index~0#1|) (select .cse30 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~index~0#1| 4)))) (= (select .cse31 (+ (* (mod (+ ~ARR_SIZE~0 4294967293) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (= (select .cse31 .cse32) .cse33) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (select .cse31 .cse8) 0) (not (< 3 ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (< 2 ~ARR_SIZE~0) (= (+ .cse33 |ULTIMATE.start_main_~index~0#1|) 0) (= .cse34 0)))))))) (and .cse4 (exists ((aux_div_~ARR_SIZE~0_91 Int) (v_DerPreprocessor_33 Int) (v_DerPreprocessor_34 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse48 (* (mod (+ aux_mod_~ARR_SIZE~0_91 1) 4294967296) 4))) (let ((.cse49 (+ .cse48 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse50 (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4))) (let ((.cse45 (+ .cse50 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse41 (select .cse9 .cse49)) (.cse46 (+ .cse50 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse44 (select .cse9 .cse46)) (.cse40 (store (let ((.cse47 (+ .cse48 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (store (store (store .cse9 .cse45 v_DerPreprocessor_33) .cse46 v_DerPreprocessor_34) .cse47 (select .cse9 .cse47))) .cse49 .cse41)) (.cse42 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse43 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (select .cse40 .cse8) 0) (= .cse41 0) (< .cse42 (+ .cse43 aux_mod_~ARR_SIZE~0_91 18446744056529682433)) (= (+ .cse44 2) 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (= (select .cse40 .cse45) .cse44) (<= 0 aux_mod_~ARR_SIZE~0_91) (= (select .cse40 .cse46) 0) (not (< .cse42 (+ .cse43 aux_mod_~ARR_SIZE~0_91 18446744056529682432))))))))) .cse25) (and (or (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse51 (select .cse9 (+ (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (.cse54 (* (mod (+ aux_mod_~ARR_SIZE~0_91 4294967295) 4294967296) 4)) (.cse52 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse53 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (+ .cse51 1) 0) (not (< .cse52 (+ .cse53 aux_mod_~ARR_SIZE~0_91 18446744060824649727))) (= (select .cse9 (+ .cse54 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) .cse51) (= (select .cse9 (+ .cse54 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (< .cse52 (+ .cse53 aux_mod_~ARR_SIZE~0_91 18446744060824649728)) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91)))) (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_div_aux_mod_~ARR_SIZE~0_91_39 Int) (aux_mod_aux_mod_~ARR_SIZE~0_91_39 Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse55 (+ (* aux_div_aux_mod_~ARR_SIZE~0_91_39 4294967296) aux_mod_aux_mod_~ARR_SIZE~0_91_39)) (.cse60 (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967295) (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 18446744069414584320) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse61 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse62 (* aux_div_aux_mod_~ARR_SIZE~0_91_39 18446744073709551616)) (.cse63 (* aux_mod_aux_mod_~ARR_SIZE~0_91_39 4294967296)) (.cse57 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967296) 4)) (.cse59 (* 4 aux_mod_aux_mod_~ARR_SIZE~0_91_39)) (.cse58 (* 4 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75|)) (.cse56 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967296)))) (and (< |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967296) (< .cse55 4294967296) (<= 4294967295 .cse56) (= (select .cse9 (+ .cse57 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (= (+ (select .cse9 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| (* (mod (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 1) 4294967296) 4))) 1) 0) (not (= .cse58 (+ (* 17179869184 aux_div_aux_mod_~ARR_SIZE~0_91_39) .cse59))) (<= 0 .cse55) (< .cse60 (+ .cse61 .cse62 .cse63 36893488125944266753)) (<= 0 aux_mod_aux_mod_~ARR_SIZE~0_91_39) (not (< .cse60 (+ .cse61 .cse62 .cse63 36893488125944266752))) (= (select .cse9 (+ (* (mod aux_mod_aux_mod_~ARR_SIZE~0_91_39 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (select .cse9 (+ .cse57 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (< aux_mod_aux_mod_~ARR_SIZE~0_91_39 4294967296) (not (= (+ .cse59 17179869180) (+ .cse58 (* 17179869184 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75|)))) (<= 0 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75|) (< .cse56 8589934591)))) .cse1 (exists ((aux_div_~ARR_SIZE~0_91 Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_87| Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse69 (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) 4))) (let ((.cse65 (select .cse9 (+ .cse69 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (.cse64 (select .cse9 (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~index~0#1_87| 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (.cse66 (+ (* |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967295) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse67 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse68 (* aux_mod_~ARR_SIZE~0_91 4294967296))) (and (= (+ .cse64 1) 0) (not (= (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (* 4 aux_mod_~ARR_SIZE~0_91))) (= (select .cse9 (+ (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) .cse65) (< |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (= .cse65 .cse64) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse66 (+ .cse67 .cse68 18446744056529682432))) (< .cse66 (+ .cse67 .cse68 18446744056529682433)) (= (select .cse9 (+ .cse69 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0))))) (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse71 (select .cse9 (+ (* (mod (+ aux_mod_~ARR_SIZE~0_91 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (.cse70 (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4)) (.cse72 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse73 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (select .cse9 (+ .cse70 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) .cse71) (= (+ .cse71 1) 0) (< .cse72 (+ .cse73 aux_mod_~ARR_SIZE~0_91 18446744056529682433)) (= (select .cse9 (+ .cse70 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse72 (+ .cse73 aux_mod_~ARR_SIZE~0_91 18446744056529682432))))))) .cse0 .cse2 .cse3) (and .cse4 .cse25 (exists ((v_DerPreprocessor_22 Int) (~ARR_SIZE~0 Int) (v_DerPreprocessor_42 Int) (v_DerPreprocessor_21 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_41 Int)) (let ((.cse88 (* (mod (+ ~ARR_SIZE~0 (* |ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295) 4294967296) 4))) (let ((.cse87 (+ .cse88 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse89 (* (mod (+ ~ARR_SIZE~0 4294967293) 4294967296) 4)) (.cse90 (* (mod (+ ~ARR_SIZE~0 4294967294) 4294967296) 4))) (let ((.cse85 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse90)) (.cse83 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse90 (- 17179869184))) (.cse78 (+ .cse89 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse77 (+ .cse89 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse79 (select .cse9 .cse87)) (.cse81 (+ .cse88 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse76 (store (store (store (store .cse9 .cse78 v_DerPreprocessor_21) .cse77 v_DerPreprocessor_22) .cse87 .cse79) .cse81 (select .cse9 .cse81))) (.cse84 (select .cse9 .cse83)) (.cse86 (select .cse9 .cse85))) (let ((.cse80 (store (store (store (store .cse76 .cse87 v_DerPreprocessor_41) .cse81 v_DerPreprocessor_42) .cse83 .cse84) .cse85 .cse86))) (let ((.cse75 (select .cse9 .cse77)) (.cse74 (select .cse80 .cse78)) (.cse82 (select .cse80 .cse77))) (and (= .cse74 .cse75) (= v_DerPreprocessor_22 (select .cse76 .cse77)) (= v_DerPreprocessor_21 (select .cse76 .cse78)) (not (< 3 ~ARR_SIZE~0)) (= .cse79 .cse74) (< 2 ~ARR_SIZE~0) (= v_DerPreprocessor_42 (select .cse80 .cse81)) (= (+ .cse75 2) 0) (= (store (store (store (store .cse9 .cse78 .cse74) .cse77 .cse82) .cse83 .cse84) .cse85 .cse86) .cse80) (= .cse82 0) (= v_DerPreprocessor_41 (select .cse80 .cse87)) (= (select .cse80 .cse8) 0) (= .cse86 0)))))))))) (and .cse4 (exists ((v_DerPreprocessor_25 Int) (~ARR_SIZE~0 Int) (v_DerPreprocessor_26 Int) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse99 (* (mod (+ ~ARR_SIZE~0 4294967294) 4294967296) 4))) (let ((.cse100 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse99)) (.cse101 (* (mod (+ ~ARR_SIZE~0 (* |ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295) 4294967296) 4))) (let ((.cse92 (+ .cse101 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse97 (+ .cse101 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse96 (select .cse9 .cse100))) (let ((.cse91 (store (let ((.cse98 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse99 (- 17179869184)))) (store (store (store .cse9 .cse92 v_DerPreprocessor_25) .cse97 v_DerPreprocessor_26) .cse98 (select .cse9 .cse98))) .cse100 .cse96)) (.cse94 (* (mod (+ ~ARR_SIZE~0 4294967293) 4294967296) 4))) (let ((.cse93 (select .cse91 (+ .cse94 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (.cse95 (select .cse9 .cse97))) (and (= (+ .cse29 |ULTIMATE.start_main_~index~0#1|) (select .cse30 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~index~0#1| 4)))) (= (select .cse91 .cse92) .cse93) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (select .cse91 (+ .cse94 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (not (< 3 ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (= (select .cse91 .cse8) 0) (< 2 ~ARR_SIZE~0) (= (+ .cse95 |ULTIMATE.start_main_~index~0#1|) 0) (= .cse93 .cse95) (= .cse96 0)))))))))))) (= |c_ULTIMATE.start_main_~count~0#1| 0) (= |c_ULTIMATE.start_main_~sum~0#1| (let ((.cse105 (* |c_ULTIMATE.start_main_~count~0#1| 4))) (+ (select .cse9 (+ .cse105 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (select .cse30 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse105))))) (= (select .cse30 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)))) is different from false [2023-02-16 00:09:36,249 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse30 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= 0 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (= |c_ULTIMATE.start_main_~count~0#1| 1) (= 0 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (let ((.cse29 (select .cse30 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 8))) (.cse102 (select .cse30 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 4))) (.cse8 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| 8))) (let ((.cse1 (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse103 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse104 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (+ (select .cse9 (+ (* (mod (+ aux_mod_~ARR_SIZE~0_91 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0) (< .cse103 (+ .cse104 aux_mod_~ARR_SIZE~0_91 18446744056529682433)) (= (select .cse9 (+ (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse103 (+ .cse104 aux_mod_~ARR_SIZE~0_91 18446744056529682432))))))) (.cse0 (= (select .cse9 .cse8) 0)) (.cse2 (= .cse102 1)) (.cse3 (= (+ .cse29 1) .cse102)) (.cse25 (= .cse29 2)) (.cse4 (= .cse102 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (aux_div_~ARR_SIZE~0_91 Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_87| Int) (v_DerPreprocessor_37 Int) (aux_mod_~ARR_SIZE~0_91 Int) (v_DerPreprocessor_38 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse24 (* (mod (+ |aux_mod_ULTIMATE.start_main_~index~0#1_87| 1) 4294967296) 4))) (let ((.cse16 (+ .cse24 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse14 (+ .cse24 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse22 (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4)) (.cse23 (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) 4))) (let ((.cse10 (+ .cse23 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse12 (+ .cse23 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse6 (+ .cse22 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse18 (+ .cse22 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse15 (select .cse9 .cse14)) (.cse7 (select .cse9 .cse16))) (let ((.cse5 (store (store (store (store (store (store (store (store .cse9 .cse10 v_DerPreprocessor_13) .cse12 v_DerPreprocessor_14) .cse6 (select .cse9 .cse6)) .cse18 (select .cse9 .cse18)) .cse6 v_DerPreprocessor_37) .cse18 v_DerPreprocessor_38) .cse14 .cse15) .cse16 .cse7))) (let ((.cse11 (select .cse5 .cse10)) (.cse17 (select .cse9 .cse12)) (.cse13 (select .cse5 .cse12)) (.cse19 (+ (* |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967295) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse20 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse21 (* aux_mod_~ARR_SIZE~0_91 4294967296))) (and (= v_DerPreprocessor_37 (select .cse5 .cse6)) (<= 0 aux_mod_~ARR_SIZE~0_91) (= .cse7 0) (= (select .cse5 .cse8) 0) (= (store (store (store (store .cse9 .cse10 .cse11) .cse12 .cse13) .cse14 .cse15) .cse16 .cse7) .cse5) (= .cse11 .cse17) (= v_DerPreprocessor_38 (select .cse5 .cse18)) (= (+ .cse17 2) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (not (= (* 4 aux_mod_~ARR_SIZE~0_91) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_87|))) (= .cse13 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (< .cse19 (+ .cse20 .cse21 18446744056529682433)) (not (< .cse19 (+ .cse20 .cse21 18446744056529682432)))))))))) .cse25) (and (exists ((aux_div_~ARR_SIZE~0_91 Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_87| Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse26 (+ (* |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967295) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse27 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse28 (* aux_mod_~ARR_SIZE~0_91 4294967296))) (and (= (+ (select .cse9 (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~index~0#1_87| 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) (not (= (* 4 aux_mod_~ARR_SIZE~0_91) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_87|))) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse26 (+ .cse27 .cse28 18446744056529682432))) (< .cse26 (+ .cse27 .cse28 18446744056529682433)) (= (select .cse9 (+ (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0)))) .cse0 .cse2 .cse3) (and .cse4 (exists ((~ARR_SIZE~0 Int) (v_DerPreprocessor_29 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_30 Int)) (let ((.cse37 (* (mod (+ ~ARR_SIZE~0 4294967294) 4294967296) 4))) (let ((.cse38 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse37)) (.cse39 (* (mod (+ ~ARR_SIZE~0 (* |ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295) 4294967296) 4))) (let ((.cse32 (+ .cse39 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse35 (+ .cse39 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse34 (select .cse9 .cse38))) (let ((.cse31 (store (let ((.cse36 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse37 (- 17179869184)))) (store (store (store .cse9 .cse32 v_DerPreprocessor_29) .cse35 v_DerPreprocessor_30) .cse36 (select .cse9 .cse36))) .cse38 .cse34)) (.cse33 (select .cse9 .cse35))) (and (= (+ .cse29 |ULTIMATE.start_main_~index~0#1|) (select .cse30 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~index~0#1| 4)))) (= (select .cse31 (+ (* (mod (+ ~ARR_SIZE~0 4294967293) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (= (select .cse31 .cse32) .cse33) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (select .cse31 .cse8) 0) (not (< 3 ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (< 2 ~ARR_SIZE~0) (= (+ .cse33 |ULTIMATE.start_main_~index~0#1|) 0) (= .cse34 0)))))))) (and .cse4 (exists ((aux_div_~ARR_SIZE~0_91 Int) (v_DerPreprocessor_33 Int) (v_DerPreprocessor_34 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse48 (* (mod (+ aux_mod_~ARR_SIZE~0_91 1) 4294967296) 4))) (let ((.cse49 (+ .cse48 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse50 (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4))) (let ((.cse45 (+ .cse50 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse41 (select .cse9 .cse49)) (.cse46 (+ .cse50 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse44 (select .cse9 .cse46)) (.cse40 (store (let ((.cse47 (+ .cse48 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (store (store (store .cse9 .cse45 v_DerPreprocessor_33) .cse46 v_DerPreprocessor_34) .cse47 (select .cse9 .cse47))) .cse49 .cse41)) (.cse42 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse43 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (select .cse40 .cse8) 0) (= .cse41 0) (< .cse42 (+ .cse43 aux_mod_~ARR_SIZE~0_91 18446744056529682433)) (= (+ .cse44 2) 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (= (select .cse40 .cse45) .cse44) (<= 0 aux_mod_~ARR_SIZE~0_91) (= (select .cse40 .cse46) 0) (not (< .cse42 (+ .cse43 aux_mod_~ARR_SIZE~0_91 18446744056529682432))))))))) .cse25) (and (or (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse51 (select .cse9 (+ (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (.cse54 (* (mod (+ aux_mod_~ARR_SIZE~0_91 4294967295) 4294967296) 4)) (.cse52 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse53 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (+ .cse51 1) 0) (not (< .cse52 (+ .cse53 aux_mod_~ARR_SIZE~0_91 18446744060824649727))) (= (select .cse9 (+ .cse54 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) .cse51) (= (select .cse9 (+ .cse54 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (< .cse52 (+ .cse53 aux_mod_~ARR_SIZE~0_91 18446744060824649728)) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91)))) (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_div_aux_mod_~ARR_SIZE~0_91_39 Int) (aux_mod_aux_mod_~ARR_SIZE~0_91_39 Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse55 (+ (* aux_div_aux_mod_~ARR_SIZE~0_91_39 4294967296) aux_mod_aux_mod_~ARR_SIZE~0_91_39)) (.cse60 (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967295) (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 18446744069414584320) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse61 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse62 (* aux_div_aux_mod_~ARR_SIZE~0_91_39 18446744073709551616)) (.cse63 (* aux_mod_aux_mod_~ARR_SIZE~0_91_39 4294967296)) (.cse57 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967296) 4)) (.cse59 (* 4 aux_mod_aux_mod_~ARR_SIZE~0_91_39)) (.cse58 (* 4 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75|)) (.cse56 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967296)))) (and (< |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967296) (< .cse55 4294967296) (<= 4294967295 .cse56) (= (select .cse9 (+ .cse57 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (= (+ (select .cse9 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| (* (mod (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 1) 4294967296) 4))) 1) 0) (not (= .cse58 (+ (* 17179869184 aux_div_aux_mod_~ARR_SIZE~0_91_39) .cse59))) (<= 0 .cse55) (< .cse60 (+ .cse61 .cse62 .cse63 36893488125944266753)) (<= 0 aux_mod_aux_mod_~ARR_SIZE~0_91_39) (not (< .cse60 (+ .cse61 .cse62 .cse63 36893488125944266752))) (= (select .cse9 (+ (* (mod aux_mod_aux_mod_~ARR_SIZE~0_91_39 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (select .cse9 (+ .cse57 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (< aux_mod_aux_mod_~ARR_SIZE~0_91_39 4294967296) (not (= (+ .cse59 17179869180) (+ .cse58 (* 17179869184 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75|)))) (<= 0 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75|) (< .cse56 8589934591)))) .cse1 (exists ((aux_div_~ARR_SIZE~0_91 Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_87| Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse69 (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) 4))) (let ((.cse65 (select .cse9 (+ .cse69 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (.cse64 (select .cse9 (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~index~0#1_87| 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (.cse66 (+ (* |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967295) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse67 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse68 (* aux_mod_~ARR_SIZE~0_91 4294967296))) (and (= (+ .cse64 1) 0) (not (= (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (* 4 aux_mod_~ARR_SIZE~0_91))) (= (select .cse9 (+ (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) .cse65) (< |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (= .cse65 .cse64) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse66 (+ .cse67 .cse68 18446744056529682432))) (< .cse66 (+ .cse67 .cse68 18446744056529682433)) (= (select .cse9 (+ .cse69 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0))))) (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse71 (select .cse9 (+ (* (mod (+ aux_mod_~ARR_SIZE~0_91 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (.cse70 (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4)) (.cse72 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse73 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (select .cse9 (+ .cse70 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) .cse71) (= (+ .cse71 1) 0) (< .cse72 (+ .cse73 aux_mod_~ARR_SIZE~0_91 18446744056529682433)) (= (select .cse9 (+ .cse70 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse72 (+ .cse73 aux_mod_~ARR_SIZE~0_91 18446744056529682432))))))) .cse0 .cse2 .cse3) (and .cse4 .cse25 (exists ((v_DerPreprocessor_22 Int) (~ARR_SIZE~0 Int) (v_DerPreprocessor_42 Int) (v_DerPreprocessor_21 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_41 Int)) (let ((.cse88 (* (mod (+ ~ARR_SIZE~0 (* |ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295) 4294967296) 4))) (let ((.cse87 (+ .cse88 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse89 (* (mod (+ ~ARR_SIZE~0 4294967293) 4294967296) 4)) (.cse90 (* (mod (+ ~ARR_SIZE~0 4294967294) 4294967296) 4))) (let ((.cse85 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse90)) (.cse83 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse90 (- 17179869184))) (.cse78 (+ .cse89 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse77 (+ .cse89 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse79 (select .cse9 .cse87)) (.cse81 (+ .cse88 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse76 (store (store (store (store .cse9 .cse78 v_DerPreprocessor_21) .cse77 v_DerPreprocessor_22) .cse87 .cse79) .cse81 (select .cse9 .cse81))) (.cse84 (select .cse9 .cse83)) (.cse86 (select .cse9 .cse85))) (let ((.cse80 (store (store (store (store .cse76 .cse87 v_DerPreprocessor_41) .cse81 v_DerPreprocessor_42) .cse83 .cse84) .cse85 .cse86))) (let ((.cse75 (select .cse9 .cse77)) (.cse74 (select .cse80 .cse78)) (.cse82 (select .cse80 .cse77))) (and (= .cse74 .cse75) (= v_DerPreprocessor_22 (select .cse76 .cse77)) (= v_DerPreprocessor_21 (select .cse76 .cse78)) (not (< 3 ~ARR_SIZE~0)) (= .cse79 .cse74) (< 2 ~ARR_SIZE~0) (= v_DerPreprocessor_42 (select .cse80 .cse81)) (= (+ .cse75 2) 0) (= (store (store (store (store .cse9 .cse78 .cse74) .cse77 .cse82) .cse83 .cse84) .cse85 .cse86) .cse80) (= .cse82 0) (= v_DerPreprocessor_41 (select .cse80 .cse87)) (= (select .cse80 .cse8) 0) (= .cse86 0)))))))))) (and .cse4 (exists ((v_DerPreprocessor_25 Int) (~ARR_SIZE~0 Int) (v_DerPreprocessor_26 Int) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse99 (* (mod (+ ~ARR_SIZE~0 4294967294) 4294967296) 4))) (let ((.cse100 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse99)) (.cse101 (* (mod (+ ~ARR_SIZE~0 (* |ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295) 4294967296) 4))) (let ((.cse92 (+ .cse101 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse97 (+ .cse101 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse96 (select .cse9 .cse100))) (let ((.cse91 (store (let ((.cse98 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse99 (- 17179869184)))) (store (store (store .cse9 .cse92 v_DerPreprocessor_25) .cse97 v_DerPreprocessor_26) .cse98 (select .cse9 .cse98))) .cse100 .cse96)) (.cse94 (* (mod (+ ~ARR_SIZE~0 4294967293) 4294967296) 4))) (let ((.cse93 (select .cse91 (+ .cse94 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (.cse95 (select .cse9 .cse97))) (and (= (+ .cse29 |ULTIMATE.start_main_~index~0#1|) (select .cse30 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~index~0#1| 4)))) (= (select .cse91 .cse92) .cse93) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (select .cse91 (+ .cse94 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (not (< 3 ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (= (select .cse91 .cse8) 0) (< 2 ~ARR_SIZE~0) (= (+ .cse95 |ULTIMATE.start_main_~index~0#1|) 0) (= .cse93 .cse95) (= .cse96 0)))))))))))) (= (select .cse30 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~sum~0#1| (let ((.cse105 (* |c_ULTIMATE.start_main_~count~0#1| 4))) (+ (select .cse30 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse105 (- 4))) (select .cse9 (+ .cse105 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 4)))))) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)))) is different from false [2023-02-16 00:09:41,305 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (= 0 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (= |c_ULTIMATE.start_main_~count~0#1| 1) (= 0 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (= |c_ULTIMATE.start_main_~sum~0#1| (let ((.cse1 (* |c_ULTIMATE.start_main_~count~0#1| 4))) (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse1 (- 4))) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 4))) (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse1))))) (let ((.cse31 (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 8))) (.cse103 (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 4))) (.cse11 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| 8))) (let ((.cse4 (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse104 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse105 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (+ (select .cse0 (+ (* (mod (+ aux_mod_~ARR_SIZE~0_91 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0) (< .cse104 (+ .cse105 aux_mod_~ARR_SIZE~0_91 18446744056529682433)) (= (select .cse0 (+ (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse104 (+ .cse105 aux_mod_~ARR_SIZE~0_91 18446744056529682432))))))) (.cse3 (= (select .cse0 .cse11) 0)) (.cse5 (= .cse103 1)) (.cse6 (= (+ .cse31 1) .cse103)) (.cse27 (= .cse31 2)) (.cse7 (= .cse103 0))) (or (and .cse3 .cse4 .cse5 .cse6) (and .cse7 (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (aux_div_~ARR_SIZE~0_91 Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_87| Int) (v_DerPreprocessor_37 Int) (aux_mod_~ARR_SIZE~0_91 Int) (v_DerPreprocessor_38 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse26 (* (mod (+ |aux_mod_ULTIMATE.start_main_~index~0#1_87| 1) 4294967296) 4))) (let ((.cse18 (+ .cse26 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse16 (+ .cse26 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse24 (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4)) (.cse25 (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) 4))) (let ((.cse12 (+ .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse14 (+ .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse9 (+ .cse24 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse20 (+ .cse24 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse17 (select .cse0 .cse16)) (.cse10 (select .cse0 .cse18))) (let ((.cse8 (store (store (store (store (store (store (store (store .cse0 .cse12 v_DerPreprocessor_13) .cse14 v_DerPreprocessor_14) .cse9 (select .cse0 .cse9)) .cse20 (select .cse0 .cse20)) .cse9 v_DerPreprocessor_37) .cse20 v_DerPreprocessor_38) .cse16 .cse17) .cse18 .cse10))) (let ((.cse13 (select .cse8 .cse12)) (.cse19 (select .cse0 .cse14)) (.cse15 (select .cse8 .cse14)) (.cse21 (+ (* |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967295) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse22 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse23 (* aux_mod_~ARR_SIZE~0_91 4294967296))) (and (= v_DerPreprocessor_37 (select .cse8 .cse9)) (<= 0 aux_mod_~ARR_SIZE~0_91) (= .cse10 0) (= (select .cse8 .cse11) 0) (= (store (store (store (store .cse0 .cse12 .cse13) .cse14 .cse15) .cse16 .cse17) .cse18 .cse10) .cse8) (= .cse13 .cse19) (= v_DerPreprocessor_38 (select .cse8 .cse20)) (= (+ .cse19 2) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (not (= (* 4 aux_mod_~ARR_SIZE~0_91) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_87|))) (= .cse15 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (< .cse21 (+ .cse22 .cse23 18446744056529682433)) (not (< .cse21 (+ .cse22 .cse23 18446744056529682432)))))))))) .cse27) (and (exists ((aux_div_~ARR_SIZE~0_91 Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_87| Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse28 (+ (* |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967295) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse29 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse30 (* aux_mod_~ARR_SIZE~0_91 4294967296))) (and (= (+ (select .cse0 (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~index~0#1_87| 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) (not (= (* 4 aux_mod_~ARR_SIZE~0_91) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_87|))) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse28 (+ .cse29 .cse30 18446744056529682432))) (< .cse28 (+ .cse29 .cse30 18446744056529682433)) (= (select .cse0 (+ (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0)))) .cse3 .cse5 .cse6) (and .cse7 (exists ((~ARR_SIZE~0 Int) (v_DerPreprocessor_29 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_30 Int)) (let ((.cse38 (* (mod (+ ~ARR_SIZE~0 4294967294) 4294967296) 4))) (let ((.cse39 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse38)) (.cse40 (* (mod (+ ~ARR_SIZE~0 (* |ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295) 4294967296) 4))) (let ((.cse33 (+ .cse40 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse36 (+ .cse40 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse35 (select .cse0 .cse39))) (let ((.cse32 (store (let ((.cse37 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse38 (- 17179869184)))) (store (store (store .cse0 .cse33 v_DerPreprocessor_29) .cse36 v_DerPreprocessor_30) .cse37 (select .cse0 .cse37))) .cse39 .cse35)) (.cse34 (select .cse0 .cse36))) (and (= (+ .cse31 |ULTIMATE.start_main_~index~0#1|) (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~index~0#1| 4)))) (= (select .cse32 (+ (* (mod (+ ~ARR_SIZE~0 4294967293) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (= (select .cse32 .cse33) .cse34) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (select .cse32 .cse11) 0) (not (< 3 ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (< 2 ~ARR_SIZE~0) (= (+ .cse34 |ULTIMATE.start_main_~index~0#1|) 0) (= .cse35 0)))))))) (and .cse7 (exists ((aux_div_~ARR_SIZE~0_91 Int) (v_DerPreprocessor_33 Int) (v_DerPreprocessor_34 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse49 (* (mod (+ aux_mod_~ARR_SIZE~0_91 1) 4294967296) 4))) (let ((.cse50 (+ .cse49 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse51 (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4))) (let ((.cse46 (+ .cse51 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse42 (select .cse0 .cse50)) (.cse47 (+ .cse51 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse45 (select .cse0 .cse47)) (.cse41 (store (let ((.cse48 (+ .cse49 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (store (store (store .cse0 .cse46 v_DerPreprocessor_33) .cse47 v_DerPreprocessor_34) .cse48 (select .cse0 .cse48))) .cse50 .cse42)) (.cse43 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse44 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (select .cse41 .cse11) 0) (= .cse42 0) (< .cse43 (+ .cse44 aux_mod_~ARR_SIZE~0_91 18446744056529682433)) (= (+ .cse45 2) 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (= (select .cse41 .cse46) .cse45) (<= 0 aux_mod_~ARR_SIZE~0_91) (= (select .cse41 .cse47) 0) (not (< .cse43 (+ .cse44 aux_mod_~ARR_SIZE~0_91 18446744056529682432))))))))) .cse27) (and (or (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse52 (select .cse0 (+ (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (.cse55 (* (mod (+ aux_mod_~ARR_SIZE~0_91 4294967295) 4294967296) 4)) (.cse53 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse54 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (+ .cse52 1) 0) (not (< .cse53 (+ .cse54 aux_mod_~ARR_SIZE~0_91 18446744060824649727))) (= (select .cse0 (+ .cse55 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) .cse52) (= (select .cse0 (+ .cse55 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (< .cse53 (+ .cse54 aux_mod_~ARR_SIZE~0_91 18446744060824649728)) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91)))) (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_div_aux_mod_~ARR_SIZE~0_91_39 Int) (aux_mod_aux_mod_~ARR_SIZE~0_91_39 Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse56 (+ (* aux_div_aux_mod_~ARR_SIZE~0_91_39 4294967296) aux_mod_aux_mod_~ARR_SIZE~0_91_39)) (.cse61 (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967295) (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 18446744069414584320) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse62 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse63 (* aux_div_aux_mod_~ARR_SIZE~0_91_39 18446744073709551616)) (.cse64 (* aux_mod_aux_mod_~ARR_SIZE~0_91_39 4294967296)) (.cse58 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967296) 4)) (.cse60 (* 4 aux_mod_aux_mod_~ARR_SIZE~0_91_39)) (.cse59 (* 4 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75|)) (.cse57 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967296)))) (and (< |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967296) (< .cse56 4294967296) (<= 4294967295 .cse57) (= (select .cse0 (+ .cse58 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (= (+ (select .cse0 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| (* (mod (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 1) 4294967296) 4))) 1) 0) (not (= .cse59 (+ (* 17179869184 aux_div_aux_mod_~ARR_SIZE~0_91_39) .cse60))) (<= 0 .cse56) (< .cse61 (+ .cse62 .cse63 .cse64 36893488125944266753)) (<= 0 aux_mod_aux_mod_~ARR_SIZE~0_91_39) (not (< .cse61 (+ .cse62 .cse63 .cse64 36893488125944266752))) (= (select .cse0 (+ (* (mod aux_mod_aux_mod_~ARR_SIZE~0_91_39 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (select .cse0 (+ .cse58 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (< aux_mod_aux_mod_~ARR_SIZE~0_91_39 4294967296) (not (= (+ .cse60 17179869180) (+ .cse59 (* 17179869184 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75|)))) (<= 0 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75|) (< .cse57 8589934591)))) .cse4 (exists ((aux_div_~ARR_SIZE~0_91 Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_87| Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse70 (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) 4))) (let ((.cse66 (select .cse0 (+ .cse70 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (.cse65 (select .cse0 (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~index~0#1_87| 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (.cse67 (+ (* |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967295) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse68 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse69 (* aux_mod_~ARR_SIZE~0_91 4294967296))) (and (= (+ .cse65 1) 0) (not (= (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (* 4 aux_mod_~ARR_SIZE~0_91))) (= (select .cse0 (+ (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) .cse66) (< |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (= .cse66 .cse65) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse67 (+ .cse68 .cse69 18446744056529682432))) (< .cse67 (+ .cse68 .cse69 18446744056529682433)) (= (select .cse0 (+ .cse70 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0))))) (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse72 (select .cse0 (+ (* (mod (+ aux_mod_~ARR_SIZE~0_91 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (.cse71 (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4)) (.cse73 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse74 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (select .cse0 (+ .cse71 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) .cse72) (= (+ .cse72 1) 0) (< .cse73 (+ .cse74 aux_mod_~ARR_SIZE~0_91 18446744056529682433)) (= (select .cse0 (+ .cse71 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse73 (+ .cse74 aux_mod_~ARR_SIZE~0_91 18446744056529682432))))))) .cse3 .cse5 .cse6) (and .cse7 .cse27 (exists ((v_DerPreprocessor_22 Int) (~ARR_SIZE~0 Int) (v_DerPreprocessor_42 Int) (v_DerPreprocessor_21 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_41 Int)) (let ((.cse89 (* (mod (+ ~ARR_SIZE~0 (* |ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295) 4294967296) 4))) (let ((.cse88 (+ .cse89 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse90 (* (mod (+ ~ARR_SIZE~0 4294967293) 4294967296) 4)) (.cse91 (* (mod (+ ~ARR_SIZE~0 4294967294) 4294967296) 4))) (let ((.cse86 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse91)) (.cse84 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse91 (- 17179869184))) (.cse79 (+ .cse90 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse78 (+ .cse90 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse80 (select .cse0 .cse88)) (.cse82 (+ .cse89 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse77 (store (store (store (store .cse0 .cse79 v_DerPreprocessor_21) .cse78 v_DerPreprocessor_22) .cse88 .cse80) .cse82 (select .cse0 .cse82))) (.cse85 (select .cse0 .cse84)) (.cse87 (select .cse0 .cse86))) (let ((.cse81 (store (store (store (store .cse77 .cse88 v_DerPreprocessor_41) .cse82 v_DerPreprocessor_42) .cse84 .cse85) .cse86 .cse87))) (let ((.cse76 (select .cse0 .cse78)) (.cse75 (select .cse81 .cse79)) (.cse83 (select .cse81 .cse78))) (and (= .cse75 .cse76) (= v_DerPreprocessor_22 (select .cse77 .cse78)) (= v_DerPreprocessor_21 (select .cse77 .cse79)) (not (< 3 ~ARR_SIZE~0)) (= .cse80 .cse75) (< 2 ~ARR_SIZE~0) (= v_DerPreprocessor_42 (select .cse81 .cse82)) (= (+ .cse76 2) 0) (= (store (store (store (store .cse0 .cse79 .cse75) .cse78 .cse83) .cse84 .cse85) .cse86 .cse87) .cse81) (= .cse83 0) (= v_DerPreprocessor_41 (select .cse81 .cse88)) (= (select .cse81 .cse11) 0) (= .cse87 0)))))))))) (and .cse7 (exists ((v_DerPreprocessor_25 Int) (~ARR_SIZE~0 Int) (v_DerPreprocessor_26 Int) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse100 (* (mod (+ ~ARR_SIZE~0 4294967294) 4294967296) 4))) (let ((.cse101 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse100)) (.cse102 (* (mod (+ ~ARR_SIZE~0 (* |ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295) 4294967296) 4))) (let ((.cse93 (+ .cse102 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse98 (+ .cse102 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse97 (select .cse0 .cse101))) (let ((.cse92 (store (let ((.cse99 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse100 (- 17179869184)))) (store (store (store .cse0 .cse93 v_DerPreprocessor_25) .cse98 v_DerPreprocessor_26) .cse99 (select .cse0 .cse99))) .cse101 .cse97)) (.cse95 (* (mod (+ ~ARR_SIZE~0 4294967293) 4294967296) 4))) (let ((.cse94 (select .cse92 (+ .cse95 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (.cse96 (select .cse0 .cse98))) (and (= (+ .cse31 |ULTIMATE.start_main_~index~0#1|) (select .cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~index~0#1| 4)))) (= (select .cse92 .cse93) .cse94) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (select .cse92 (+ .cse95 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (not (< 3 ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (= (select .cse92 .cse11) 0) (< 2 ~ARR_SIZE~0) (= (+ .cse96 |ULTIMATE.start_main_~index~0#1|) 0) (= .cse94 .cse96) (= .cse97 0)))))))))))) (= (select .cse2 |c_ULTIMATE.start_main_~#array1~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)))) is different from false [2023-02-16 00:09:46,328 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse32 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (let ((.cse0 (select .cse32 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 4))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (select .cse32 |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (and (= 0 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (= |c_ULTIMATE.start_main_~sum~0#1| (+ .cse0 .cse1 (select .cse2 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (select .cse2 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| 4)))) (let ((.cse31 (select .cse32 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| 8))) (.cse11 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| 8))) (let ((.cse4 (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse104 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse105 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (+ (select .cse2 (+ (* (mod (+ aux_mod_~ARR_SIZE~0_91 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0) (< .cse104 (+ .cse105 aux_mod_~ARR_SIZE~0_91 18446744056529682433)) (= (select .cse2 (+ (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse104 (+ .cse105 aux_mod_~ARR_SIZE~0_91 18446744056529682432))))))) (.cse3 (= (select .cse2 .cse11) 0)) (.cse5 (= .cse0 1)) (.cse6 (= (+ .cse31 1) .cse0)) (.cse27 (= .cse31 2)) (.cse7 (= .cse0 0))) (or (and .cse3 .cse4 .cse5 .cse6) (and .cse7 (exists ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_14 Int) (aux_div_~ARR_SIZE~0_91 Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_87| Int) (v_DerPreprocessor_37 Int) (aux_mod_~ARR_SIZE~0_91 Int) (v_DerPreprocessor_38 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse26 (* (mod (+ |aux_mod_ULTIMATE.start_main_~index~0#1_87| 1) 4294967296) 4))) (let ((.cse18 (+ .cse26 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse16 (+ .cse26 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse24 (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4)) (.cse25 (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) 4))) (let ((.cse12 (+ .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse14 (+ .cse25 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse9 (+ .cse24 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse20 (+ .cse24 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse17 (select .cse2 .cse16)) (.cse10 (select .cse2 .cse18))) (let ((.cse8 (store (store (store (store (store (store (store (store .cse2 .cse12 v_DerPreprocessor_13) .cse14 v_DerPreprocessor_14) .cse9 (select .cse2 .cse9)) .cse20 (select .cse2 .cse20)) .cse9 v_DerPreprocessor_37) .cse20 v_DerPreprocessor_38) .cse16 .cse17) .cse18 .cse10))) (let ((.cse13 (select .cse8 .cse12)) (.cse19 (select .cse2 .cse14)) (.cse15 (select .cse8 .cse14)) (.cse21 (+ (* |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967295) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse22 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse23 (* aux_mod_~ARR_SIZE~0_91 4294967296))) (and (= v_DerPreprocessor_37 (select .cse8 .cse9)) (<= 0 aux_mod_~ARR_SIZE~0_91) (= .cse10 0) (= (select .cse8 .cse11) 0) (= (store (store (store (store .cse2 .cse12 .cse13) .cse14 .cse15) .cse16 .cse17) .cse18 .cse10) .cse8) (= .cse13 .cse19) (= v_DerPreprocessor_38 (select .cse8 .cse20)) (= (+ .cse19 2) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (not (= (* 4 aux_mod_~ARR_SIZE~0_91) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_87|))) (= .cse15 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (< .cse21 (+ .cse22 .cse23 18446744056529682433)) (not (< .cse21 (+ .cse22 .cse23 18446744056529682432)))))))))) .cse27) (and (exists ((aux_div_~ARR_SIZE~0_91 Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_87| Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse28 (+ (* |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967295) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse29 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse30 (* aux_mod_~ARR_SIZE~0_91 4294967296))) (and (= (+ (select .cse2 (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~index~0#1_87| 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 1) 0) (< |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) (not (= (* 4 aux_mod_~ARR_SIZE~0_91) (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_87|))) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse28 (+ .cse29 .cse30 18446744056529682432))) (< .cse28 (+ .cse29 .cse30 18446744056529682433)) (= (select .cse2 (+ (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0)))) .cse3 .cse5 .cse6) (and .cse7 (exists ((~ARR_SIZE~0 Int) (v_DerPreprocessor_29 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_30 Int)) (let ((.cse39 (* (mod (+ ~ARR_SIZE~0 4294967294) 4294967296) 4))) (let ((.cse40 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse39)) (.cse41 (* (mod (+ ~ARR_SIZE~0 (* |ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295) 4294967296) 4))) (let ((.cse34 (+ .cse41 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse37 (+ .cse41 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse36 (select .cse2 .cse40))) (let ((.cse33 (store (let ((.cse38 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse39 (- 17179869184)))) (store (store (store .cse2 .cse34 v_DerPreprocessor_29) .cse37 v_DerPreprocessor_30) .cse38 (select .cse2 .cse38))) .cse40 .cse36)) (.cse35 (select .cse2 .cse37))) (and (= (+ .cse31 |ULTIMATE.start_main_~index~0#1|) (select .cse32 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~index~0#1| 4)))) (= (select .cse33 (+ (* (mod (+ ~ARR_SIZE~0 4294967293) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (= (select .cse33 .cse34) .cse35) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (select .cse33 .cse11) 0) (not (< 3 ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (< 2 ~ARR_SIZE~0) (= (+ .cse35 |ULTIMATE.start_main_~index~0#1|) 0) (= .cse36 0)))))))) (and .cse7 (exists ((aux_div_~ARR_SIZE~0_91 Int) (v_DerPreprocessor_33 Int) (v_DerPreprocessor_34 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse50 (* (mod (+ aux_mod_~ARR_SIZE~0_91 1) 4294967296) 4))) (let ((.cse51 (+ .cse50 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse52 (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4))) (let ((.cse47 (+ .cse52 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse43 (select .cse2 .cse51)) (.cse48 (+ .cse52 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse46 (select .cse2 .cse48)) (.cse42 (store (let ((.cse49 (+ .cse50 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (store (store (store .cse2 .cse47 v_DerPreprocessor_33) .cse48 v_DerPreprocessor_34) .cse49 (select .cse2 .cse49))) .cse51 .cse43)) (.cse44 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse45 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (select .cse42 .cse11) 0) (= .cse43 0) (< .cse44 (+ .cse45 aux_mod_~ARR_SIZE~0_91 18446744056529682433)) (= (+ .cse46 2) 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (= (select .cse42 .cse47) .cse46) (<= 0 aux_mod_~ARR_SIZE~0_91) (= (select .cse42 .cse48) 0) (not (< .cse44 (+ .cse45 aux_mod_~ARR_SIZE~0_91 18446744056529682432))))))))) .cse27) (and (or (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse53 (select .cse2 (+ (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (.cse56 (* (mod (+ aux_mod_~ARR_SIZE~0_91 4294967295) 4294967296) 4)) (.cse54 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse55 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (+ .cse53 1) 0) (not (< .cse54 (+ .cse55 aux_mod_~ARR_SIZE~0_91 18446744060824649727))) (= (select .cse2 (+ .cse56 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) .cse53) (= (select .cse2 (+ .cse56 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (< .cse54 (+ .cse55 aux_mod_~ARR_SIZE~0_91 18446744060824649728)) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91)))) (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_div_aux_mod_~ARR_SIZE~0_91_39 Int) (aux_mod_aux_mod_~ARR_SIZE~0_91_39 Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse57 (+ (* aux_div_aux_mod_~ARR_SIZE~0_91_39 4294967296) aux_mod_aux_mod_~ARR_SIZE~0_91_39)) (.cse62 (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967295) (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 18446744069414584320) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse63 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse64 (* aux_div_aux_mod_~ARR_SIZE~0_91_39 18446744073709551616)) (.cse65 (* aux_mod_aux_mod_~ARR_SIZE~0_91_39 4294967296)) (.cse59 (* (mod |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967296) 4)) (.cse61 (* 4 aux_mod_aux_mod_~ARR_SIZE~0_91_39)) (.cse60 (* 4 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75|)) (.cse58 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967296)))) (and (< |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 4294967296) (< .cse57 4294967296) (<= 4294967295 .cse58) (= (select .cse2 (+ .cse59 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (= (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| (* (mod (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75| 1) 4294967296) 4))) 1) 0) (not (= .cse60 (+ (* 17179869184 aux_div_aux_mod_~ARR_SIZE~0_91_39) .cse61))) (<= 0 .cse57) (< .cse62 (+ .cse63 .cse64 .cse65 36893488125944266753)) (<= 0 aux_mod_aux_mod_~ARR_SIZE~0_91_39) (not (< .cse62 (+ .cse63 .cse64 .cse65 36893488125944266752))) (= (select .cse2 (+ (* (mod aux_mod_aux_mod_~ARR_SIZE~0_91_39 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (select .cse2 (+ .cse59 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (< aux_mod_aux_mod_~ARR_SIZE~0_91_39 4294967296) (not (= (+ .cse61 17179869180) (+ .cse60 (* 17179869184 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_87_75|)))) (<= 0 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_87_75|) (< .cse58 8589934591)))) .cse4 (exists ((aux_div_~ARR_SIZE~0_91 Int) (|aux_mod_ULTIMATE.start_main_~index~0#1_87| Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse71 (* (mod |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) 4))) (let ((.cse67 (select .cse2 (+ .cse71 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (.cse66 (select .cse2 (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~index~0#1_87| 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (.cse68 (+ (* |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967295) (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320))) (.cse69 (* aux_div_~ARR_SIZE~0_91 4294967296)) (.cse70 (* aux_mod_~ARR_SIZE~0_91 4294967296))) (and (= (+ .cse66 1) 0) (not (= (* 4 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (* 4 aux_mod_~ARR_SIZE~0_91))) (= (select .cse2 (+ (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) .cse67) (< |aux_mod_ULTIMATE.start_main_~index~0#1_87| 4294967296) (<= 0 |aux_mod_ULTIMATE.start_main_~index~0#1_87|) (= .cse67 .cse66) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse68 (+ .cse69 .cse70 18446744056529682432))) (< .cse68 (+ .cse69 .cse70 18446744056529682433)) (= (select .cse2 (+ .cse71 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0))))) (exists ((aux_div_~ARR_SIZE~0_91 Int) (aux_mod_~ARR_SIZE~0_91 Int) (|aux_div_ULTIMATE.start_main_~index~0#1_87| Int)) (let ((.cse73 (select .cse2 (+ (* (mod (+ aux_mod_~ARR_SIZE~0_91 1) 4294967296) 4) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (.cse72 (* (mod aux_mod_~ARR_SIZE~0_91 4294967296) 4)) (.cse74 (* |aux_div_ULTIMATE.start_main_~index~0#1_87| 18446744069414584320)) (.cse75 (* aux_div_~ARR_SIZE~0_91 4294967296))) (and (= (select .cse2 (+ .cse72 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) .cse73) (= (+ .cse73 1) 0) (< .cse74 (+ .cse75 aux_mod_~ARR_SIZE~0_91 18446744056529682433)) (= (select .cse2 (+ .cse72 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (< aux_mod_~ARR_SIZE~0_91 4294967296) (<= 0 aux_mod_~ARR_SIZE~0_91) (not (< .cse74 (+ .cse75 aux_mod_~ARR_SIZE~0_91 18446744056529682432))))))) .cse3 .cse5 .cse6) (and .cse7 .cse27 (exists ((v_DerPreprocessor_22 Int) (~ARR_SIZE~0 Int) (v_DerPreprocessor_42 Int) (v_DerPreprocessor_21 Int) (|ULTIMATE.start_main_~index~0#1| Int) (v_DerPreprocessor_41 Int)) (let ((.cse90 (* (mod (+ ~ARR_SIZE~0 (* |ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295) 4294967296) 4))) (let ((.cse89 (+ .cse90 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse91 (* (mod (+ ~ARR_SIZE~0 4294967293) 4294967296) 4)) (.cse92 (* (mod (+ ~ARR_SIZE~0 4294967294) 4294967296) 4))) (let ((.cse87 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse92)) (.cse85 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse92 (- 17179869184))) (.cse80 (+ .cse91 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse79 (+ .cse91 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse81 (select .cse2 .cse89)) (.cse83 (+ .cse90 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (let ((.cse78 (store (store (store (store .cse2 .cse80 v_DerPreprocessor_21) .cse79 v_DerPreprocessor_22) .cse89 .cse81) .cse83 (select .cse2 .cse83))) (.cse86 (select .cse2 .cse85)) (.cse88 (select .cse2 .cse87))) (let ((.cse82 (store (store (store (store .cse78 .cse89 v_DerPreprocessor_41) .cse83 v_DerPreprocessor_42) .cse85 .cse86) .cse87 .cse88))) (let ((.cse77 (select .cse2 .cse79)) (.cse76 (select .cse82 .cse80)) (.cse84 (select .cse82 .cse79))) (and (= .cse76 .cse77) (= v_DerPreprocessor_22 (select .cse78 .cse79)) (= v_DerPreprocessor_21 (select .cse78 .cse80)) (not (< 3 ~ARR_SIZE~0)) (= .cse81 .cse76) (< 2 ~ARR_SIZE~0) (= v_DerPreprocessor_42 (select .cse82 .cse83)) (= (+ .cse77 2) 0) (= (store (store (store (store .cse2 .cse80 .cse76) .cse79 .cse84) .cse85 .cse86) .cse87 .cse88) .cse82) (= .cse84 0) (= v_DerPreprocessor_41 (select .cse82 .cse89)) (= (select .cse82 .cse11) 0) (= .cse88 0)))))))))) (and .cse7 (exists ((v_DerPreprocessor_25 Int) (~ARR_SIZE~0 Int) (v_DerPreprocessor_26 Int) (|ULTIMATE.start_main_~index~0#1| Int)) (let ((.cse101 (* (mod (+ ~ARR_SIZE~0 4294967294) 4294967296) 4))) (let ((.cse102 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse101)) (.cse103 (* (mod (+ ~ARR_SIZE~0 (* |ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295) 4294967296) 4))) (let ((.cse94 (+ .cse103 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184))) (.cse99 (+ .cse103 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse98 (select .cse2 .cse102))) (let ((.cse93 (store (let ((.cse100 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse101 (- 17179869184)))) (store (store (store .cse2 .cse94 v_DerPreprocessor_25) .cse99 v_DerPreprocessor_26) .cse100 (select .cse2 .cse100))) .cse102 .cse98)) (.cse96 (* (mod (+ ~ARR_SIZE~0 4294967293) 4294967296) 4))) (let ((.cse95 (select .cse93 (+ .cse96 |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184)))) (.cse97 (select .cse2 .cse99))) (and (= (+ .cse31 |ULTIMATE.start_main_~index~0#1|) (select .cse32 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~index~0#1| 4)))) (= (select .cse93 .cse94) .cse95) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (select .cse93 (+ .cse96 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) 0) (not (< 3 ~ARR_SIZE~0)) (< |ULTIMATE.start_main_~index~0#1| ~ARR_SIZE~0) (= (select .cse93 .cse11) 0) (< 2 ~ARR_SIZE~0) (= (+ .cse97 |ULTIMATE.start_main_~index~0#1|) 0) (= .cse95 .cse97) (= .cse98 0)))))))))))) (= .cse1 0) (= |c_ULTIMATE.start_main_~count~0#1| 2) (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))))) is different from false [2023-02-16 00:09:46,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 4650 treesize of output 4248