./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-sorted-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-sorted-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:18:57,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:18:57,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:18:57,378 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:18:57,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:18:57,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:18:57,382 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:18:57,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:18:57,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:18:57,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:18:57,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:18:57,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:18:57,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:18:57,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:18:57,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:18:57,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:18:57,397 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:18:57,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:18:57,401 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:18:57,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:18:57,405 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:18:57,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:18:57,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:18:57,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:18:57,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:18:57,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:18:57,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:18:57,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:18:57,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:18:57,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:18:57,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:18:57,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:18:57,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:18:57,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:18:57,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:18:57,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:18:57,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:18:57,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:18:57,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:18:57,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:18:57,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:18:57,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:18:57,427 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 06:18:57,444 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:18:57,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:18:57,444 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:18:57,444 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:18:57,445 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:18:57,445 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:18:57,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:18:57,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:18:57,446 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:18:57,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:18:57,447 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:18:57,447 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:18:57,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:18:57,447 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:18:57,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:18:57,447 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:18:57,448 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:18:57,448 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:18:57,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:18:57,449 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:18:57,449 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:18:57,449 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:18:57,450 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:18:57,450 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:18:57,450 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:18:57,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:18:57,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:18:57,450 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:18:57,451 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 06:18:57,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 06:18:57,451 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 [2022-07-23 06:18:57,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:18:57,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:18:57,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:18:57,641 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:18:57,642 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:18:57,643 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-sorted-2.i [2022-07-23 06:18:57,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c4191083/7bc4460ec0d0417d84dc80acf315727e/FLAGa599a9343 [2022-07-23 06:18:58,186 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:18:58,187 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i [2022-07-23 06:18:58,197 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c4191083/7bc4460ec0d0417d84dc80acf315727e/FLAGa599a9343 [2022-07-23 06:18:58,677 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c4191083/7bc4460ec0d0417d84dc80acf315727e [2022-07-23 06:18:58,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:18:58,681 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:18:58,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:18:58,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:18:58,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:18:58,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:18:58" (1/1) ... [2022-07-23 06:18:58,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@626dfc8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:18:58, skipping insertion in model container [2022-07-23 06:18:58,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:18:58" (1/1) ... [2022-07-23 06:18:58,694 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:18:58,723 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:18:59,018 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22384,22397] [2022-07-23 06:18:59,023 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22614,22627] [2022-07-23 06:18:59,031 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22989,23002] [2022-07-23 06:18:59,032 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23053,23066] [2022-07-23 06:18:59,033 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23184,23197] [2022-07-23 06:18:59,034 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23248,23261] [2022-07-23 06:18:59,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:18:59,050 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:18:59,096 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22384,22397] [2022-07-23 06:18:59,098 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22614,22627] [2022-07-23 06:18:59,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22989,23002] [2022-07-23 06:18:59,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23053,23066] [2022-07-23 06:18:59,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23184,23197] [2022-07-23 06:18:59,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23248,23261] [2022-07-23 06:18:59,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:18:59,132 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:18:59,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:18:59 WrapperNode [2022-07-23 06:18:59,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:18:59,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:18:59,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:18:59,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:18:59,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:18:59" (1/1) ... [2022-07-23 06:18:59,154 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:18:59" (1/1) ... [2022-07-23 06:18:59,189 INFO L137 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 197 [2022-07-23 06:18:59,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:18:59,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:18:59,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:18:59,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:18:59,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:18:59" (1/1) ... [2022-07-23 06:18:59,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:18:59" (1/1) ... [2022-07-23 06:18:59,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:18:59" (1/1) ... [2022-07-23 06:18:59,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:18:59" (1/1) ... [2022-07-23 06:18:59,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:18:59" (1/1) ... [2022-07-23 06:18:59,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:18:59" (1/1) ... [2022-07-23 06:18:59,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:18:59" (1/1) ... [2022-07-23 06:18:59,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:18:59,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:18:59,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:18:59,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:18:59,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:18:59" (1/1) ... [2022-07-23 06:18:59,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:18:59,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:18:59,271 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-23 06:18:59,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-23 06:18:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 06:18:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 06:18:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:18:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 06:18:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:18:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:18:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:18:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 06:18:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:18:59,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:18:59,394 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:18:59,395 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:18:59,801 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:18:59,807 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:18:59,808 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-07-23 06:18:59,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:18:59 BoogieIcfgContainer [2022-07-23 06:18:59,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:18:59,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:18:59,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:18:59,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:18:59,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:18:58" (1/3) ... [2022-07-23 06:18:59,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3526efd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:18:59, skipping insertion in model container [2022-07-23 06:18:59,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:18:59" (2/3) ... [2022-07-23 06:18:59,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3526efd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:18:59, skipping insertion in model container [2022-07-23 06:18:59,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:18:59" (3/3) ... [2022-07-23 06:18:59,818 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2022-07-23 06:18:59,830 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:18:59,831 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2022-07-23 06:18:59,893 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:18:59,902 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3fc35264, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@18c6b68b [2022-07-23 06:18:59,902 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-07-23 06:18:59,908 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 98 states have (on average 2.183673469387755) internal successors, (214), 178 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:18:59,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 06:18:59,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:18:59,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 06:18:59,927 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:18:59,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:18:59,934 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-23 06:18:59,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:18:59,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127975895] [2022-07-23 06:18:59,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:18:59,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:19:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:00,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:19:00,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:19:00,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127975895] [2022-07-23 06:19:00,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127975895] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:19:00,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:19:00,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:19:00,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070141337] [2022-07-23 06:19:00,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:19:00,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:19:00,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:19:00,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:19:00,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:19:00,142 INFO L87 Difference]: Start difference. First operand has 179 states, 98 states have (on average 2.183673469387755) internal successors, (214), 178 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:00,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:00,321 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2022-07-23 06:19:00,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:19:00,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-23 06:19:00,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:00,334 INFO L225 Difference]: With dead ends: 182 [2022-07-23 06:19:00,334 INFO L226 Difference]: Without dead ends: 178 [2022-07-23 06:19:00,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:19:00,340 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 172 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:00,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 118 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:19:00,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-23 06:19:00,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2022-07-23 06:19:00,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 97 states have (on average 1.907216494845361) internal successors, (185), 173 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 185 transitions. [2022-07-23 06:19:00,396 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 185 transitions. Word has length 3 [2022-07-23 06:19:00,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:00,397 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 185 transitions. [2022-07-23 06:19:00,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:00,398 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 185 transitions. [2022-07-23 06:19:00,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 06:19:00,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:00,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 06:19:00,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 06:19:00,400 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:19:00,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:00,400 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-23 06:19:00,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:19:00,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698538931] [2022-07-23 06:19:00,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:00,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:19:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:00,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:19:00,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:19:00,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698538931] [2022-07-23 06:19:00,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698538931] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:19:00,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:19:00,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:19:00,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648522603] [2022-07-23 06:19:00,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:19:00,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:19:00,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:19:00,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:19:00,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:19:00,489 INFO L87 Difference]: Start difference. First operand 174 states and 185 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:00,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:00,607 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2022-07-23 06:19:00,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:19:00,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-23 06:19:00,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:00,612 INFO L225 Difference]: With dead ends: 175 [2022-07-23 06:19:00,612 INFO L226 Difference]: Without dead ends: 175 [2022-07-23 06:19:00,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:19:00,616 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 167 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:00,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 116 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:19:00,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-23 06:19:00,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2022-07-23 06:19:00,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 97 states have (on average 1.8762886597938144) internal successors, (182), 170 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:00,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 182 transitions. [2022-07-23 06:19:00,637 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 182 transitions. Word has length 3 [2022-07-23 06:19:00,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:00,637 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 182 transitions. [2022-07-23 06:19:00,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:00,641 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 182 transitions. [2022-07-23 06:19:00,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 06:19:00,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:00,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:00,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 06:19:00,642 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:19:00,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:00,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2022-07-23 06:19:00,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:19:00,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336158308] [2022-07-23 06:19:00,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:00,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:19:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:00,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:19:00,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:19:00,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336158308] [2022-07-23 06:19:00,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336158308] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:19:00,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:19:00,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:19:00,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912728352] [2022-07-23 06:19:00,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:19:00,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:19:00,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:19:00,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:19:00,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:19:00,745 INFO L87 Difference]: Start difference. First operand 171 states and 182 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:00,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:00,918 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2022-07-23 06:19:00,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:19:00,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-23 06:19:00,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:00,919 INFO L225 Difference]: With dead ends: 178 [2022-07-23 06:19:00,919 INFO L226 Difference]: Without dead ends: 178 [2022-07-23 06:19:00,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:19:00,921 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 294 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:00,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 89 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:19:00,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-23 06:19:00,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 167. [2022-07-23 06:19:00,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 111 states have (on average 1.7027027027027026) internal successors, (189), 166 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:00,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 189 transitions. [2022-07-23 06:19:00,927 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 189 transitions. Word has length 9 [2022-07-23 06:19:00,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:00,927 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 189 transitions. [2022-07-23 06:19:00,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:00,927 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 189 transitions. [2022-07-23 06:19:00,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 06:19:00,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:00,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:00,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 06:19:00,928 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:19:00,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:00,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2022-07-23 06:19:00,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:19:00,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545772948] [2022-07-23 06:19:00,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:00,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:19:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:01,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:19:01,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:19:01,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545772948] [2022-07-23 06:19:01,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545772948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:19:01,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:19:01,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:19:01,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225423556] [2022-07-23 06:19:01,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:19:01,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:19:01,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:19:01,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:19:01,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:19:01,051 INFO L87 Difference]: Start difference. First operand 167 states and 189 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:01,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:01,315 INFO L93 Difference]: Finished difference Result 258 states and 282 transitions. [2022-07-23 06:19:01,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:19:01,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-23 06:19:01,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:01,317 INFO L225 Difference]: With dead ends: 258 [2022-07-23 06:19:01,317 INFO L226 Difference]: Without dead ends: 258 [2022-07-23 06:19:01,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:19:01,318 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 437 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:01,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 130 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:19:01,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-23 06:19:01,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 220. [2022-07-23 06:19:01,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 164 states have (on average 1.6097560975609757) internal successors, (264), 219 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 264 transitions. [2022-07-23 06:19:01,323 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 264 transitions. Word has length 9 [2022-07-23 06:19:01,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:01,324 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 264 transitions. [2022-07-23 06:19:01,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 264 transitions. [2022-07-23 06:19:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 06:19:01,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:01,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:01,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 06:19:01,325 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:19:01,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:01,325 INFO L85 PathProgramCache]: Analyzing trace with hash 233093812, now seen corresponding path program 1 times [2022-07-23 06:19:01,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:19:01,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323264729] [2022-07-23 06:19:01,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:01,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:19:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:01,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:19:01,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:19:01,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323264729] [2022-07-23 06:19:01,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323264729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:19:01,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:19:01,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:19:01,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849430939] [2022-07-23 06:19:01,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:19:01,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:19:01,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:19:01,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:19:01,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:19:01,355 INFO L87 Difference]: Start difference. First operand 220 states and 264 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:01,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:01,370 INFO L93 Difference]: Finished difference Result 266 states and 313 transitions. [2022-07-23 06:19:01,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:19:01,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-23 06:19:01,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:01,372 INFO L225 Difference]: With dead ends: 266 [2022-07-23 06:19:01,372 INFO L226 Difference]: Without dead ends: 266 [2022-07-23 06:19:01,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:19:01,373 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 120 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:01,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 235 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:19:01,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-23 06:19:01,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 233. [2022-07-23 06:19:01,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 177 states have (on average 1.6045197740112995) internal successors, (284), 232 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 284 transitions. [2022-07-23 06:19:01,378 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 284 transitions. Word has length 11 [2022-07-23 06:19:01,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:01,379 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 284 transitions. [2022-07-23 06:19:01,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:01,379 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 284 transitions. [2022-07-23 06:19:01,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 06:19:01,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:01,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:01,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 06:19:01,380 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:19:01,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:01,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2022-07-23 06:19:01,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:19:01,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278552780] [2022-07-23 06:19:01,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:01,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:19:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:01,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:19:01,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:19:01,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278552780] [2022-07-23 06:19:01,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278552780] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:19:01,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:19:01,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:19:01,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957673178] [2022-07-23 06:19:01,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:19:01,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:19:01,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:19:01,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:19:01,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:19:01,453 INFO L87 Difference]: Start difference. First operand 233 states and 284 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:01,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:01,658 INFO L93 Difference]: Finished difference Result 232 states and 281 transitions. [2022-07-23 06:19:01,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:19:01,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-23 06:19:01,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:01,659 INFO L225 Difference]: With dead ends: 232 [2022-07-23 06:19:01,659 INFO L226 Difference]: Without dead ends: 232 [2022-07-23 06:19:01,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:19:01,661 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 6 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:01,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 406 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:19:01,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-23 06:19:01,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2022-07-23 06:19:01,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 177 states have (on average 1.5875706214689265) internal successors, (281), 231 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:01,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 281 transitions. [2022-07-23 06:19:01,666 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 281 transitions. Word has length 12 [2022-07-23 06:19:01,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:01,666 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 281 transitions. [2022-07-23 06:19:01,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:01,666 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 281 transitions. [2022-07-23 06:19:01,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 06:19:01,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:01,667 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:01,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 06:19:01,667 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:19:01,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:01,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2022-07-23 06:19:01,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:19:01,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074665811] [2022-07-23 06:19:01,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:01,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:19:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:01,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:19:01,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:19:01,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074665811] [2022-07-23 06:19:01,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074665811] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:19:01,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:19:01,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:19:01,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196381128] [2022-07-23 06:19:01,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:19:01,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:19:01,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:19:01,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:19:01,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:19:01,722 INFO L87 Difference]: Start difference. First operand 232 states and 281 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:01,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:01,892 INFO L93 Difference]: Finished difference Result 231 states and 278 transitions. [2022-07-23 06:19:01,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:19:01,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-23 06:19:01,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:01,894 INFO L225 Difference]: With dead ends: 231 [2022-07-23 06:19:01,894 INFO L226 Difference]: Without dead ends: 231 [2022-07-23 06:19:01,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:19:01,895 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 7 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:01,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 426 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:19:01,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-23 06:19:01,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2022-07-23 06:19:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 177 states have (on average 1.5706214689265536) internal successors, (278), 230 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:01,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 278 transitions. [2022-07-23 06:19:01,899 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 278 transitions. Word has length 12 [2022-07-23 06:19:01,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:01,899 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 278 transitions. [2022-07-23 06:19:01,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:01,899 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 278 transitions. [2022-07-23 06:19:01,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-23 06:19:01,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:01,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:01,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 06:19:01,900 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:19:01,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:01,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2022-07-23 06:19:01,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:19:01,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262484953] [2022-07-23 06:19:01,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:01,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:19:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:02,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:19:02,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:19:02,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262484953] [2022-07-23 06:19:02,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262484953] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:19:02,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:19:02,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 06:19:02,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395934893] [2022-07-23 06:19:02,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:19:02,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:19:02,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:19:02,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:19:02,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:19:02,018 INFO L87 Difference]: Start difference. First operand 231 states and 278 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:02,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:02,364 INFO L93 Difference]: Finished difference Result 237 states and 279 transitions. [2022-07-23 06:19:02,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:19:02,364 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-23 06:19:02,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:02,366 INFO L225 Difference]: With dead ends: 237 [2022-07-23 06:19:02,366 INFO L226 Difference]: Without dead ends: 237 [2022-07-23 06:19:02,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-23 06:19:02,367 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 291 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:02,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 289 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:19:02,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-07-23 06:19:02,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 230. [2022-07-23 06:19:02,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 177 states have (on average 1.5593220338983051) internal successors, (276), 229 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:02,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 276 transitions. [2022-07-23 06:19:02,374 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 276 transitions. Word has length 16 [2022-07-23 06:19:02,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:02,374 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 276 transitions. [2022-07-23 06:19:02,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:02,375 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 276 transitions. [2022-07-23 06:19:02,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-23 06:19:02,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:02,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:02,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 06:19:02,376 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:19:02,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:02,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2022-07-23 06:19:02,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:19:02,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066708537] [2022-07-23 06:19:02,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:02,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:19:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:19:02,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:19:02,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066708537] [2022-07-23 06:19:02,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066708537] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:19:02,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:19:02,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 06:19:02,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097063884] [2022-07-23 06:19:02,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:19:02,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:19:02,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:19:02,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:19:02,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:19:02,525 INFO L87 Difference]: Start difference. First operand 230 states and 276 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:03,038 INFO L93 Difference]: Finished difference Result 232 states and 270 transitions. [2022-07-23 06:19:03,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 06:19:03,039 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-23 06:19:03,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:03,040 INFO L225 Difference]: With dead ends: 232 [2022-07-23 06:19:03,040 INFO L226 Difference]: Without dead ends: 232 [2022-07-23 06:19:03,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-07-23 06:19:03,041 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 288 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:03,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 388 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:19:03,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-23 06:19:03,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 216. [2022-07-23 06:19:03,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 169 states have (on average 1.5266272189349113) internal successors, (258), 215 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:03,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 258 transitions. [2022-07-23 06:19:03,044 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 258 transitions. Word has length 16 [2022-07-23 06:19:03,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:03,045 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 258 transitions. [2022-07-23 06:19:03,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:03,045 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 258 transitions. [2022-07-23 06:19:03,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-23 06:19:03,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:03,045 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:03,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 06:19:03,046 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:19:03,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:03,046 INFO L85 PathProgramCache]: Analyzing trace with hash -961820477, now seen corresponding path program 1 times [2022-07-23 06:19:03,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:19:03,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587810352] [2022-07-23 06:19:03,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:03,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:19:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:03,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:19:03,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:19:03,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587810352] [2022-07-23 06:19:03,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587810352] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:19:03,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:19:03,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:19:03,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722191064] [2022-07-23 06:19:03,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:19:03,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:19:03,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:19:03,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:19:03,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:19:03,092 INFO L87 Difference]: Start difference. First operand 216 states and 258 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:03,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:03,205 INFO L93 Difference]: Finished difference Result 253 states and 276 transitions. [2022-07-23 06:19:03,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:19:03,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-23 06:19:03,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:03,206 INFO L225 Difference]: With dead ends: 253 [2022-07-23 06:19:03,208 INFO L226 Difference]: Without dead ends: 253 [2022-07-23 06:19:03,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:19:03,209 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 295 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:03,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 202 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:19:03,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-07-23 06:19:03,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 214. [2022-07-23 06:19:03,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 168 states have (on average 1.5119047619047619) internal successors, (254), 213 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:03,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 254 transitions. [2022-07-23 06:19:03,212 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 254 transitions. Word has length 25 [2022-07-23 06:19:03,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:03,212 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 254 transitions. [2022-07-23 06:19:03,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:03,213 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 254 transitions. [2022-07-23 06:19:03,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-23 06:19:03,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:03,213 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:03,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 06:19:03,213 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:19:03,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:03,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1496912174, now seen corresponding path program 1 times [2022-07-23 06:19:03,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:19:03,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353177793] [2022-07-23 06:19:03,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:03,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:19:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:03,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:19:03,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:19:03,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353177793] [2022-07-23 06:19:03,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353177793] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:19:03,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748997177] [2022-07-23 06:19:03,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:03,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:19:03,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:19:03,400 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:19:03,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-23 06:19:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:03,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-23 06:19:03,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:19:03,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:19:03,659 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:19:03,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:19:03,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:19:03,771 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:19:03,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-23 06:19:03,832 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:19:03,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-07-23 06:19:03,877 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:19:03,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-23 06:19:03,993 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:19:03,994 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:19:03,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-07-23 06:19:04,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:19:04,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:19:04,187 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-07-23 06:19:04,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-23 06:19:04,199 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_71|)))) is different from false [2022-07-23 06:19:04,209 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_#t~mem5#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_71|)))) is different from false [2022-07-23 06:19:04,222 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_71|)))) is different from false [2022-07-23 06:19:04,242 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_334 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_334))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) .cse1))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_71|)))) is different from false [2022-07-23 06:19:04,254 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_334 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_71|)) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_334))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)))))) is different from false [2022-07-23 06:19:04,277 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:19:04,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 36 [2022-07-23 06:19:04,285 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:19:04,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 137 [2022-07-23 06:19:04,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2022-07-23 06:19:04,298 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:19:04,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 102 [2022-07-23 06:19:04,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:19:04,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748997177] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:19:04,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:19:04,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2022-07-23 06:19:04,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836612058] [2022-07-23 06:19:04,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:19:04,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-23 06:19:04,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:19:04,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-23 06:19:04,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=781, Unknown=7, NotChecked=300, Total=1190 [2022-07-23 06:19:04,627 INFO L87 Difference]: Start difference. First operand 214 states and 254 transitions. Second operand has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:05,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:05,964 INFO L93 Difference]: Finished difference Result 505 states and 581 transitions. [2022-07-23 06:19:05,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-23 06:19:05,965 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-23 06:19:05,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:05,967 INFO L225 Difference]: With dead ends: 505 [2022-07-23 06:19:05,967 INFO L226 Difference]: Without dead ends: 505 [2022-07-23 06:19:05,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=354, Invalid=1729, Unknown=7, NotChecked=460, Total=2550 [2022-07-23 06:19:05,968 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 773 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 1611 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 3581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1883 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:05,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1654 Invalid, 3581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1611 Invalid, 0 Unknown, 1883 Unchecked, 0.7s Time] [2022-07-23 06:19:05,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-07-23 06:19:05,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 239. [2022-07-23 06:19:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 193 states have (on average 1.471502590673575) internal successors, (284), 238 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 284 transitions. [2022-07-23 06:19:05,974 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 284 transitions. Word has length 31 [2022-07-23 06:19:05,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:05,974 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 284 transitions. [2022-07-23 06:19:05,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:05,974 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 284 transitions. [2022-07-23 06:19:05,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-23 06:19:05,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:05,978 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:06,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-23 06:19:06,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-23 06:19:06,184 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:19:06,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:06,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1496912173, now seen corresponding path program 1 times [2022-07-23 06:19:06,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:19:06,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644876118] [2022-07-23 06:19:06,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:06,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:19:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:06,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:19:06,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:19:06,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644876118] [2022-07-23 06:19:06,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644876118] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:19:06,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259491636] [2022-07-23 06:19:06,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:06,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:19:06,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:19:06,401 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:19:06,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-23 06:19:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:06,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-23 06:19:06,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:19:06,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:19:06,533 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:19:06,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:19:06,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:19:06,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:19:06,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:19:06,658 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:19:06,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-23 06:19:06,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 06:19:06,736 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:19:06,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-23 06:19:06,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:19:06,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:19:06,796 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:19:06,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-23 06:19:06,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 06:19:06,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:19:06,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:19:06,919 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:19:06,921 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:19:06,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-07-23 06:19:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:19:06,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:19:07,137 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int) (v_ArrVal_440 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_440) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) (forall ((v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|) 8)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|))))) is different from false [2022-07-23 06:19:07,208 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|) 8)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) (forall ((v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int) (v_ArrVal_440 (Array Int Int))) (or (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_440) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|))))) is different from false [2022-07-23 06:19:07,240 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|) 8)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) (forall ((v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int) (v_ArrVal_440 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_440) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|))))) is different from false [2022-07-23 06:19:07,269 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int) (v_ArrVal_440 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_435))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_436) .cse0 v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_440) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_436) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|) 8)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|))))) is different from false [2022-07-23 06:19:07,286 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int) (v_ArrVal_440 (Array Int Int))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_435))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_436) .cse1 v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_440) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|)))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (+ 8 (select (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_436) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_435) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_439)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|))))) is different from false [2022-07-23 06:19:07,310 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:19:07,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-07-23 06:19:07,314 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:19:07,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-07-23 06:19:07,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-07-23 06:19:07,325 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:19:07,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 181 [2022-07-23 06:19:07,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 156 [2022-07-23 06:19:07,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 126 [2022-07-23 06:19:07,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2022-07-23 06:19:07,430 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:19:07,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2022-07-23 06:19:07,436 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:19:07,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2022-07-23 06:19:07,439 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:19:07,440 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:19:07,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:19:07,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:19:07,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2022-07-23 06:19:07,445 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:19:07,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:19:07,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:19:07,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-07-23 06:19:07,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-07-23 06:19:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:19:07,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259491636] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:19:07,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:19:07,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2022-07-23 06:19:07,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996997113] [2022-07-23 06:19:07,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:19:07,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-23 06:19:07,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:19:07,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-23 06:19:07,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=826, Unknown=5, NotChecked=310, Total=1260 [2022-07-23 06:19:07,653 INFO L87 Difference]: Start difference. First operand 239 states and 284 transitions. Second operand has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:09,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:09,277 INFO L93 Difference]: Finished difference Result 418 states and 475 transitions. [2022-07-23 06:19:09,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-23 06:19:09,277 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-23 06:19:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:09,278 INFO L225 Difference]: With dead ends: 418 [2022-07-23 06:19:09,279 INFO L226 Difference]: Without dead ends: 418 [2022-07-23 06:19:09,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 44 SyntacticMatches, 9 SemanticMatches, 56 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=486, Invalid=2285, Unknown=5, NotChecked=530, Total=3306 [2022-07-23 06:19:09,281 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 1272 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 2897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1510 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:09,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 1030 Invalid, 2897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1292 Invalid, 0 Unknown, 1510 Unchecked, 0.7s Time] [2022-07-23 06:19:09,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-07-23 06:19:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 239. [2022-07-23 06:19:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 193 states have (on average 1.4663212435233162) internal successors, (283), 238 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:09,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 283 transitions. [2022-07-23 06:19:09,287 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 283 transitions. Word has length 31 [2022-07-23 06:19:09,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:09,288 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 283 transitions. [2022-07-23 06:19:09,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:09,288 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 283 transitions. [2022-07-23 06:19:09,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-23 06:19:09,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:09,292 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:09,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-23 06:19:09,508 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,SelfDestructingSolverStorable11 [2022-07-23 06:19:09,509 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:19:09,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:09,509 INFO L85 PathProgramCache]: Analyzing trace with hash 290187840, now seen corresponding path program 1 times [2022-07-23 06:19:09,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:19:09,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312789312] [2022-07-23 06:19:09,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:09,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:19:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:09,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:19:09,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:19:09,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312789312] [2022-07-23 06:19:09,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312789312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:19:09,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:19:09,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:19:09,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887644408] [2022-07-23 06:19:09,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:19:09,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:19:09,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:19:09,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:19:09,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:19:09,538 INFO L87 Difference]: Start difference. First operand 239 states and 283 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:09,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:09,543 INFO L93 Difference]: Finished difference Result 241 states and 285 transitions. [2022-07-23 06:19:09,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:19:09,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-23 06:19:09,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:09,545 INFO L225 Difference]: With dead ends: 241 [2022-07-23 06:19:09,545 INFO L226 Difference]: Without dead ends: 241 [2022-07-23 06:19:09,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:19:09,547 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:09,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:19:09,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-07-23 06:19:09,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-07-23 06:19:09,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 195 states have (on average 1.4615384615384615) internal successors, (285), 240 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:09,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 285 transitions. [2022-07-23 06:19:09,551 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 285 transitions. Word has length 33 [2022-07-23 06:19:09,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:09,552 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 285 transitions. [2022-07-23 06:19:09,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:09,552 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 285 transitions. [2022-07-23 06:19:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:19:09,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:09,554 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:09,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 06:19:09,554 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:19:09,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash 2033494590, now seen corresponding path program 1 times [2022-07-23 06:19:09,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:19:09,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635818097] [2022-07-23 06:19:09,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:09,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:19:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:19:09,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:19:09,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635818097] [2022-07-23 06:19:09,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635818097] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:19:09,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:19:09,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:19:09,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049483820] [2022-07-23 06:19:09,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:19:09,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:19:09,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:19:09,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:19:09,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:19:09,661 INFO L87 Difference]: Start difference. First operand 241 states and 285 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:09,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:09,817 INFO L93 Difference]: Finished difference Result 258 states and 304 transitions. [2022-07-23 06:19:09,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:19:09,818 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-23 06:19:09,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:09,819 INFO L225 Difference]: With dead ends: 258 [2022-07-23 06:19:09,819 INFO L226 Difference]: Without dead ends: 258 [2022-07-23 06:19:09,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:19:09,819 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 49 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:09,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 554 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:19:09,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-23 06:19:09,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 249. [2022-07-23 06:19:09,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 203 states have (on average 1.4482758620689655) internal successors, (294), 248 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:09,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 294 transitions. [2022-07-23 06:19:09,823 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 294 transitions. Word has length 36 [2022-07-23 06:19:09,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:09,823 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 294 transitions. [2022-07-23 06:19:09,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:09,823 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 294 transitions. [2022-07-23 06:19:09,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:19:09,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:09,823 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:09,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 06:19:09,823 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:19:09,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:09,824 INFO L85 PathProgramCache]: Analyzing trace with hash 2033554172, now seen corresponding path program 1 times [2022-07-23 06:19:09,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:19:09,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852759482] [2022-07-23 06:19:09,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:09,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:19:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:09,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:19:09,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:19:09,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852759482] [2022-07-23 06:19:09,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852759482] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:19:09,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:19:09,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:19:09,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103526389] [2022-07-23 06:19:09,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:19:09,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:19:09,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:19:09,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:19:09,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:19:09,858 INFO L87 Difference]: Start difference. First operand 249 states and 294 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:09,900 INFO L93 Difference]: Finished difference Result 246 states and 286 transitions. [2022-07-23 06:19:09,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:19:09,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-23 06:19:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:09,902 INFO L225 Difference]: With dead ends: 246 [2022-07-23 06:19:09,902 INFO L226 Difference]: Without dead ends: 246 [2022-07-23 06:19:09,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:19:09,903 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 78 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:09,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 170 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:19:09,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-07-23 06:19:09,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2022-07-23 06:19:09,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 203 states have (on average 1.4088669950738917) internal successors, (286), 244 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 286 transitions. [2022-07-23 06:19:09,906 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 286 transitions. Word has length 36 [2022-07-23 06:19:09,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:09,906 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 286 transitions. [2022-07-23 06:19:09,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:09,907 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 286 transitions. [2022-07-23 06:19:09,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:19:09,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:09,907 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:09,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 06:19:09,907 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:19:09,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:09,908 INFO L85 PathProgramCache]: Analyzing trace with hash 2033554173, now seen corresponding path program 1 times [2022-07-23 06:19:09,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:19:09,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291773297] [2022-07-23 06:19:09,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:09,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:19:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:09,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:19:09,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:19:09,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291773297] [2022-07-23 06:19:09,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291773297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:19:09,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:19:09,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:19:09,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988394737] [2022-07-23 06:19:09,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:19:09,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:19:09,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:19:09,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:19:09,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:19:09,937 INFO L87 Difference]: Start difference. First operand 245 states and 286 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:09,983 INFO L93 Difference]: Finished difference Result 241 states and 278 transitions. [2022-07-23 06:19:09,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:19:09,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-23 06:19:09,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:09,984 INFO L225 Difference]: With dead ends: 241 [2022-07-23 06:19:09,984 INFO L226 Difference]: Without dead ends: 241 [2022-07-23 06:19:09,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:19:09,985 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 82 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:09,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 148 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:19:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-07-23 06:19:09,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-07-23 06:19:09,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 203 states have (on average 1.3694581280788178) internal successors, (278), 240 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 278 transitions. [2022-07-23 06:19:09,989 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 278 transitions. Word has length 36 [2022-07-23 06:19:09,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:09,989 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 278 transitions. [2022-07-23 06:19:09,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:09,990 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 278 transitions. [2022-07-23 06:19:09,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:19:09,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:09,990 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:09,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 06:19:09,990 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:19:09,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:09,991 INFO L85 PathProgramCache]: Analyzing trace with hash 817273180, now seen corresponding path program 1 times [2022-07-23 06:19:09,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:19:09,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982571355] [2022-07-23 06:19:09,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:09,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:19:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:10,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:19:10,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:19:10,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982571355] [2022-07-23 06:19:10,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982571355] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:19:10,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:19:10,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:19:10,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550083973] [2022-07-23 06:19:10,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:19:10,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:19:10,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:19:10,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:19:10,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:19:10,041 INFO L87 Difference]: Start difference. First operand 241 states and 278 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:10,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:10,216 INFO L93 Difference]: Finished difference Result 261 states and 299 transitions. [2022-07-23 06:19:10,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:19:10,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-23 06:19:10,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:10,221 INFO L225 Difference]: With dead ends: 261 [2022-07-23 06:19:10,221 INFO L226 Difference]: Without dead ends: 261 [2022-07-23 06:19:10,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:19:10,222 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 114 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:10,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 335 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:19:10,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-23 06:19:10,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 240. [2022-07-23 06:19:10,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 203 states have (on average 1.3645320197044335) internal successors, (277), 239 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:10,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 277 transitions. [2022-07-23 06:19:10,225 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 277 transitions. Word has length 36 [2022-07-23 06:19:10,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:10,225 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 277 transitions. [2022-07-23 06:19:10,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:10,225 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 277 transitions. [2022-07-23 06:19:10,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:19:10,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:10,225 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:10,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-23 06:19:10,226 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:19:10,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:10,226 INFO L85 PathProgramCache]: Analyzing trace with hash 817273181, now seen corresponding path program 1 times [2022-07-23 06:19:10,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:19:10,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754337969] [2022-07-23 06:19:10,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:10,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:19:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:19:10,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:19:10,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754337969] [2022-07-23 06:19:10,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754337969] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:19:10,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269563456] [2022-07-23 06:19:10,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:10,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:19:10,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:19:10,427 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:19:10,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-23 06:19:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:10,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-23 06:19:10,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:19:10,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:19:10,564 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:19:10,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:19:10,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:19:10,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:19:10,665 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:19:10,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-23 06:19:10,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 06:19:10,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-23 06:19:10,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:19:10,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:19:10,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-23 06:19:10,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:19:10,894 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:19:10,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 17 [2022-07-23 06:19:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:19:10,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:19:11,014 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:19:11,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-07-23 06:19:11,160 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_80| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_80| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_80|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_777) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_80|)))) is different from false [2022-07-23 06:19:11,195 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_80| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_80| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_80|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_777) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_80|)))) is different from false [2022-07-23 06:19:11,204 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_80| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_80| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_80|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_777) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_80|)))) is different from false [2022-07-23 06:19:11,226 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_80| Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (or (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_775) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_774) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_777) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_80|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_80| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_80|)))) is different from false [2022-07-23 06:19:11,237 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_80| Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (or (<= 0 (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_775) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_774) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_777)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_80|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_80| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_80|)))) is different from false [2022-07-23 06:19:11,251 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:19:11,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-07-23 06:19:11,257 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:19:11,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-23 06:19:11,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-07-23 06:19:11,274 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:19:11,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 161 [2022-07-23 06:19:11,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 136 [2022-07-23 06:19:11,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2022-07-23 06:19:11,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 98 [2022-07-23 06:19:11,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:19:11,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269563456] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:19:11,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:19:11,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 44 [2022-07-23 06:19:11,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984594294] [2022-07-23 06:19:11,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:19:11,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-23 06:19:11,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:19:11,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-23 06:19:11,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1396, Unknown=5, NotChecked=400, Total=1980 [2022-07-23 06:19:11,571 INFO L87 Difference]: Start difference. First operand 240 states and 277 transitions. Second operand has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 45 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:13,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:13,288 INFO L93 Difference]: Finished difference Result 346 states and 392 transitions. [2022-07-23 06:19:13,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-23 06:19:13,289 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 45 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-23 06:19:13,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:13,290 INFO L225 Difference]: With dead ends: 346 [2022-07-23 06:19:13,290 INFO L226 Difference]: Without dead ends: 346 [2022-07-23 06:19:13,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1218 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=670, Invalid=3766, Unknown=6, NotChecked=670, Total=5112 [2022-07-23 06:19:13,292 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 417 mSDsluCounter, 1664 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 2799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1310 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:13,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1785 Invalid, 2799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1362 Invalid, 0 Unknown, 1310 Unchecked, 0.8s Time] [2022-07-23 06:19:13,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-07-23 06:19:13,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 227. [2022-07-23 06:19:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 197 states have (on average 1.3248730964467006) internal successors, (261), 226 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:13,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 261 transitions. [2022-07-23 06:19:13,299 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 261 transitions. Word has length 36 [2022-07-23 06:19:13,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:13,299 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 261 transitions. [2022-07-23 06:19:13,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 45 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:13,299 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 261 transitions. [2022-07-23 06:19:13,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-23 06:19:13,300 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:13,300 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:13,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-23 06:19:13,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-23 06:19:13,516 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:19:13,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:13,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1419322487, now seen corresponding path program 1 times [2022-07-23 06:19:13,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:19:13,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476857739] [2022-07-23 06:19:13,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:13,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:19:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:19:13,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:19:13,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476857739] [2022-07-23 06:19:13,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476857739] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:19:13,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:19:13,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:19:13,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102186706] [2022-07-23 06:19:13,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:19:13,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:19:13,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:19:13,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:19:13,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:19:13,589 INFO L87 Difference]: Start difference. First operand 227 states and 261 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:13,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:13,780 INFO L93 Difference]: Finished difference Result 247 states and 282 transitions. [2022-07-23 06:19:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:19:13,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-23 06:19:13,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:13,781 INFO L225 Difference]: With dead ends: 247 [2022-07-23 06:19:13,782 INFO L226 Difference]: Without dead ends: 247 [2022-07-23 06:19:13,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:19:13,782 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 101 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:13,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 334 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:19:13,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-23 06:19:13,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 233. [2022-07-23 06:19:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 203 states have (on average 1.3300492610837438) internal successors, (270), 232 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 270 transitions. [2022-07-23 06:19:13,789 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 270 transitions. Word has length 40 [2022-07-23 06:19:13,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:13,789 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 270 transitions. [2022-07-23 06:19:13,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:13,789 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 270 transitions. [2022-07-23 06:19:13,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-23 06:19:13,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:13,790 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:13,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-23 06:19:13,790 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:19:13,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:13,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1419322486, now seen corresponding path program 1 times [2022-07-23 06:19:13,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:19:13,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734957554] [2022-07-23 06:19:13,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:13,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:19:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:19:14,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:19:14,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734957554] [2022-07-23 06:19:14,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734957554] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:19:14,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396119081] [2022-07-23 06:19:14,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:14,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:19:14,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:19:14,028 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:19:14,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-23 06:19:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:14,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-23 06:19:14,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:19:14,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-23 06:19:14,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 06:19:14,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:19:14,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:19:14,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396119081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:19:14,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 06:19:14,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2022-07-23 06:19:14,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871075285] [2022-07-23 06:19:14,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:19:14,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:19:14,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:19:14,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:19:14,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2022-07-23 06:19:14,292 INFO L87 Difference]: Start difference. First operand 233 states and 270 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:14,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:19:14,533 INFO L93 Difference]: Finished difference Result 242 states and 277 transitions. [2022-07-23 06:19:14,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:19:14,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-23 06:19:14,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:19:14,534 INFO L225 Difference]: With dead ends: 242 [2022-07-23 06:19:14,535 INFO L226 Difference]: Without dead ends: 242 [2022-07-23 06:19:14,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-07-23 06:19:14,536 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 53 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:19:14,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 412 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:19:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-23 06:19:14,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 231. [2022-07-23 06:19:14,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 203 states have (on average 1.3054187192118227) internal successors, (265), 230 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:14,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 265 transitions. [2022-07-23 06:19:14,541 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 265 transitions. Word has length 40 [2022-07-23 06:19:14,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:19:14,541 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 265 transitions. [2022-07-23 06:19:14,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:19:14,542 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 265 transitions. [2022-07-23 06:19:14,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-23 06:19:14,542 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:19:14,542 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:19:14,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-23 06:19:14,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:19:14,760 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:19:14,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:19:14,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1458488866, now seen corresponding path program 1 times [2022-07-23 06:19:14,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:19:14,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132109395] [2022-07-23 06:19:14,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:14,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:19:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:15,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:19:15,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:19:15,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132109395] [2022-07-23 06:19:15,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132109395] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:19:15,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259095880] [2022-07-23 06:19:15,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:19:15,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:19:15,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:19:15,040 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:19:15,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-23 06:19:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:19:15,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-23 06:19:15,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:19:15,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:19:15,246 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:19:15,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:19:15,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:19:15,339 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:19:15,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-23 06:19:15,416 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-23 06:19:15,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2022-07-23 06:19:15,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-23 06:19:15,501 INFO L356 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2022-07-23 06:19:15,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 70 [2022-07-23 06:19:15,512 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-23 06:19:15,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 52 [2022-07-23 06:19:15,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:19:15,835 INFO L356 Elim1Store]: treesize reduction 81, result has 8.0 percent of original size [2022-07-23 06:19:15,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 45 [2022-07-23 06:19:15,840 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:19:15,846 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:19:15,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 16 [2022-07-23 06:19:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:19:15,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:19:38,066 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:19:38,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 810 treesize of output 629 [2022-07-23 06:19:39,358 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:19:39,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 6311 treesize of output 4269 [2022-07-23 06:20:25,074 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse6 (not .cse5))) (let ((.cse42 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse193 (+ 8 v_arrayElimIndex_15))) (or (= .cse193 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (let ((.cse194 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse194 (select (select (store |c_#memory_$Pointer$.base| .cse194 (store (store (select |c_#memory_$Pointer$.base| .cse194) v_arrayElimIndex_15 0) .cse193 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse71 (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse191 (let ((.cse192 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse192 (store (store (select |c_#memory_$Pointer$.base| .cse192) |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019))))) (select .cse191 (select (select .cse191 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) 0) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse6)) (.cse20 (< |c_ULTIMATE.start_main_~head~0#1.offset| 0)) (.cse72 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (or (= (+ 8 v_arrayElimCell_71) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse189 (let ((.cse190 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse190 (store (store (select |c_#memory_$Pointer$.base| .cse190) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse189 (select (select .cse189 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse87 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse186 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)))) (let ((.cse185 (let ((.cse187 (let ((.cse188 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse188 (store (store (select |c_#memory_$Pointer$.base| .cse188) .cse186 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019))))) (select .cse187 (select (select .cse187 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse185 .cse186) 0) (= (select .cse185 v_ArrVal_1017) 0))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse10 (= |c_ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse130 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse183 (let ((.cse184 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse184 (store (store (select |c_#memory_$Pointer$.base| .cse184) v_arrayElimCell_72 0) (+ 8 v_arrayElimCell_72) v_ArrVal_1019))))) (select .cse183 (select (select .cse183 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse131 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse181 (let ((.cse182 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse182 (store (store (select |c_#memory_$Pointer$.base| .cse182) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse181 (select (select .cse181 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse88 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse178 (let ((.cse179 (let ((.cse180 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse180 (store (store (select |c_#memory_$Pointer$.base| .cse180) (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019))))) (select .cse179 (select (select .cse179 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse178 v_ArrVal_1017) 0) (= (select .cse178 v_arrayElimCell_72) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse11 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse100 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (or (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (let ((.cse177 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse177 (select (select (store |c_#memory_$Pointer$.base| .cse177 (store (store (select |c_#memory_$Pointer$.base| .cse177) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (or (= (+ 8 v_arrayElimCell_71) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse0 (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse1 (store (store (select |c_#memory_$Pointer$.base| .cse1) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (let ((.cse2 (+ 8 v_arrayElimCell_71))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= .cse2 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= (select (let ((.cse3 (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse4 (store (store (select |c_#memory_$Pointer$.base| .cse4) v_arrayElimCell_71 0) .cse2 v_ArrVal_1019))))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_71) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse5) (or .cse6 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse7 (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse8 (store (store (select |c_#memory_$Pointer$.base| .cse8) |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019))))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) 0) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= v_arrayElimIndex_15 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse9 (select (select (store |c_#memory_$Pointer$.base| .cse9 (store (store (select |c_#memory_$Pointer$.base| .cse9) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse10) (or .cse11 (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse12 (let ((.cse13 (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse14 (store (store (select |c_#memory_$Pointer$.base| .cse14) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select .cse12 v_arrayElimCell_72) 0) (= (select .cse12 0) 0) (= (select .cse12 v_ArrVal_1017) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse15 (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse16 (store (store (select |c_#memory_$Pointer$.base| .cse16) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) .cse5) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (or (= (+ 8 v_arrayElimCell_71) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (= (select (let ((.cse17 (let ((.cse18 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse18 (store (store (select |c_#memory_$Pointer$.base| .cse18) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_71) 0)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse19 (select (select (store |c_#memory_$Pointer$.base| .cse19 (store (store (select |c_#memory_$Pointer$.base| .cse19) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or .cse20 (<= |c_ULTIMATE.start_main_~x~0#1.offset| 0)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (or (= (select (let ((.cse21 (let ((.cse22 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse22 (store (store (select |c_#memory_$Pointer$.base| .cse22) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (forall ((v_ArrVal_1017 Int)) (= (select (let ((.cse23 (let ((.cse24 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse24 (store (store (select |c_#memory_$Pointer$.base| .cse24) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_ArrVal_1017) 0)))) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (or (= v_arrayElimIndex_15 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (let ((.cse25 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse25 (select (select (store |c_#memory_$Pointer$.base| .cse25 (store (store (select |c_#memory_$Pointer$.base| .cse25) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimIndex_15 Int)) (or (= (+ 8 v_arrayElimIndex_15) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse26 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse26 (select (select (store |c_#memory_$Pointer$.base| .cse26 (store (store (select |c_#memory_$Pointer$.base| .cse26) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse28 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse27 (select (select (store |c_#memory_$Pointer$.base| .cse28 (store (store (select |c_#memory_$Pointer$.base| .cse28) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse27) (= .cse28 .cse27))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (or (= v_arrayElimIndex_15 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (let ((.cse29 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse29 (select (select (store |c_#memory_$Pointer$.base| .cse29 (store (store (select |c_#memory_$Pointer$.base| .cse29) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (let ((.cse30 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= .cse30 0) (= .cse30 |c_ULTIMATE.start_main_~x~0#1.offset|) (forall ((v_ArrVal_1019 Int)) (let ((.cse31 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse31 (select (select (store |c_#memory_$Pointer$.base| .cse31 (store (store (select |c_#memory_$Pointer$.base| .cse31) (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse34 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse33 (+ 8 v_arrayElimIndex_15))) (let ((.cse32 (select (select (store |c_#memory_$Pointer$.base| .cse34 (store (store (select |c_#memory_$Pointer$.base| .cse34) v_arrayElimIndex_15 0) .cse33 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse32) (= .cse33 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse34 .cse32))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimCell_71 Int)) (or (forall ((v_ArrVal_1019 Int)) (or (= (select (let ((.cse35 (let ((.cse36 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse36 (store (store (select |c_#memory_$Pointer$.base| .cse36) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse35 (select (select .cse35 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_71) 0) (forall ((v_ArrVal_1017 Int)) (= (select (let ((.cse37 (let ((.cse38 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse38 (store (store (select |c_#memory_$Pointer$.base| .cse38) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse37 (select (select .cse37 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_ArrVal_1017) 0)))) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse41 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse40 (+ 8 v_arrayElimIndex_15))) (let ((.cse39 (select (select (store |c_#memory_$Pointer$.base| .cse41 (store (store (select |c_#memory_$Pointer$.base| .cse41) v_arrayElimIndex_15 0) .cse40 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= |c_ULTIMATE.start_main_~x~0#1.base| .cse39) (= .cse40 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse41 .cse39) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) .cse42 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (or (= (+ 8 v_arrayElimCell_71) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse43 (let ((.cse44 (let ((.cse45 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse45 (store (store (select |c_#memory_$Pointer$.base| .cse45) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse44 (select (select .cse44 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse43 0) 0) (= (select .cse43 v_arrayElimCell_71) 0)))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimIndex_15 Int)) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse47 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse46 (select (select (store |c_#memory_$Pointer$.base| .cse47 (store (store (select |c_#memory_$Pointer$.base| .cse47) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse46) (= .cse47 .cse46))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse49 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse48 (select (select (store |c_#memory_$Pointer$.base| .cse49 (store (store (select |c_#memory_$Pointer$.base| .cse49) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse48) (= .cse49 .cse48))))) (= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimIndex_15 Int)) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse51 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse50 (select (select (store |c_#memory_$Pointer$.base| .cse51 (store (store (select |c_#memory_$Pointer$.base| .cse51) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse50) (= .cse51 .cse50))))) (= v_arrayElimIndex_15 0))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (or (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse52 (let ((.cse53 (let ((.cse54 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse54 (store (store (select |c_#memory_$Pointer$.base| .cse54) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse53 (select (select .cse53 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse52 v_arrayElimCell_71) 0) (= (select .cse52 v_ArrVal_1017) 0)))) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse55 (let ((.cse56 (let ((.cse57 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse57 (store (store (select |c_#memory_$Pointer$.base| .cse57) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse56 (select (select .cse56 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse55 v_arrayElimCell_72) 0) (= (select .cse55 v_ArrVal_1017) 0) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse59 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse58 (select (select (store |c_#memory_$Pointer$.base| .cse59 (store (store (select |c_#memory_$Pointer$.base| .cse59) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse58) (= .cse59 .cse58))))) (= (+ 8 v_arrayElimIndex_15) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse62 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse60 (+ 8 v_arrayElimIndex_15))) (let ((.cse61 (select (select (store |c_#memory_$Pointer$.base| .cse62 (store (store (select |c_#memory_$Pointer$.base| .cse62) v_arrayElimIndex_15 0) .cse60 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= .cse60 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse61) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse62 .cse61) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimIndex_15 Int)) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse64 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse63 (select (select (store |c_#memory_$Pointer$.base| .cse64 (store (store (select |c_#memory_$Pointer$.base| .cse64) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse63) (= .cse64 .cse63))))) (= (+ 8 v_arrayElimIndex_15) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))))) (or (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimCell_71 Int)) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (let ((.cse65 (let ((.cse66 (let ((.cse67 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse67 (store (store (select |c_#memory_$Pointer$.base| .cse67) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse66 (select (select .cse66 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse65 v_arrayElimCell_72) 0) (= (select .cse65 0) 0)))) (= (+ 8 v_arrayElimCell_71) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (let ((.cse70 (+ 8 v_arrayElimCell_71))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse68 (let ((.cse69 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse69 (store (store (select |c_#memory_$Pointer$.base| .cse69) v_arrayElimCell_71 0) .cse70 v_ArrVal_1019))))) (select .cse68 (select (select .cse68 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (= .cse70 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse5) .cse71 .cse72) .cse11) (or .cse20 (<= |c_ULTIMATE.start_main_~head~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse73 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse73 (select (select (store |c_#memory_$Pointer$.base| .cse73 (store (store (select |c_#memory_$Pointer$.base| .cse73) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)))))) (= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (let ((.cse74 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse74 (select (select (store |c_#memory_$Pointer$.base| .cse74 (store (store (select |c_#memory_$Pointer$.base| .cse74) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse10) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= (+ 8 v_arrayElimIndex_15) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse76 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse75 (select (select (store |c_#memory_$Pointer$.base| .cse76 (store (store (select |c_#memory_$Pointer$.base| .cse76) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse75) (= .cse76 .cse75))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or .cse6 (let ((.cse81 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse95 (let ((.cse96 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse96 (store (store (select |c_#memory_$Pointer$.base| .cse96) (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019))))) (select .cse95 (select (select .cse95 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_ArrVal_1017) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse78 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)))) (let ((.cse77 (let ((.cse79 (let ((.cse80 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse80 (store (store (select |c_#memory_$Pointer$.base| .cse80) .cse78 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019))))) (select .cse79 (select (select .cse79 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse77 0) 0) (= (select .cse77 .cse78) 0) (= (select .cse77 v_ArrVal_1017) 0))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse81 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse82 (let ((.cse83 (let ((.cse84 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse84 (store (store (select |c_#memory_$Pointer$.base| .cse84) (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019))))) (select .cse83 (select (select .cse83 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse82 0) 0) (= (select .cse82 v_ArrVal_1017) 0) (= (select .cse82 v_arrayElimCell_72) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse85 (let ((.cse86 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse86 (store (store (select |c_#memory_$Pointer$.base| .cse86) (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019))))) (select .cse85 (select (select .cse85 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_ArrVal_1017) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse87 .cse88 (or (and .cse81 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse89 (let ((.cse90 (let ((.cse91 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse91 (store (store (select |c_#memory_$Pointer$.base| .cse91) (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019))))) (select .cse90 (select (select .cse90 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse89 0) 0) (= (select .cse89 v_ArrVal_1017) 0) (= (select .cse89 v_arrayElimCell_72) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse92 (let ((.cse93 (let ((.cse94 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse94 (store (store (select |c_#memory_$Pointer$.base| .cse94) (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019))))) (select .cse93 (select (select .cse93 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse92 v_ArrVal_1017) 0) (= (select .cse92 v_arrayElimCell_72) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse11)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse97 (let ((.cse98 (let ((.cse99 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse99 (store (store (select |c_#memory_$Pointer$.base| .cse99) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse98 (select (select .cse98 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse97 v_arrayElimCell_72) 0) (= (select .cse97 0) 0) (= (select .cse97 v_ArrVal_1017) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or .cse10 (and .cse42 .cse100)) (or .cse20 .cse11) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse103 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse102 (+ 8 v_arrayElimIndex_15))) (let ((.cse101 (select (select (store |c_#memory_$Pointer$.base| .cse103 (store (store (select |c_#memory_$Pointer$.base| .cse103) v_arrayElimIndex_15 0) .cse102 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= |c_ULTIMATE.start_main_~x~0#1.base| .cse101) (= .cse102 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0) (= .cse103 .cse101) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) .cse71 (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse104 (let ((.cse105 (let ((.cse106 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse106 (store (store (select |c_#memory_$Pointer$.base| .cse106) (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019))))) (select .cse105 (select (select .cse105 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select .cse104 v_ArrVal_1017) 0) (= (select .cse104 v_arrayElimCell_72) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse11) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse107 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse107 (select (select (store |c_#memory_$Pointer$.base| .cse107 (store (store (select |c_#memory_$Pointer$.base| .cse107) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse108 (let ((.cse109 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse109 (store (store (select |c_#memory_$Pointer$.base| .cse109) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse108 (select (select .cse108 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_71) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) .cse5) (or .cse20 .cse6) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse111 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse110 (select (select (store |c_#memory_$Pointer$.base| .cse111 (store (store (select |c_#memory_$Pointer$.base| .cse111) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse110) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse110) (= .cse111 .cse110))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse113 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse112 (select (select (store |c_#memory_$Pointer$.base| .cse113 (store (store (select |c_#memory_$Pointer$.base| .cse113) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse112) (= .cse113 .cse112))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (let ((.cse116 (+ 8 v_arrayElimCell_71))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse114 (let ((.cse115 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse115 (store (store (select |c_#memory_$Pointer$.base| .cse115) v_arrayElimCell_71 0) .cse116 v_ArrVal_1019))))) (select .cse114 (select (select .cse114 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (= .cse116 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse5) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimCell_71 Int)) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (let ((.cse117 (let ((.cse118 (let ((.cse119 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse119 (store (store (select |c_#memory_$Pointer$.base| .cse119) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse118 (select (select .cse118 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse117 v_arrayElimCell_72) 0) (= (select .cse117 0) 0)))) (= (+ 8 v_arrayElimCell_71) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= (+ 8 v_arrayElimIndex_15) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse121 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse120 (select (select (store |c_#memory_$Pointer$.base| .cse121 (store (store (select |c_#memory_$Pointer$.base| .cse121) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse120) (= .cse121 .cse120))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or .cse11 (and (or .cse5 (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse122 (let ((.cse123 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse123 (store (store (select |c_#memory_$Pointer$.base| .cse123) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse122 (select (select .cse122 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) .cse72 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (or (= (select (let ((.cse124 (let ((.cse125 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse125 (store (store (select |c_#memory_$Pointer$.base| .cse125) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse124 (select (select .cse124 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (forall ((v_ArrVal_1017 Int)) (= (select (let ((.cse126 (let ((.cse127 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse127 (store (store (select |c_#memory_$Pointer$.base| .cse127) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse126 (select (select .cse126 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_ArrVal_1017) 0)))) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse87 (or .cse5 (and (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse128 (let ((.cse129 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse129 (store (store (select |c_#memory_$Pointer$.base| .cse129) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse128 (select (select .cse128 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse11) .cse130 .cse131)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse133 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse132 (select (select (store |c_#memory_$Pointer$.base| .cse133 (store (store (select |c_#memory_$Pointer$.base| .cse133) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse132) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse133 .cse132))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse134 (let ((.cse135 (let ((.cse136 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse136 (store (store (select |c_#memory_$Pointer$.base| .cse136) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse135 (select (select .cse135 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse134 0) 0) (= (select .cse134 v_arrayElimCell_71) 0) (= (select .cse134 v_ArrVal_1017) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse138 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse137 (select (select (store |c_#memory_$Pointer$.base| .cse138 (store (store (select |c_#memory_$Pointer$.base| .cse138) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse137) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= .cse138 .cse137))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse141 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse139 (+ 8 v_arrayElimIndex_15))) (let ((.cse140 (select (select (store |c_#memory_$Pointer$.base| .cse141 (store (store (select |c_#memory_$Pointer$.base| .cse141) v_arrayElimIndex_15 0) .cse139 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= .cse139 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse140) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse141 .cse140) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) (or .cse5 (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (let ((.cse142 (let ((.cse143 (let ((.cse144 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse144 (store (store (select |c_#memory_$Pointer$.base| .cse144) v_arrayElimCell_72 0) (+ 8 v_arrayElimCell_72) v_ArrVal_1019))))) (select .cse143 (select (select .cse143 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse142 0) 0) (= (select .cse142 v_arrayElimCell_72) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1019 Int)) (let ((.cse145 (let ((.cse146 (let ((.cse147 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse147 (store (store (select |c_#memory_$Pointer$.base| .cse147) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse146 (select (select .cse146 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse145 v_arrayElimCell_72) 0) (= (select .cse145 0) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse130 (or .cse11 (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse148 (let ((.cse149 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse149 (store (store (select |c_#memory_$Pointer$.base| .cse149) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse148 (select (select .cse148 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1019 Int)) (let ((.cse150 (let ((.cse151 (let ((.cse152 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse152 (store (store (select |c_#memory_$Pointer$.base| .cse152) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse151 (select (select .cse151 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse150 v_arrayElimCell_72) 0) (= (select .cse150 0) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse131)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= (+ 8 v_arrayElimIndex_15) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse154 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse153 (select (select (store |c_#memory_$Pointer$.base| .cse154 (store (store (select |c_#memory_$Pointer$.base| .cse154) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse153) (= .cse154 .cse153))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse88 (or .cse11 (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse155 (let ((.cse156 (let ((.cse157 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse157 (store (store (select |c_#memory_$Pointer$.base| .cse157) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse156 (select (select .cse156 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select .cse155 v_arrayElimCell_72) 0) (= (select .cse155 v_ArrVal_1017) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse159 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse158 (select (select (store |c_#memory_$Pointer$.base| .cse159 (store (store (select |c_#memory_$Pointer$.base| .cse159) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse158) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse159 .cse158))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse160 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse160 (select (select (store |c_#memory_$Pointer$.base| .cse160 (store (store (select |c_#memory_$Pointer$.base| .cse160) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse161 (let ((.cse162 (let ((.cse163 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse163 (store (store (select |c_#memory_$Pointer$.base| .cse163) |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019))))) (select .cse162 (select (select .cse162 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse161 v_ArrVal_1017) 0) (= (select .cse161 0) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1019 Int)) (or (forall ((v_ArrVal_1017 Int)) (= (select (let ((.cse164 (let ((.cse165 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse165 (store (store (select |c_#memory_$Pointer$.base| .cse165) |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019))))) (select .cse164 (select (select .cse164 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_ArrVal_1017) 0)) (= (select (let ((.cse166 (let ((.cse167 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse167 (store (store (select |c_#memory_$Pointer$.base| .cse167) |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019))))) (select .cse166 (select (select .cse166 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) 0) 0))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse6) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse169 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse168 (select (select (store |c_#memory_$Pointer$.base| .cse169 (store (store (select |c_#memory_$Pointer$.base| .cse169) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse168) (= .cse169 .cse168))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse170 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse170 (select (select (store |c_#memory_$Pointer$.base| .cse170 (store (store (select |c_#memory_$Pointer$.base| .cse170) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse172 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse171 (select (select (store |c_#memory_$Pointer$.base| .cse172 (store (store (select |c_#memory_$Pointer$.base| .cse172) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse171) (= v_arrayElimIndex_15 0) (= .cse172 .cse171))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse100 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimIndex_15 Int)) (or (= (+ 8 v_arrayElimIndex_15) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse174 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse173 (select (select (store |c_#memory_$Pointer$.base| .cse174 (store (store (select |c_#memory_$Pointer$.base| .cse174) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse173) (= .cse174 .cse173))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimIndex_15 Int)) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse176 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse175 (select (select (store |c_#memory_$Pointer$.base| .cse176 (store (store (select |c_#memory_$Pointer$.base| .cse176) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse175) (= .cse176 .cse175))))) (= v_arrayElimIndex_15 0))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from true [2022-07-23 06:20:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:20:27,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259095880] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:20:27,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:20:27,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 41 [2022-07-23 06:20:27,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783104644] [2022-07-23 06:20:27,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:20:27,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-23 06:20:27,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:20:27,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-23 06:20:27,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1429, Unknown=9, NotChecked=76, Total=1640 [2022-07-23 06:20:27,283 INFO L87 Difference]: Start difference. First operand 231 states and 265 transitions. Second operand has 41 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 41 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:20:29,703 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse6 (not .cse5))) (let ((.cse42 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse193 (+ 8 v_arrayElimIndex_15))) (or (= .cse193 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (let ((.cse194 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse194 (select (select (store |c_#memory_$Pointer$.base| .cse194 (store (store (select |c_#memory_$Pointer$.base| .cse194) v_arrayElimIndex_15 0) .cse193 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse71 (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse191 (let ((.cse192 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse192 (store (store (select |c_#memory_$Pointer$.base| .cse192) |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019))))) (select .cse191 (select (select .cse191 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) 0) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse6)) (.cse20 (< |c_ULTIMATE.start_main_~head~0#1.offset| 0)) (.cse72 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (or (= (+ 8 v_arrayElimCell_71) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse189 (let ((.cse190 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse190 (store (store (select |c_#memory_$Pointer$.base| .cse190) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse189 (select (select .cse189 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse87 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse186 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)))) (let ((.cse185 (let ((.cse187 (let ((.cse188 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse188 (store (store (select |c_#memory_$Pointer$.base| .cse188) .cse186 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019))))) (select .cse187 (select (select .cse187 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse185 .cse186) 0) (= (select .cse185 v_ArrVal_1017) 0))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse10 (= |c_ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse130 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse183 (let ((.cse184 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse184 (store (store (select |c_#memory_$Pointer$.base| .cse184) v_arrayElimCell_72 0) (+ 8 v_arrayElimCell_72) v_ArrVal_1019))))) (select .cse183 (select (select .cse183 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse131 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse181 (let ((.cse182 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse182 (store (store (select |c_#memory_$Pointer$.base| .cse182) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse181 (select (select .cse181 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse88 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse178 (let ((.cse179 (let ((.cse180 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse180 (store (store (select |c_#memory_$Pointer$.base| .cse180) (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019))))) (select .cse179 (select (select .cse179 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse178 v_ArrVal_1017) 0) (= (select .cse178 v_arrayElimCell_72) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse11 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse100 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (or (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (let ((.cse177 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse177 (select (select (store |c_#memory_$Pointer$.base| .cse177 (store (store (select |c_#memory_$Pointer$.base| .cse177) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (or (= (+ 8 v_arrayElimCell_71) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse0 (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse1 (store (store (select |c_#memory_$Pointer$.base| .cse1) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (let ((.cse2 (+ 8 v_arrayElimCell_71))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= .cse2 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= (select (let ((.cse3 (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse4 (store (store (select |c_#memory_$Pointer$.base| .cse4) v_arrayElimCell_71 0) .cse2 v_ArrVal_1019))))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_71) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse5) (or .cse6 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse7 (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse8 (store (store (select |c_#memory_$Pointer$.base| .cse8) |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019))))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) 0) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= v_arrayElimIndex_15 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse9 (select (select (store |c_#memory_$Pointer$.base| .cse9 (store (store (select |c_#memory_$Pointer$.base| .cse9) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse10) (or .cse11 (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse12 (let ((.cse13 (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse14 (store (store (select |c_#memory_$Pointer$.base| .cse14) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select .cse12 v_arrayElimCell_72) 0) (= (select .cse12 0) 0) (= (select .cse12 v_ArrVal_1017) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse15 (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse16 (store (store (select |c_#memory_$Pointer$.base| .cse16) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) .cse5) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (or (= (+ 8 v_arrayElimCell_71) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (= (select (let ((.cse17 (let ((.cse18 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse18 (store (store (select |c_#memory_$Pointer$.base| .cse18) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_71) 0)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse19 (select (select (store |c_#memory_$Pointer$.base| .cse19 (store (store (select |c_#memory_$Pointer$.base| .cse19) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or .cse20 (<= |c_ULTIMATE.start_main_~x~0#1.offset| 0)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (or (= (select (let ((.cse21 (let ((.cse22 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse22 (store (store (select |c_#memory_$Pointer$.base| .cse22) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (forall ((v_ArrVal_1017 Int)) (= (select (let ((.cse23 (let ((.cse24 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse24 (store (store (select |c_#memory_$Pointer$.base| .cse24) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_ArrVal_1017) 0)))) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (or (= v_arrayElimIndex_15 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (let ((.cse25 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse25 (select (select (store |c_#memory_$Pointer$.base| .cse25 (store (store (select |c_#memory_$Pointer$.base| .cse25) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimIndex_15 Int)) (or (= (+ 8 v_arrayElimIndex_15) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse26 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse26 (select (select (store |c_#memory_$Pointer$.base| .cse26 (store (store (select |c_#memory_$Pointer$.base| .cse26) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse28 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse27 (select (select (store |c_#memory_$Pointer$.base| .cse28 (store (store (select |c_#memory_$Pointer$.base| .cse28) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse27) (= .cse28 .cse27))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (or (= v_arrayElimIndex_15 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (let ((.cse29 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse29 (select (select (store |c_#memory_$Pointer$.base| .cse29 (store (store (select |c_#memory_$Pointer$.base| .cse29) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (let ((.cse30 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= .cse30 0) (= .cse30 |c_ULTIMATE.start_main_~x~0#1.offset|) (forall ((v_ArrVal_1019 Int)) (let ((.cse31 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse31 (select (select (store |c_#memory_$Pointer$.base| .cse31 (store (store (select |c_#memory_$Pointer$.base| .cse31) (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse34 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse33 (+ 8 v_arrayElimIndex_15))) (let ((.cse32 (select (select (store |c_#memory_$Pointer$.base| .cse34 (store (store (select |c_#memory_$Pointer$.base| .cse34) v_arrayElimIndex_15 0) .cse33 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse32) (= .cse33 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse34 .cse32))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimCell_71 Int)) (or (forall ((v_ArrVal_1019 Int)) (or (= (select (let ((.cse35 (let ((.cse36 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse36 (store (store (select |c_#memory_$Pointer$.base| .cse36) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse35 (select (select .cse35 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_71) 0) (forall ((v_ArrVal_1017 Int)) (= (select (let ((.cse37 (let ((.cse38 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse38 (store (store (select |c_#memory_$Pointer$.base| .cse38) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse37 (select (select .cse37 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_ArrVal_1017) 0)))) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse41 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse40 (+ 8 v_arrayElimIndex_15))) (let ((.cse39 (select (select (store |c_#memory_$Pointer$.base| .cse41 (store (store (select |c_#memory_$Pointer$.base| .cse41) v_arrayElimIndex_15 0) .cse40 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= |c_ULTIMATE.start_main_~x~0#1.base| .cse39) (= .cse40 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse41 .cse39) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) .cse42 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (or (= (+ 8 v_arrayElimCell_71) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse43 (let ((.cse44 (let ((.cse45 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse45 (store (store (select |c_#memory_$Pointer$.base| .cse45) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse44 (select (select .cse44 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse43 0) 0) (= (select .cse43 v_arrayElimCell_71) 0)))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimIndex_15 Int)) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse47 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse46 (select (select (store |c_#memory_$Pointer$.base| .cse47 (store (store (select |c_#memory_$Pointer$.base| .cse47) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse46) (= .cse47 .cse46))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse49 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse48 (select (select (store |c_#memory_$Pointer$.base| .cse49 (store (store (select |c_#memory_$Pointer$.base| .cse49) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse48) (= .cse49 .cse48))))) (= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimIndex_15 Int)) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse51 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse50 (select (select (store |c_#memory_$Pointer$.base| .cse51 (store (store (select |c_#memory_$Pointer$.base| .cse51) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse50) (= .cse51 .cse50))))) (= v_arrayElimIndex_15 0))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (or (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse52 (let ((.cse53 (let ((.cse54 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse54 (store (store (select |c_#memory_$Pointer$.base| .cse54) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse53 (select (select .cse53 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse52 v_arrayElimCell_71) 0) (= (select .cse52 v_ArrVal_1017) 0)))) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse55 (let ((.cse56 (let ((.cse57 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse57 (store (store (select |c_#memory_$Pointer$.base| .cse57) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse56 (select (select .cse56 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse55 v_arrayElimCell_72) 0) (= (select .cse55 v_ArrVal_1017) 0) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse59 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse58 (select (select (store |c_#memory_$Pointer$.base| .cse59 (store (store (select |c_#memory_$Pointer$.base| .cse59) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse58) (= .cse59 .cse58))))) (= (+ 8 v_arrayElimIndex_15) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse62 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse60 (+ 8 v_arrayElimIndex_15))) (let ((.cse61 (select (select (store |c_#memory_$Pointer$.base| .cse62 (store (store (select |c_#memory_$Pointer$.base| .cse62) v_arrayElimIndex_15 0) .cse60 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= .cse60 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse61) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse62 .cse61) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimIndex_15 Int)) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse64 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse63 (select (select (store |c_#memory_$Pointer$.base| .cse64 (store (store (select |c_#memory_$Pointer$.base| .cse64) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse63) (= .cse64 .cse63))))) (= (+ 8 v_arrayElimIndex_15) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))))) (or (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimCell_71 Int)) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (let ((.cse65 (let ((.cse66 (let ((.cse67 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse67 (store (store (select |c_#memory_$Pointer$.base| .cse67) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse66 (select (select .cse66 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse65 v_arrayElimCell_72) 0) (= (select .cse65 0) 0)))) (= (+ 8 v_arrayElimCell_71) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (let ((.cse70 (+ 8 v_arrayElimCell_71))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse68 (let ((.cse69 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse69 (store (store (select |c_#memory_$Pointer$.base| .cse69) v_arrayElimCell_71 0) .cse70 v_ArrVal_1019))))) (select .cse68 (select (select .cse68 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (= .cse70 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse5) .cse71 .cse72) .cse11) (or .cse20 (<= |c_ULTIMATE.start_main_~head~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.offset|)) .cse11 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse73 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse73 (select (select (store |c_#memory_$Pointer$.base| .cse73 (store (store (select |c_#memory_$Pointer$.base| .cse73) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)))))) (= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (let ((.cse74 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse74 (select (select (store |c_#memory_$Pointer$.base| .cse74 (store (store (select |c_#memory_$Pointer$.base| .cse74) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse10) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= (+ 8 v_arrayElimIndex_15) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse76 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse75 (select (select (store |c_#memory_$Pointer$.base| .cse76 (store (store (select |c_#memory_$Pointer$.base| .cse76) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse75) (= .cse76 .cse75))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or .cse6 (let ((.cse81 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse95 (let ((.cse96 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse96 (store (store (select |c_#memory_$Pointer$.base| .cse96) (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019))))) (select .cse95 (select (select .cse95 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_ArrVal_1017) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse78 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)))) (let ((.cse77 (let ((.cse79 (let ((.cse80 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse80 (store (store (select |c_#memory_$Pointer$.base| .cse80) .cse78 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019))))) (select .cse79 (select (select .cse79 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse77 0) 0) (= (select .cse77 .cse78) 0) (= (select .cse77 v_ArrVal_1017) 0))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse81 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse82 (let ((.cse83 (let ((.cse84 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse84 (store (store (select |c_#memory_$Pointer$.base| .cse84) (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019))))) (select .cse83 (select (select .cse83 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse82 0) 0) (= (select .cse82 v_ArrVal_1017) 0) (= (select .cse82 v_arrayElimCell_72) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse85 (let ((.cse86 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse86 (store (store (select |c_#memory_$Pointer$.base| .cse86) (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019))))) (select .cse85 (select (select .cse85 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_ArrVal_1017) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse87 .cse88 (or (and .cse81 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse89 (let ((.cse90 (let ((.cse91 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse91 (store (store (select |c_#memory_$Pointer$.base| .cse91) (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019))))) (select .cse90 (select (select .cse90 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse89 0) 0) (= (select .cse89 v_ArrVal_1017) 0) (= (select .cse89 v_arrayElimCell_72) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse92 (let ((.cse93 (let ((.cse94 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse94 (store (store (select |c_#memory_$Pointer$.base| .cse94) (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019))))) (select .cse93 (select (select .cse93 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse92 v_ArrVal_1017) 0) (= (select .cse92 v_arrayElimCell_72) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse11)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse97 (let ((.cse98 (let ((.cse99 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse99 (store (store (select |c_#memory_$Pointer$.base| .cse99) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse98 (select (select .cse98 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse97 v_arrayElimCell_72) 0) (= (select .cse97 0) 0) (= (select .cse97 v_ArrVal_1017) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or .cse10 (and .cse42 .cse100)) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (or .cse20 .cse11) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse103 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse102 (+ 8 v_arrayElimIndex_15))) (let ((.cse101 (select (select (store |c_#memory_$Pointer$.base| .cse103 (store (store (select |c_#memory_$Pointer$.base| .cse103) v_arrayElimIndex_15 0) .cse102 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= |c_ULTIMATE.start_main_~x~0#1.base| .cse101) (= .cse102 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0) (= .cse103 .cse101) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) .cse71 (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse104 (let ((.cse105 (let ((.cse106 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse106 (store (store (select |c_#memory_$Pointer$.base| .cse106) (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019))))) (select .cse105 (select (select .cse105 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select .cse104 v_ArrVal_1017) 0) (= (select .cse104 v_arrayElimCell_72) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse11) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse107 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse107 (select (select (store |c_#memory_$Pointer$.base| .cse107 (store (store (select |c_#memory_$Pointer$.base| .cse107) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse108 (let ((.cse109 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse109 (store (store (select |c_#memory_$Pointer$.base| .cse109) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse108 (select (select .cse108 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_71) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) .cse5) (or .cse20 .cse6) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse111 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse110 (select (select (store |c_#memory_$Pointer$.base| .cse111 (store (store (select |c_#memory_$Pointer$.base| .cse111) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse110) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse110) (= .cse111 .cse110))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse6 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse113 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse112 (select (select (store |c_#memory_$Pointer$.base| .cse113 (store (store (select |c_#memory_$Pointer$.base| .cse113) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse112) (= .cse113 .cse112))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (let ((.cse116 (+ 8 v_arrayElimCell_71))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse114 (let ((.cse115 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse115 (store (store (select |c_#memory_$Pointer$.base| .cse115) v_arrayElimCell_71 0) .cse116 v_ArrVal_1019))))) (select .cse114 (select (select .cse114 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (= .cse116 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse5) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimCell_71 Int)) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (let ((.cse117 (let ((.cse118 (let ((.cse119 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse119 (store (store (select |c_#memory_$Pointer$.base| .cse119) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse118 (select (select .cse118 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse117 v_arrayElimCell_72) 0) (= (select .cse117 0) 0)))) (= (+ 8 v_arrayElimCell_71) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= (+ 8 v_arrayElimIndex_15) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse121 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse120 (select (select (store |c_#memory_$Pointer$.base| .cse121 (store (store (select |c_#memory_$Pointer$.base| .cse121) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse120) (= .cse121 .cse120))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or .cse11 (and (or .cse5 (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse122 (let ((.cse123 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse123 (store (store (select |c_#memory_$Pointer$.base| .cse123) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse122 (select (select .cse122 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) .cse72 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (or (= (select (let ((.cse124 (let ((.cse125 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse125 (store (store (select |c_#memory_$Pointer$.base| .cse125) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse124 (select (select .cse124 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (forall ((v_ArrVal_1017 Int)) (= (select (let ((.cse126 (let ((.cse127 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse127 (store (store (select |c_#memory_$Pointer$.base| .cse127) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse126 (select (select .cse126 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_ArrVal_1017) 0)))) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse87 (or .cse5 (and (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse128 (let ((.cse129 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse129 (store (store (select |c_#memory_$Pointer$.base| .cse129) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse128 (select (select .cse128 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse11) .cse130 .cse131)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse133 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse132 (select (select (store |c_#memory_$Pointer$.base| .cse133 (store (store (select |c_#memory_$Pointer$.base| .cse133) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse132) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse133 .cse132))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse134 (let ((.cse135 (let ((.cse136 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse136 (store (store (select |c_#memory_$Pointer$.base| .cse136) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse135 (select (select .cse135 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse134 0) 0) (= (select .cse134 v_arrayElimCell_71) 0) (= (select .cse134 v_ArrVal_1017) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse138 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse137 (select (select (store |c_#memory_$Pointer$.base| .cse138 (store (store (select |c_#memory_$Pointer$.base| .cse138) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse137) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= .cse138 .cse137))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse141 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse139 (+ 8 v_arrayElimIndex_15))) (let ((.cse140 (select (select (store |c_#memory_$Pointer$.base| .cse141 (store (store (select |c_#memory_$Pointer$.base| .cse141) v_arrayElimIndex_15 0) .cse139 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= .cse139 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse140) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse141 .cse140) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) (or .cse5 (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (let ((.cse142 (let ((.cse143 (let ((.cse144 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse144 (store (store (select |c_#memory_$Pointer$.base| .cse144) v_arrayElimCell_72 0) (+ 8 v_arrayElimCell_72) v_ArrVal_1019))))) (select .cse143 (select (select .cse143 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse142 0) 0) (= (select .cse142 v_arrayElimCell_72) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1019 Int)) (let ((.cse145 (let ((.cse146 (let ((.cse147 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse147 (store (store (select |c_#memory_$Pointer$.base| .cse147) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse146 (select (select .cse146 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse145 v_arrayElimCell_72) 0) (= (select .cse145 0) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse130 (or .cse11 (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse148 (let ((.cse149 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse149 (store (store (select |c_#memory_$Pointer$.base| .cse149) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse148 (select (select .cse148 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1019 Int)) (let ((.cse150 (let ((.cse151 (let ((.cse152 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse152 (store (store (select |c_#memory_$Pointer$.base| .cse152) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse151 (select (select .cse151 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse150 v_arrayElimCell_72) 0) (= (select .cse150 0) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse131)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= (+ 8 v_arrayElimIndex_15) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse154 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse153 (select (select (store |c_#memory_$Pointer$.base| .cse154 (store (store (select |c_#memory_$Pointer$.base| .cse154) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse153) (= .cse154 .cse153))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse88 (or .cse11 (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse155 (let ((.cse156 (let ((.cse157 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse157 (store (store (select |c_#memory_$Pointer$.base| .cse157) v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019))))) (select .cse156 (select (select .cse156 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select .cse155 v_arrayElimCell_72) 0) (= (select .cse155 v_ArrVal_1017) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse159 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse158 (select (select (store |c_#memory_$Pointer$.base| .cse159 (store (store (select |c_#memory_$Pointer$.base| .cse159) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse158) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse159 .cse158))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse160 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse160 (select (select (store |c_#memory_$Pointer$.base| .cse160 (store (store (select |c_#memory_$Pointer$.base| .cse160) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse161 (let ((.cse162 (let ((.cse163 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse163 (store (store (select |c_#memory_$Pointer$.base| .cse163) |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019))))) (select .cse162 (select (select .cse162 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse161 v_ArrVal_1017) 0) (= (select .cse161 0) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1019 Int)) (or (forall ((v_ArrVal_1017 Int)) (= (select (let ((.cse164 (let ((.cse165 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse165 (store (store (select |c_#memory_$Pointer$.base| .cse165) |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019))))) (select .cse164 (select (select .cse164 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_ArrVal_1017) 0)) (= (select (let ((.cse166 (let ((.cse167 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse167 (store (store (select |c_#memory_$Pointer$.base| .cse167) |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019))))) (select .cse166 (select (select .cse166 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) 0) 0))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse6) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse169 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse168 (select (select (store |c_#memory_$Pointer$.base| .cse169 (store (store (select |c_#memory_$Pointer$.base| .cse169) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse168) (= .cse169 .cse168))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse170 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse170 (select (select (store |c_#memory_$Pointer$.base| .cse170 (store (store (select |c_#memory_$Pointer$.base| .cse170) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse172 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse171 (select (select (store |c_#memory_$Pointer$.base| .cse172 (store (store (select |c_#memory_$Pointer$.base| .cse172) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse171) (= v_arrayElimIndex_15 0) (= .cse172 .cse171))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse100 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimIndex_15 Int)) (or (= (+ 8 v_arrayElimIndex_15) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse174 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse173 (select (select (store |c_#memory_$Pointer$.base| .cse174 (store (store (select |c_#memory_$Pointer$.base| .cse174) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse173) (= .cse174 .cse173))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimIndex_15 Int)) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse176 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse175 (select (select (store |c_#memory_$Pointer$.base| .cse176 (store (store (select |c_#memory_$Pointer$.base| .cse176) v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse175) (= .cse176 .cse175))))) (= v_arrayElimIndex_15 0))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from true [2022-07-23 06:20:31,889 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse0 (select .cse6 0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) 0)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~x~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse2) 0) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse3) 0) (<= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (forall ((v_ArrVal_1017 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= 0 (let ((.cse5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse5 v_ArrVal_1017)))) (select (select .cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse5 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (<= 0 |c_ULTIMATE.start_main_~x~0#1.offset|) (not (= (select .cse6 |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse2) 0) (forall ((v_ArrVal_1017 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (let ((.cse8 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse8 v_ArrVal_1019)))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse8 v_ArrVal_1017)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) 0))) (= (select (select |c_#memory_$Pointer$.base| .cse1) .cse3) 0)))) is different from false [2022-07-23 06:20:32,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:20:32,570 INFO L93 Difference]: Finished difference Result 251 states and 287 transitions. [2022-07-23 06:20:32,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 06:20:32,571 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 41 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-23 06:20:32,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:20:32,572 INFO L225 Difference]: With dead ends: 251 [2022-07-23 06:20:32,572 INFO L226 Difference]: Without dead ends: 251 [2022-07-23 06:20:32,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 29.6s TimeCoverageRelationStatistics Valid=239, Invalid=2212, Unknown=11, NotChecked=294, Total=2756 [2022-07-23 06:20:32,573 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 106 mSDsluCounter, 1743 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 529 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 06:20:32,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1854 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 740 Invalid, 0 Unknown, 529 Unchecked, 0.7s Time] [2022-07-23 06:20:32,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-23 06:20:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 234. [2022-07-23 06:20:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 233 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:20:32,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 268 transitions. [2022-07-23 06:20:32,577 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 268 transitions. Word has length 40 [2022-07-23 06:20:32,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:20:32,577 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 268 transitions. [2022-07-23 06:20:32,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 41 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:20:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 268 transitions. [2022-07-23 06:20:32,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 06:20:32,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:20:32,578 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:20:32,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-23 06:20:32,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:20:32,797 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:20:32,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:20:32,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1306466284, now seen corresponding path program 1 times [2022-07-23 06:20:32,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:20:32,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20213198] [2022-07-23 06:20:32,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:20:32,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:20:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:20:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:20:33,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:20:33,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20213198] [2022-07-23 06:20:33,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20213198] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:20:33,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891148928] [2022-07-23 06:20:33,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:20:33,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:20:33,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:20:33,040 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:20:33,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-23 06:20:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:20:33,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-23 06:20:33,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:20:33,432 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:20:33,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:20:33,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:20:33,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:20:33,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:20:33,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:20:33,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:20:33,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:20:33,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:20:33,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:20:33,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:20:33,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:20:33,594 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1156 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_1156) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((v_ArrVal_1157 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_1157) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0))) is different from false [2022-07-23 06:20:35,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2022-07-23 06:20:35,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:20:36,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-23 06:20:36,092 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:20:36,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-23 06:20:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:20:36,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891148928] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:20:36,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:20:36,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 34 [2022-07-23 06:20:36,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938695951] [2022-07-23 06:20:36,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:20:36,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-23 06:20:36,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:20:36,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-23 06:20:36,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=916, Unknown=9, NotChecked=62, Total=1122 [2022-07-23 06:20:36,099 INFO L87 Difference]: Start difference. First operand 234 states and 268 transitions. Second operand has 34 states, 34 states have (on average 3.235294117647059) internal successors, (110), 34 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:20:39,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:20:39,421 INFO L93 Difference]: Finished difference Result 454 states and 503 transitions. [2022-07-23 06:20:39,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-23 06:20:39,422 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.235294117647059) internal successors, (110), 34 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-23 06:20:39,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:20:39,424 INFO L225 Difference]: With dead ends: 454 [2022-07-23 06:20:39,424 INFO L226 Difference]: Without dead ends: 454 [2022-07-23 06:20:39,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1581 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=989, Invalid=5166, Unknown=11, NotChecked=154, Total=6320 [2022-07-23 06:20:39,426 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 980 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 965 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:20:39,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 1284 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1637 Invalid, 0 Unknown, 965 Unchecked, 1.5s Time] [2022-07-23 06:20:39,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-07-23 06:20:39,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 257. [2022-07-23 06:20:39,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 230 states have (on average 1.2695652173913043) internal successors, (292), 256 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:20:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 292 transitions. [2022-07-23 06:20:39,433 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 292 transitions. Word has length 42 [2022-07-23 06:20:39,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:20:39,433 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 292 transitions. [2022-07-23 06:20:39,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.235294117647059) internal successors, (110), 34 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:20:39,434 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 292 transitions. [2022-07-23 06:20:39,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 06:20:39,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:20:39,434 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:20:39,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-23 06:20:39,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:20:39,660 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:20:39,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:20:39,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1830693833, now seen corresponding path program 1 times [2022-07-23 06:20:39,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:20:39,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786482300] [2022-07-23 06:20:39,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:20:39,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:20:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:20:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:20:40,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:20:40,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786482300] [2022-07-23 06:20:40,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786482300] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:20:40,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246681600] [2022-07-23 06:20:40,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:20:40,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:20:40,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:20:40,356 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:20:40,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-23 06:20:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:20:40,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-23 06:20:40,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:20:40,698 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-23 06:20:40,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-23 06:20:40,741 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-23 06:20:40,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2022-07-23 06:20:40,958 INFO L356 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-07-23 06:20:40,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 84 [2022-07-23 06:20:40,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:20:40,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:20:40,976 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-23 06:20:40,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 50 [2022-07-23 06:20:40,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-23 06:20:41,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:20:41,996 INFO L356 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-07-23 06:20:41,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 60 [2022-07-23 06:20:42,002 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:20:42,012 INFO L356 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-07-23 06:20:42,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 43 [2022-07-23 06:20:42,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 06:20:42,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:20:42,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:20:42,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 85 [2022-07-23 06:20:42,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 85 [2022-07-23 06:20:57,988 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:20:58,100 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:20:58,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 711 treesize of output 593 [2022-07-23 06:20:58,175 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:20:58,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 923 treesize of output 728 [2022-07-23 06:21:52,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:52,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246681600] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:21:52,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:21:52,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 40 [2022-07-23 06:21:52,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776468586] [2022-07-23 06:21:52,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:21:52,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-23 06:21:52,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:21:52,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-23 06:21:52,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1397, Unknown=0, NotChecked=0, Total=1560 [2022-07-23 06:21:52,837 INFO L87 Difference]: Start difference. First operand 257 states and 292 transitions. Second operand has 40 states, 40 states have (on average 2.975) internal successors, (119), 40 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:56,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:21:56,714 INFO L93 Difference]: Finished difference Result 402 states and 447 transitions. [2022-07-23 06:21:56,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-23 06:21:56,714 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.975) internal successors, (119), 40 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-23 06:21:56,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:21:56,715 INFO L225 Difference]: With dead ends: 402 [2022-07-23 06:21:56,715 INFO L226 Difference]: Without dead ends: 402 [2022-07-23 06:21:56,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=742, Invalid=4370, Unknown=0, NotChecked=0, Total=5112 [2022-07-23 06:21:56,717 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 1217 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 2052 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 1725 SdHoareTripleChecker+Invalid, 2702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 2052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 445 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:21:56,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 1725 Invalid, 2702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 2052 Invalid, 0 Unknown, 445 Unchecked, 1.5s Time] [2022-07-23 06:21:56,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-07-23 06:21:56,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 265. [2022-07-23 06:21:56,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 238 states have (on average 1.26890756302521) internal successors, (302), 264 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:56,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 302 transitions. [2022-07-23 06:21:56,721 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 302 transitions. Word has length 42 [2022-07-23 06:21:56,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:21:56,722 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 302 transitions. [2022-07-23 06:21:56,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.975) internal successors, (119), 40 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 302 transitions. [2022-07-23 06:21:56,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-23 06:21:56,722 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:21:56,723 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:21:56,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-23 06:21:56,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:21:56,933 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:21:56,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:21:56,933 INFO L85 PathProgramCache]: Analyzing trace with hash 916938157, now seen corresponding path program 1 times [2022-07-23 06:21:56,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:21:56,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536902466] [2022-07-23 06:21:56,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:56,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:21:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:57,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:57,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:21:57,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536902466] [2022-07-23 06:21:57,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536902466] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:21:57,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489064658] [2022-07-23 06:21:57,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:57,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:21:57,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:21:57,203 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:21:57,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-23 06:21:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:57,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-23 06:21:57,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:21:57,493 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-23 06:21:57,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2022-07-23 06:21:57,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:21:57,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:21:57,560 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 06:21:57,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-07-23 06:21:57,835 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:21:57,853 INFO L356 Elim1Store]: treesize reduction 12, result has 57.1 percent of original size [2022-07-23 06:21:57,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 25 [2022-07-23 06:21:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:57,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:21:57,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-07-23 06:22:01,995 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:01,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 170 [2022-07-23 06:22:03,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:22:03,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489064658] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:22:03,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:22:03,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 32 [2022-07-23 06:22:03,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164168109] [2022-07-23 06:22:03,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:22:03,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-23 06:22:03,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:22:03,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-23 06:22:03,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=933, Unknown=3, NotChecked=0, Total=1056 [2022-07-23 06:22:03,108 INFO L87 Difference]: Start difference. First operand 265 states and 302 transitions. Second operand has 33 states, 32 states have (on average 3.5625) internal successors, (114), 33 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:22:26,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:22:26,686 INFO L93 Difference]: Finished difference Result 509 states and 573 transitions. [2022-07-23 06:22:26,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-23 06:22:26,686 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.5625) internal successors, (114), 33 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-23 06:22:26,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:22:26,691 INFO L225 Difference]: With dead ends: 509 [2022-07-23 06:22:26,691 INFO L226 Difference]: Without dead ends: 509 [2022-07-23 06:22:26,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 74 SyntacticMatches, 12 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1899 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=1350, Invalid=4963, Unknown=7, NotChecked=0, Total=6320 [2022-07-23 06:22:26,692 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 1618 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1618 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 2063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 556 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:22:26,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1618 Valid, 1408 Invalid, 2063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 1263 Invalid, 0 Unknown, 556 Unchecked, 1.0s Time] [2022-07-23 06:22:26,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2022-07-23 06:22:26,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 314. [2022-07-23 06:22:26,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 287 states have (on average 1.2613240418118468) internal successors, (362), 313 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:22:26,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 362 transitions. [2022-07-23 06:22:26,697 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 362 transitions. Word has length 43 [2022-07-23 06:22:26,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:22:26,697 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 362 transitions. [2022-07-23 06:22:26,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.5625) internal successors, (114), 33 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:22:26,698 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 362 transitions. [2022-07-23 06:22:26,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-23 06:22:26,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:22:26,698 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:22:26,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-23 06:22:26,904 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,SelfDestructingSolverStorable23 [2022-07-23 06:22:26,905 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:22:26,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:22:26,905 INFO L85 PathProgramCache]: Analyzing trace with hash -377567726, now seen corresponding path program 1 times [2022-07-23 06:22:26,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:22:26,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404687141] [2022-07-23 06:22:26,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:22:26,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:22:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:22:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:22:27,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:22:27,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404687141] [2022-07-23 06:22:27,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404687141] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:22:27,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497690794] [2022-07-23 06:22:27,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:22:27,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:22:27,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:22:27,344 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:22:27,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-23 06:22:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:22:27,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-23 06:22:27,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:22:27,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:22:27,600 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:22:27,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 06:22:27,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:22:27,757 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:22:27,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-23 06:22:27,851 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:22:27,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-23 06:22:27,889 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:22:27,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-23 06:22:28,169 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-07-23 06:22:28,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-07-23 06:22:28,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-23 06:22:28,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-23 06:22:28,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-23 06:22:28,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:22:28,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-23 06:22:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:22:28,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:22:28,364 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1498 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_1498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) 1)) is different from false [2022-07-23 06:22:28,384 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_25| Int) (v_ArrVal_1495 Int) (v_ArrVal_1498 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_25|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_25| v_ArrVal_1495) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmp~0#1.base_25| v_ArrVal_1498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) 1))) is different from false [2022-07-23 06:22:28,545 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_104| Int) (|v_ULTIMATE.start_main_~tmp~0#1.base_25| Int) (v_ArrVal_1495 Int) (v_ArrVal_1498 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_25|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_104|)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_25| v_ArrVal_1495) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~tmp~0#1.base_25| v_ArrVal_1498) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_104|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_104| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-23 06:22:28,585 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_104| Int) (|v_ULTIMATE.start_main_~tmp~0#1.base_25| Int) (v_ArrVal_1495 Int) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1494 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_25|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_104|)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_25| v_ArrVal_1495) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1494) |v_ULTIMATE.start_main_~tmp~0#1.base_25| v_ArrVal_1498) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_104|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_104| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-23 06:22:28,636 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_104| Int) (|v_ULTIMATE.start_main_~tmp~0#1.base_25| Int) (v_ArrVal_1495 Int) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1494 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_25|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_104|)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_25| v_ArrVal_1495) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1494) |v_ULTIMATE.start_main_~tmp~0#1.base_25| v_ArrVal_1498) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_104|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_104| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-23 06:22:28,650 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_104| Int) (|v_ULTIMATE.start_main_~tmp~0#1.base_25| Int) (v_ArrVal_1495 Int) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1494 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_25|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_104|)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_25| v_ArrVal_1495) (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1494) |v_ULTIMATE.start_main_~tmp~0#1.base_25| v_ArrVal_1498) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_104|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_104| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-23 06:22:28,677 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_104| Int) (|v_ULTIMATE.start_main_~tmp~0#1.base_25| Int) (v_ArrVal_1495 Int) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1492 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_25|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_104|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_104| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_25| v_ArrVal_1495) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1492))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1494)) |v_ULTIMATE.start_main_~tmp~0#1.base_25| v_ArrVal_1498) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_104|)) 1))) is different from false [2022-07-23 06:22:28,691 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_104| Int) (|v_ULTIMATE.start_main_~tmp~0#1.base_25| Int) (v_ArrVal_1495 Int) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1492 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_25|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_104|)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_25| v_ArrVal_1495) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1492))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1494)) |v_ULTIMATE.start_main_~tmp~0#1.base_25| v_ArrVal_1498) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_104|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_104| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-23 06:22:28,716 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:28,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 37 [2022-07-23 06:22:28,728 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:28,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1750 treesize of output 1629 [2022-07-23 06:22:28,750 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:28,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1614 treesize of output 1558 [2022-07-23 06:22:28,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1550 treesize of output 1518 [2022-07-23 06:22:28,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1518 treesize of output 1454 [2022-07-23 06:22:55,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-23 06:22:55,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497690794] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:22:55,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:22:55,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 15] total 41 [2022-07-23 06:22:55,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968597169] [2022-07-23 06:22:55,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:22:55,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-23 06:22:55,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:22:55,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-23 06:22:55,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=965, Unknown=8, NotChecked=568, Total=1722 [2022-07-23 06:22:55,171 INFO L87 Difference]: Start difference. First operand 314 states and 362 transitions. Second operand has 42 states, 41 states have (on average 3.1463414634146343) internal successors, (129), 42 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:22:56,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:22:56,781 INFO L93 Difference]: Finished difference Result 475 states and 534 transitions. [2022-07-23 06:22:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 06:22:56,782 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.1463414634146343) internal successors, (129), 42 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-23 06:22:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:22:56,783 INFO L225 Difference]: With dead ends: 475 [2022-07-23 06:22:56,783 INFO L226 Difference]: Without dead ends: 475 [2022-07-23 06:22:56,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 67 SyntacticMatches, 7 SemanticMatches, 57 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=473, Invalid=2101, Unknown=8, NotChecked=840, Total=3422 [2022-07-23 06:22:56,784 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 612 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 3533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2152 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 06:22:56,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 1321 Invalid, 3533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1274 Invalid, 0 Unknown, 2152 Unchecked, 0.8s Time] [2022-07-23 06:22:56,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-07-23 06:22:56,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 323. [2022-07-23 06:22:56,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 296 states have (on average 1.260135135135135) internal successors, (373), 322 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:22:56,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 373 transitions. [2022-07-23 06:22:56,789 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 373 transitions. Word has length 45 [2022-07-23 06:22:56,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:22:56,789 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 373 transitions. [2022-07-23 06:22:56,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.1463414634146343) internal successors, (129), 42 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:22:56,789 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 373 transitions. [2022-07-23 06:22:56,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-23 06:22:56,789 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:22:56,790 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:22:56,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-23 06:22:57,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-23 06:22:57,001 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:22:57,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:22:57,002 INFO L85 PathProgramCache]: Analyzing trace with hash -377567725, now seen corresponding path program 1 times [2022-07-23 06:22:57,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:22:57,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881416670] [2022-07-23 06:22:57,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:22:57,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:22:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:22:57,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:22:57,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:22:57,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881416670] [2022-07-23 06:22:57,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881416670] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:22:57,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701011173] [2022-07-23 06:22:57,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:22:57,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:22:57,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:22:57,525 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:22:57,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-23 06:22:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:22:57,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-23 06:22:57,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:22:57,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:22:57,740 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:22:57,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 06:22:57,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:22:57,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:22:57,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:22:57,926 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:22:57,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-07-23 06:22:57,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 06:22:58,072 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:22:58,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2022-07-23 06:22:58,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:22:58,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:22:58,136 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:22:58,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-07-23 06:22:58,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 06:22:58,459 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-23 06:22:58,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-07-23 06:22:58,484 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-23 06:22:58,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-23 06:22:58,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-23 06:22:58,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:22:58,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:22:58,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-23 06:22:58,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-23 06:22:58,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:22:58,684 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:22:58,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-23 06:22:58,689 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:22:58,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:22:58,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:22:58,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:22:58,780 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_1649) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_1650) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_1649) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 4)))) is different from false [2022-07-23 06:23:04,835 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1643 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_108| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_108| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_27| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_27|))) (forall ((v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1643) |v_ULTIMATE.start_main_~tmp~0#1.base_27| v_ArrVal_1649) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|) 4))))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_108|)))) (forall ((v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_108| Int)) (or (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_27| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_27|))) (forall ((v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1649 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1643) |v_ULTIMATE.start_main_~tmp~0#1.base_27| v_ArrVal_1649) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|) 8) (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_27| v_ArrVal_1644) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1642) |v_ULTIMATE.start_main_~tmp~0#1.base_27| v_ArrVal_1650) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|)))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_108| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_108|))))) is different from false [2022-07-23 06:23:04,993 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_108| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_108| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_27| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_27|))) (forall ((v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1649 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1643) |v_ULTIMATE.start_main_~tmp~0#1.base_27| v_ArrVal_1649) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|) 8) (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_27| v_ArrVal_1644) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1642) |v_ULTIMATE.start_main_~tmp~0#1.base_27| v_ArrVal_1650) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|)))))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_108|)))) (forall ((v_ArrVal_1643 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_108| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_108| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_27| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_27|))) (forall ((v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1643) |v_ULTIMATE.start_main_~tmp~0#1.base_27| v_ArrVal_1649) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|) 4))))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_108|))))) is different from false [2022-07-23 06:23:05,026 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1643 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_108| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_108| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_27| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_27|))) (forall ((v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1643) |v_ULTIMATE.start_main_~tmp~0#1.base_27| v_ArrVal_1649) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|) 4))))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_108|)))) (forall ((v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_108| Int)) (or (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_27| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_27|))) (forall ((v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1649 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1643) |v_ULTIMATE.start_main_~tmp~0#1.base_27| v_ArrVal_1649) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|) 8) (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_27| v_ArrVal_1644) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1642) |v_ULTIMATE.start_main_~tmp~0#1.base_27| v_ArrVal_1650) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_108| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_108|))))) is different from false [2022-07-23 06:23:05,090 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1643 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_108| Int) (v_ArrVal_1639 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_108| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_108|)) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_27| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_27|))) (forall ((v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1638) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1639) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1643) |v_ULTIMATE.start_main_~tmp~0#1.base_27| v_ArrVal_1649) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|) 4))))))) (forall ((v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_108| Int) (v_ArrVal_1639 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_27| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_27|))) (forall ((v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1649 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1639))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1638) .cse0 v_ArrVal_1643) |v_ULTIMATE.start_main_~tmp~0#1.base_27| v_ArrVal_1649) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|) 8) (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_27| v_ArrVal_1644) (select (select (store (store .cse1 .cse0 v_ArrVal_1642) |v_ULTIMATE.start_main_~tmp~0#1.base_27| v_ArrVal_1650) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|)))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_108| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_108|))))) is different from false [2022-07-23 06:23:05,135 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1643 (Array Int Int)) (v_ArrVal_1642 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_108| Int) (v_ArrVal_1639 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_108| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_27| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_27|))) (forall ((v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1644 Int) (v_ArrVal_1649 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1639))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1638) .cse1 v_ArrVal_1643) |v_ULTIMATE.start_main_~tmp~0#1.base_27| v_ArrVal_1649) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|) 8) (select (store |c_#length| |v_ULTIMATE.start_main_~tmp~0#1.base_27| v_ArrVal_1644) (select (select (store (store .cse2 .cse1 v_ArrVal_1642) |v_ULTIMATE.start_main_~tmp~0#1.base_27| v_ArrVal_1650) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|))))))))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_108|)))) (forall ((v_ArrVal_1643 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_108| Int) (v_ArrVal_1639 (Array Int Int)) (v_ArrVal_1638 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~tmp~0#1.base_27| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~tmp~0#1.base_27|))) (forall ((v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (select (select (store (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1638) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1639) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1643)) |v_ULTIMATE.start_main_~tmp~0#1.base_27| v_ArrVal_1649) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|) 4))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_108| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_108|))))) is different from false [2022-07-23 06:23:05,179 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:23:05,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2022-07-23 06:23:05,186 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:23:05,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-23 06:23:05,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2022-07-23 06:23:05,202 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:23:05,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 356 treesize of output 351 [2022-07-23 06:23:05,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 336 treesize of output 316 [2022-07-23 06:23:05,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 254 [2022-07-23 06:23:05,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 312 treesize of output 302 [2022-07-23 06:23:05,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 234 [2022-07-23 06:23:05,484 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:23:05,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 83 [2022-07-23 06:23:05,493 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:23:05,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 59 [2022-07-23 06:23:05,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:23:05,509 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:23:05,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 382 treesize of output 349 [2022-07-23 06:23:05,517 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:23:05,534 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:23:05,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1070 treesize of output 1029 [2022-07-23 06:23:05,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1014 treesize of output 974 [2022-07-23 06:23:05,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 974 treesize of output 958 [2022-07-23 06:23:05,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 958 treesize of output 918 [2022-07-23 06:23:05,587 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:23:05,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 918 treesize of output 850 [2022-07-23 06:23:08,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 135 [2022-07-23 06:23:11,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:23:11,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701011173] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:23:11,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:23:11,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 42 [2022-07-23 06:23:11,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472378371] [2022-07-23 06:23:11,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:23:11,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-23 06:23:11,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:23:11,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-23 06:23:11,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1174, Unknown=7, NotChecked=450, Total=1806 [2022-07-23 06:23:11,154 INFO L87 Difference]: Start difference. First operand 323 states and 373 transitions. Second operand has 43 states, 42 states have (on average 3.142857142857143) internal successors, (132), 43 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:23:13,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:23:13,466 INFO L93 Difference]: Finished difference Result 393 states and 448 transitions. [2022-07-23 06:23:13,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 06:23:13,466 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.142857142857143) internal successors, (132), 43 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-23 06:23:13,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:23:13,467 INFO L225 Difference]: With dead ends: 393 [2022-07-23 06:23:13,467 INFO L226 Difference]: Without dead ends: 393 [2022-07-23 06:23:13,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=481, Invalid=2292, Unknown=7, NotChecked=642, Total=3422 [2022-07-23 06:23:13,469 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 640 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1243 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:23:13,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 1604 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1379 Invalid, 0 Unknown, 1243 Unchecked, 1.0s Time] [2022-07-23 06:23:13,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-07-23 06:23:13,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 323. [2022-07-23 06:23:13,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 296 states have (on average 1.2567567567567568) internal successors, (372), 322 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:23:13,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 372 transitions. [2022-07-23 06:23:13,473 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 372 transitions. Word has length 45 [2022-07-23 06:23:13,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:23:13,473 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 372 transitions. [2022-07-23 06:23:13,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.142857142857143) internal successors, (132), 43 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:23:13,474 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 372 transitions. [2022-07-23 06:23:13,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-23 06:23:13,474 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:23:13,474 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:23:13,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-23 06:23:13,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-23 06:23:13,679 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-23 06:23:13,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:23:13,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1349607265, now seen corresponding path program 2 times [2022-07-23 06:23:13,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:23:13,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241366645] [2022-07-23 06:23:13,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:23:13,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:23:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:23:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:23:14,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:23:14,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241366645] [2022-07-23 06:23:14,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241366645] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:23:14,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569731498] [2022-07-23 06:23:14,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:23:14,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:23:14,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:23:14,171 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:23:14,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-23 06:23:14,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:23:14,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:23:14,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-23 06:23:14,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:23:14,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:23:14,417 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:23:14,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 06:23:14,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:23:14,602 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:23:14,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-23 06:23:14,707 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:23:14,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-23 06:23:14,752 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:23:14,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-23 06:23:14,783 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-23 06:23:14,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-23 06:23:14,831 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-23 06:23:14,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2022-07-23 06:23:14,944 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-07-23 06:23:14,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 38