./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 2329fc70 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-?-2329fc7 [2023-02-14 02:08:45,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 02:08:45,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 02:08:45,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 02:08:45,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 02:08:45,066 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 02:08:45,068 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 02:08:45,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 02:08:45,071 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 02:08:45,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 02:08:45,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 02:08:45,077 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 02:08:45,077 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 02:08:45,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 02:08:45,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 02:08:45,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 02:08:45,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 02:08:45,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 02:08:45,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 02:08:45,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 02:08:45,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 02:08:45,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 02:08:45,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 02:08:45,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 02:08:45,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 02:08:45,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 02:08:45,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 02:08:45,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 02:08:45,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 02:08:45,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 02:08:45,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 02:08:45,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 02:08:45,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 02:08:45,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 02:08:45,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 02:08:45,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 02:08:45,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 02:08:45,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 02:08:45,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 02:08:45,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 02:08:45,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 02:08:45,107 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 02:08:45,134 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 02:08:45,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 02:08:45,135 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 02:08:45,135 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 02:08:45,135 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 02:08:45,136 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 02:08:45,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 02:08:45,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 02:08:45,136 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 02:08:45,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 02:08:45,137 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 02:08:45,137 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 02:08:45,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 02:08:45,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 02:08:45,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 02:08:45,138 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 02:08:45,138 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 02:08:45,138 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 02:08:45,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 02:08:45,138 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 02:08:45,138 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 02:08:45,138 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 02:08:45,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 02:08:45,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 02:08:45,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 02:08:45,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 02:08:45,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 02:08:45,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 02:08:45,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 02:08:45,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 02:08:45,140 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 02:08:45,140 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 02:08:45,140 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 02:08:45,141 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 02:08:45,141 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 [2023-02-14 02:08:45,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 02:08:45,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 02:08:45,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 02:08:45,349 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 02:08:45,349 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 02:08:45,350 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 [2023-02-14 02:08:46,250 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 02:08:46,456 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 02:08:46,456 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i [2023-02-14 02:08:46,464 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84b7643ba/bb420347ff4540dbbed9d70483f3fd66/FLAG9fd14d10e [2023-02-14 02:08:46,477 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84b7643ba/bb420347ff4540dbbed9d70483f3fd66 [2023-02-14 02:08:46,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 02:08:46,480 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 02:08:46,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 02:08:46,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 02:08:46,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 02:08:46,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:08:46" (1/1) ... [2023-02-14 02:08:46,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be096d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:08:46, skipping insertion in model container [2023-02-14 02:08:46,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:08:46" (1/1) ... [2023-02-14 02:08:46,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 02:08:46,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 02:08:46,679 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22384,22397] [2023-02-14 02:08:46,686 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22614,22627] [2023-02-14 02:08:46,693 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22989,23002] [2023-02-14 02:08:46,694 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23053,23066] [2023-02-14 02:08:46,696 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23184,23197] [2023-02-14 02:08:46,697 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23248,23261] [2023-02-14 02:08:46,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 02:08:46,712 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 02:08:46,759 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22384,22397] [2023-02-14 02:08:46,761 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22614,22627] [2023-02-14 02:08:46,763 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22989,23002] [2023-02-14 02:08:46,763 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23053,23066] [2023-02-14 02:08:46,764 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23184,23197] [2023-02-14 02:08:46,765 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23248,23261] [2023-02-14 02:08:46,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 02:08:46,783 INFO L208 MainTranslator]: Completed translation [2023-02-14 02:08:46,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:08:46 WrapperNode [2023-02-14 02:08:46,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 02:08:46,785 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 02:08:46,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 02:08:46,785 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 02:08:46,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:08:46" (1/1) ... [2023-02-14 02:08:46,804 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:08:46" (1/1) ... [2023-02-14 02:08:46,837 INFO L138 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 197 [2023-02-14 02:08:46,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 02:08:46,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 02:08:46,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 02:08:46,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 02:08:46,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:08:46" (1/1) ... [2023-02-14 02:08:46,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:08:46" (1/1) ... [2023-02-14 02:08:46,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:08:46" (1/1) ... [2023-02-14 02:08:46,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:08:46" (1/1) ... [2023-02-14 02:08:46,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:08:46" (1/1) ... [2023-02-14 02:08:46,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:08:46" (1/1) ... [2023-02-14 02:08:46,862 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:08:46" (1/1) ... [2023-02-14 02:08:46,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:08:46" (1/1) ... [2023-02-14 02:08:46,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 02:08:46,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 02:08:46,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 02:08:46,866 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 02:08:46,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:08:46" (1/1) ... [2023-02-14 02:08:46,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 02:08:46,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:08:46,898 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-14 02:08:46,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-14 02:08:46,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 02:08:46,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 02:08:46,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 02:08:46,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 02:08:46,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 02:08:46,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 02:08:46,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 02:08:46,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 02:08:46,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 02:08:46,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 02:08:47,038 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 02:08:47,040 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 02:08:47,425 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 02:08:47,432 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 02:08:47,432 INFO L300 CfgBuilder]: Removed 18 assume(true) statements. [2023-02-14 02:08:47,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:08:47 BoogieIcfgContainer [2023-02-14 02:08:47,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 02:08:47,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 02:08:47,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 02:08:47,441 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 02:08:47,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 02:08:46" (1/3) ... [2023-02-14 02:08:47,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14398b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:08:47, skipping insertion in model container [2023-02-14 02:08:47,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:08:46" (2/3) ... [2023-02-14 02:08:47,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14398b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:08:47, skipping insertion in model container [2023-02-14 02:08:47,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:08:47" (3/3) ... [2023-02-14 02:08:47,445 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2023-02-14 02:08:47,459 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 02:08:47,459 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2023-02-14 02:08:47,500 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 02:08:47,505 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e3a769f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 02:08:47,506 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2023-02-14 02:08:47,509 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) [2023-02-14 02:08:47,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-14 02:08:47,513 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:08:47,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-14 02:08:47,514 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)] === [2023-02-14 02:08:47,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:08:47,517 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-14 02:08:47,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:08:47,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324138108] [2023-02-14 02:08:47,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:08:47,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:08:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:08:47,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:08:47,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:08:47,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324138108] [2023-02-14 02:08:47,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324138108] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:08:47,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:08:47,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:08:47,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560078567] [2023-02-14 02:08:47,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:08:47,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:08:47,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:08:47,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:08:47,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:08:47,691 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) [2023-02-14 02:08:47,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:08:47,789 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2023-02-14 02:08:47,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:08:47,791 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 [2023-02-14 02:08:47,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:08:47,804 INFO L225 Difference]: With dead ends: 182 [2023-02-14 02:08:47,804 INFO L226 Difference]: Without dead ends: 178 [2023-02-14 02:08:47,805 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 [2023-02-14 02:08:47,810 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 [2023-02-14 02:08:47,811 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] [2023-02-14 02:08:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-02-14 02:08:47,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2023-02-14 02:08:47,834 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) [2023-02-14 02:08:47,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 185 transitions. [2023-02-14 02:08:47,836 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 185 transitions. Word has length 3 [2023-02-14 02:08:47,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:08:47,837 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 185 transitions. [2023-02-14 02:08:47,837 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) [2023-02-14 02:08:47,837 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 185 transitions. [2023-02-14 02:08:47,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-14 02:08:47,838 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:08:47,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-14 02:08:47,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 02:08:47,838 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)] === [2023-02-14 02:08:47,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:08:47,839 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-14 02:08:47,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:08:47,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22666315] [2023-02-14 02:08:47,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:08:47,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:08:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:08:47,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:08:47,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:08:47,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22666315] [2023-02-14 02:08:47,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22666315] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:08:47,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:08:47,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:08:47,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368450908] [2023-02-14 02:08:47,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:08:47,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:08:47,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:08:47,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:08:47,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:08:47,926 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) [2023-02-14 02:08:48,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:08:48,031 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2023-02-14 02:08:48,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:08:48,032 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 [2023-02-14 02:08:48,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:08:48,038 INFO L225 Difference]: With dead ends: 175 [2023-02-14 02:08:48,039 INFO L226 Difference]: Without dead ends: 175 [2023-02-14 02:08:48,039 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 [2023-02-14 02:08:48,040 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 [2023-02-14 02:08:48,040 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] [2023-02-14 02:08:48,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-02-14 02:08:48,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2023-02-14 02:08:48,057 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) [2023-02-14 02:08:48,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 182 transitions. [2023-02-14 02:08:48,064 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 182 transitions. Word has length 3 [2023-02-14 02:08:48,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:08:48,065 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 182 transitions. [2023-02-14 02:08:48,065 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) [2023-02-14 02:08:48,065 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 182 transitions. [2023-02-14 02:08:48,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-14 02:08:48,065 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:08:48,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:08:48,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 02:08:48,066 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)] === [2023-02-14 02:08:48,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:08:48,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2023-02-14 02:08:48,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:08:48,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282060720] [2023-02-14 02:08:48,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:08:48,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:08:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:08:48,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:08:48,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:08:48,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282060720] [2023-02-14 02:08:48,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282060720] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:08:48,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:08:48,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:08:48,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100708437] [2023-02-14 02:08:48,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:08:48,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 02:08:48,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:08:48,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 02:08:48,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 02:08:48,222 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) [2023-02-14 02:08:48,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:08:48,364 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2023-02-14 02:08:48,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 02:08:48,364 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 [2023-02-14 02:08:48,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:08:48,365 INFO L225 Difference]: With dead ends: 178 [2023-02-14 02:08:48,366 INFO L226 Difference]: Without dead ends: 178 [2023-02-14 02:08:48,366 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 [2023-02-14 02:08:48,368 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 298 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:08:48,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 89 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:08:48,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-02-14 02:08:48,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 167. [2023-02-14 02:08:48,385 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) [2023-02-14 02:08:48,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 189 transitions. [2023-02-14 02:08:48,388 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 189 transitions. Word has length 9 [2023-02-14 02:08:48,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:08:48,388 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 189 transitions. [2023-02-14 02:08:48,388 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) [2023-02-14 02:08:48,388 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 189 transitions. [2023-02-14 02:08:48,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-14 02:08:48,389 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:08:48,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:08:48,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 02:08:48,389 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)] === [2023-02-14 02:08:48,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:08:48,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2023-02-14 02:08:48,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:08:48,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138024361] [2023-02-14 02:08:48,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:08:48,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:08:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:08:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:08:48,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:08:48,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138024361] [2023-02-14 02:08:48,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138024361] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:08:48,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:08:48,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 02:08:48,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430666221] [2023-02-14 02:08:48,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:08:48,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 02:08:48,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:08:48,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 02:08:48,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 02:08:48,565 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) [2023-02-14 02:08:48,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:08:48,767 INFO L93 Difference]: Finished difference Result 258 states and 282 transitions. [2023-02-14 02:08:48,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 02:08:48,767 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 [2023-02-14 02:08:48,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:08:48,768 INFO L225 Difference]: With dead ends: 258 [2023-02-14 02:08:48,768 INFO L226 Difference]: Without dead ends: 258 [2023-02-14 02:08:48,768 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 [2023-02-14 02:08:48,772 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 439 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 02:08:48,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 130 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 02:08:48,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-02-14 02:08:48,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 220. [2023-02-14 02:08:48,779 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) [2023-02-14 02:08:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 264 transitions. [2023-02-14 02:08:48,781 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 264 transitions. Word has length 9 [2023-02-14 02:08:48,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:08:48,781 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 264 transitions. [2023-02-14 02:08:48,781 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) [2023-02-14 02:08:48,781 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 264 transitions. [2023-02-14 02:08:48,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-14 02:08:48,782 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:08:48,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:08:48,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 02:08:48,782 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)] === [2023-02-14 02:08:48,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:08:48,783 INFO L85 PathProgramCache]: Analyzing trace with hash 233093812, now seen corresponding path program 1 times [2023-02-14 02:08:48,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:08:48,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398462742] [2023-02-14 02:08:48,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:08:48,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:08:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:08:48,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:08:48,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:08:48,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398462742] [2023-02-14 02:08:48,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398462742] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:08:48,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:08:48,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:08:48,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435876330] [2023-02-14 02:08:48,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:08:48,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:08:48,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:08:48,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:08:48,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:08:48,816 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) [2023-02-14 02:08:48,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:08:48,835 INFO L93 Difference]: Finished difference Result 266 states and 313 transitions. [2023-02-14 02:08:48,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:08:48,835 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 [2023-02-14 02:08:48,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:08:48,837 INFO L225 Difference]: With dead ends: 266 [2023-02-14 02:08:48,837 INFO L226 Difference]: Without dead ends: 266 [2023-02-14 02:08:48,837 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 [2023-02-14 02:08:48,838 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 [2023-02-14 02:08:48,838 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] [2023-02-14 02:08:48,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-02-14 02:08:48,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 233. [2023-02-14 02:08:48,845 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) [2023-02-14 02:08:48,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 284 transitions. [2023-02-14 02:08:48,846 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 284 transitions. Word has length 11 [2023-02-14 02:08:48,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:08:48,847 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 284 transitions. [2023-02-14 02:08:48,847 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) [2023-02-14 02:08:48,847 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 284 transitions. [2023-02-14 02:08:48,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 02:08:48,847 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:08:48,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:08:48,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 02:08:48,848 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)] === [2023-02-14 02:08:48,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:08:48,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2023-02-14 02:08:48,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:08:48,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315368873] [2023-02-14 02:08:48,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:08:48,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:08:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:08:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:08:48,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:08:48,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315368873] [2023-02-14 02:08:48,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315368873] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:08:48,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:08:48,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 02:08:48,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715390450] [2023-02-14 02:08:48,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:08:48,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 02:08:48,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:08:48,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 02:08:48,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 02:08:48,983 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) [2023-02-14 02:08:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:08:49,135 INFO L93 Difference]: Finished difference Result 232 states and 281 transitions. [2023-02-14 02:08:49,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 02:08:49,136 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 [2023-02-14 02:08:49,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:08:49,137 INFO L225 Difference]: With dead ends: 232 [2023-02-14 02:08:49,137 INFO L226 Difference]: Without dead ends: 232 [2023-02-14 02:08:49,137 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 [2023-02-14 02:08:49,138 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 7 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:08:49,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 406 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:08:49,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-02-14 02:08:49,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2023-02-14 02:08:49,142 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) [2023-02-14 02:08:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 281 transitions. [2023-02-14 02:08:49,143 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 281 transitions. Word has length 12 [2023-02-14 02:08:49,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:08:49,143 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 281 transitions. [2023-02-14 02:08:49,143 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) [2023-02-14 02:08:49,143 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 281 transitions. [2023-02-14 02:08:49,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 02:08:49,144 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:08:49,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:08:49,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 02:08:49,144 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)] === [2023-02-14 02:08:49,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:08:49,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2023-02-14 02:08:49,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:08:49,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061723395] [2023-02-14 02:08:49,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:08:49,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:08:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:08:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:08:49,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:08:49,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061723395] [2023-02-14 02:08:49,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061723395] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:08:49,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:08:49,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 02:08:49,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280086080] [2023-02-14 02:08:49,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:08:49,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 02:08:49,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:08:49,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 02:08:49,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 02:08:49,201 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) [2023-02-14 02:08:49,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:08:49,334 INFO L93 Difference]: Finished difference Result 231 states and 278 transitions. [2023-02-14 02:08:49,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 02:08:49,335 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 [2023-02-14 02:08:49,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:08:49,336 INFO L225 Difference]: With dead ends: 231 [2023-02-14 02:08:49,336 INFO L226 Difference]: Without dead ends: 231 [2023-02-14 02:08:49,336 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 [2023-02-14 02:08:49,337 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 8 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:08:49,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 426 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:08:49,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-02-14 02:08:49,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2023-02-14 02:08:49,340 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) [2023-02-14 02:08:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 278 transitions. [2023-02-14 02:08:49,341 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 278 transitions. Word has length 12 [2023-02-14 02:08:49,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:08:49,341 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 278 transitions. [2023-02-14 02:08:49,341 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) [2023-02-14 02:08:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 278 transitions. [2023-02-14 02:08:49,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 02:08:49,342 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:08:49,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:08:49,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 02:08:49,342 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)] === [2023-02-14 02:08:49,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:08:49,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2023-02-14 02:08:49,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:08:49,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831570610] [2023-02-14 02:08:49,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:08:49,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:08:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:08:49,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:08:49,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:08:49,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831570610] [2023-02-14 02:08:49,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831570610] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:08:49,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:08:49,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-14 02:08:49,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162918512] [2023-02-14 02:08:49,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:08:49,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-14 02:08:49,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:08:49,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-14 02:08:49,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-14 02:08:49,475 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) [2023-02-14 02:08:49,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:08:49,730 INFO L93 Difference]: Finished difference Result 237 states and 279 transitions. [2023-02-14 02:08:49,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 02:08:49,731 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 [2023-02-14 02:08:49,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:08:49,731 INFO L225 Difference]: With dead ends: 237 [2023-02-14 02:08:49,731 INFO L226 Difference]: Without dead ends: 237 [2023-02-14 02:08:49,732 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 [2023-02-14 02:08:49,732 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 296 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 02:08:49,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 289 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 02:08:49,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-02-14 02:08:49,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 230. [2023-02-14 02:08:49,735 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) [2023-02-14 02:08:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 276 transitions. [2023-02-14 02:08:49,735 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 276 transitions. Word has length 16 [2023-02-14 02:08:49,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:08:49,736 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 276 transitions. [2023-02-14 02:08:49,736 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) [2023-02-14 02:08:49,736 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 276 transitions. [2023-02-14 02:08:49,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 02:08:49,736 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:08:49,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:08:49,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-14 02:08:49,736 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)] === [2023-02-14 02:08:49,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:08:49,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2023-02-14 02:08:49,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:08:49,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572949657] [2023-02-14 02:08:49,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:08:49,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:08:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:08:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:08:49,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:08:49,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572949657] [2023-02-14 02:08:49,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572949657] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:08:49,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:08:49,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-14 02:08:49,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180580462] [2023-02-14 02:08:49,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:08:49,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 02:08:49,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:08:49,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 02:08:49,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-14 02:08:49,949 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) [2023-02-14 02:08:50,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:08:50,376 INFO L93 Difference]: Finished difference Result 232 states and 270 transitions. [2023-02-14 02:08:50,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-14 02:08:50,377 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 [2023-02-14 02:08:50,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:08:50,378 INFO L225 Difference]: With dead ends: 232 [2023-02-14 02:08:50,378 INFO L226 Difference]: Without dead ends: 232 [2023-02-14 02:08:50,378 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 [2023-02-14 02:08:50,378 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 294 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 02:08:50,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 388 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 02:08:50,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-02-14 02:08:50,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 216. [2023-02-14 02:08:50,381 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) [2023-02-14 02:08:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 258 transitions. [2023-02-14 02:08:50,382 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 258 transitions. Word has length 16 [2023-02-14 02:08:50,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:08:50,382 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 258 transitions. [2023-02-14 02:08:50,382 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) [2023-02-14 02:08:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 258 transitions. [2023-02-14 02:08:50,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-14 02:08:50,383 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:08:50,383 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] [2023-02-14 02:08:50,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-14 02:08:50,383 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)] === [2023-02-14 02:08:50,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:08:50,383 INFO L85 PathProgramCache]: Analyzing trace with hash -961820477, now seen corresponding path program 1 times [2023-02-14 02:08:50,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:08:50,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439716192] [2023-02-14 02:08:50,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:08:50,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:08:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:08:50,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 02:08:50,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:08:50,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439716192] [2023-02-14 02:08:50,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439716192] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:08:50,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:08:50,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 02:08:50,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679184498] [2023-02-14 02:08:50,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:08:50,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 02:08:50,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:08:50,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 02:08:50,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 02:08:50,434 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) [2023-02-14 02:08:50,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:08:50,523 INFO L93 Difference]: Finished difference Result 253 states and 276 transitions. [2023-02-14 02:08:50,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 02:08:50,523 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 [2023-02-14 02:08:50,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:08:50,524 INFO L225 Difference]: With dead ends: 253 [2023-02-14 02:08:50,524 INFO L226 Difference]: Without dead ends: 253 [2023-02-14 02:08:50,525 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 [2023-02-14 02:08:50,525 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 297 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:08:50,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 202 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:08:50,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-02-14 02:08:50,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 214. [2023-02-14 02:08:50,528 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) [2023-02-14 02:08:50,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 254 transitions. [2023-02-14 02:08:50,529 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 254 transitions. Word has length 25 [2023-02-14 02:08:50,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:08:50,529 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 254 transitions. [2023-02-14 02:08:50,529 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) [2023-02-14 02:08:50,530 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 254 transitions. [2023-02-14 02:08:50,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-14 02:08:50,530 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:08:50,530 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] [2023-02-14 02:08:50,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-14 02:08:50,531 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)] === [2023-02-14 02:08:50,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:08:50,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1496912174, now seen corresponding path program 1 times [2023-02-14 02:08:50,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:08:50,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018521871] [2023-02-14 02:08:50,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:08:50,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:08:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:08:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:08:50,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:08:50,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018521871] [2023-02-14 02:08:50,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018521871] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:08:50,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133718767] [2023-02-14 02:08:50,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:08:50,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:08:50,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:08:50,829 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:08:50,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-14 02:08:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:08:50,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-14 02:08:50,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:08:50,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:08:51,026 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:08:51,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 02:08:51,053 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 02:08:51,140 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:08:51,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-02-14 02:08:51,232 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:08:51,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2023-02-14 02:08:51,284 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:08:51,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-14 02:08:51,391 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:08:51,393 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:08:51,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2023-02-14 02:08:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:08:51,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:08:51,610 INFO L321 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2023-02-14 02:08:51,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-02-14 02:08:51,756 WARN L837 $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 [2023-02-14 02:08:51,767 WARN L837 $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 [2023-02-14 02:08:51,785 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:08:51,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 36 [2023-02-14 02:08:51,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:08:51,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 137 [2023-02-14 02:08:51,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2023-02-14 02:08:51,808 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:08:51,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 102 [2023-02-14 02:08:52,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:08:52,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133718767] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:08:52,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:08:52,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2023-02-14 02:08:52,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255474510] [2023-02-14 02:08:52,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:08:52,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-14 02:08:52,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:08:52,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-14 02:08:52,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=947, Unknown=10, NotChecked=126, Total=1190 [2023-02-14 02:08:52,123 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) [2023-02-14 02:08:55,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:08:55,848 INFO L93 Difference]: Finished difference Result 427 states and 484 transitions. [2023-02-14 02:08:55,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-14 02:08:55,848 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 [2023-02-14 02:08:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:08:55,850 INFO L225 Difference]: With dead ends: 427 [2023-02-14 02:08:55,850 INFO L226 Difference]: Without dead ends: 427 [2023-02-14 02:08:55,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=402, Invalid=2146, Unknown=10, NotChecked=198, Total=2756 [2023-02-14 02:08:55,851 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 998 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 2729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 675 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:08:55,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 1491 Invalid, 2729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1957 Invalid, 0 Unknown, 675 Unchecked, 1.0s Time] [2023-02-14 02:08:55,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2023-02-14 02:08:55,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 239. [2023-02-14 02:08:55,856 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) [2023-02-14 02:08:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 284 transitions. [2023-02-14 02:08:55,857 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 284 transitions. Word has length 31 [2023-02-14 02:08:55,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:08:55,857 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 284 transitions. [2023-02-14 02:08:55,858 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) [2023-02-14 02:08:55,858 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 284 transitions. [2023-02-14 02:08:55,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-14 02:08:55,860 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:08:55,860 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] [2023-02-14 02:08:55,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-14 02:08:56,065 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 [2023-02-14 02:08:56,065 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)] === [2023-02-14 02:08:56,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:08:56,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1496912173, now seen corresponding path program 1 times [2023-02-14 02:08:56,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:08:56,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141970896] [2023-02-14 02:08:56,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:08:56,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:08:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:08:56,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:08:56,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:08:56,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141970896] [2023-02-14 02:08:56,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141970896] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:08:56,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488959428] [2023-02-14 02:08:56,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:08:56,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:08:56,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:08:56,455 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:08:56,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-14 02:08:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:08:56,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-14 02:08:56,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:08:56,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:08:56,608 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:08:56,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 02:08:56,617 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 02:08:56,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:08:56,657 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 02:08:56,763 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:08:56,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-14 02:08:56,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 02:08:56,850 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:08:56,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-14 02:08:56,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:08:56,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 02:08:56,899 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:08:56,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-14 02:08:56,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 02:08:57,036 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:08:57,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 02:08:57,041 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:08:57,043 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:08:57,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2023-02-14 02:08:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:08:57,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:08:57,780 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (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 ((.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 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_436) (select (select (store |c_#memory_$Pointer$.base| .cse0 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 [2023-02-14 02:08:57,814 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:08:57,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2023-02-14 02:08:57,825 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:08:57,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-02-14 02:08:57,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2023-02-14 02:08:57,841 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:08:57,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 181 [2023-02-14 02:08:57,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 156 [2023-02-14 02:08:57,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 126 [2023-02-14 02:08:57,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2023-02-14 02:08:57,942 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:08:57,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2023-02-14 02:08:57,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:08:57,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2023-02-14 02:08:57,952 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:08:57,953 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:08:57,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:08:57,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:08:57,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2023-02-14 02:08:57,960 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:08:57,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:08:57,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:08:57,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2023-02-14 02:08:57,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2023-02-14 02:08:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:08:58,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488959428] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:08:58,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:08:58,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2023-02-14 02:08:58,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185350529] [2023-02-14 02:08:58,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:08:58,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-14 02:08:58,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:08:58,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-14 02:08:58,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1052, Unknown=18, NotChecked=66, Total=1260 [2023-02-14 02:08:58,217 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) [2023-02-14 02:09:05,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:09:05,695 INFO L93 Difference]: Finished difference Result 418 states and 475 transitions. [2023-02-14 02:09:05,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-14 02:09:05,696 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 [2023-02-14 02:09:05,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:09:05,697 INFO L225 Difference]: With dead ends: 418 [2023-02-14 02:09:05,697 INFO L226 Difference]: Without dead ends: 418 [2023-02-14 02:09:05,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=426, Invalid=2315, Unknown=19, NotChecked=102, Total=2862 [2023-02-14 02:09:05,698 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 1599 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 1991 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 2342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 244 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:09:05,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1599 Valid, 1233 Invalid, 2342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1991 Invalid, 0 Unknown, 244 Unchecked, 2.1s Time] [2023-02-14 02:09:05,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2023-02-14 02:09:05,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 239. [2023-02-14 02:09:05,702 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) [2023-02-14 02:09:05,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 283 transitions. [2023-02-14 02:09:05,702 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 283 transitions. Word has length 31 [2023-02-14 02:09:05,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:09:05,703 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 283 transitions. [2023-02-14 02:09:05,703 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) [2023-02-14 02:09:05,703 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 283 transitions. [2023-02-14 02:09:05,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-14 02:09:05,703 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:09:05,704 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] [2023-02-14 02:09:05,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-14 02:09:05,910 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 [2023-02-14 02:09:05,910 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)] === [2023-02-14 02:09:05,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:09:05,911 INFO L85 PathProgramCache]: Analyzing trace with hash 290187840, now seen corresponding path program 1 times [2023-02-14 02:09:05,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:09:05,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950973410] [2023-02-14 02:09:05,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:09:05,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:09:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:09:05,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 02:09:05,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:09:05,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950973410] [2023-02-14 02:09:05,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950973410] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:09:05,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:09:05,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 02:09:05,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080234079] [2023-02-14 02:09:05,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:09:05,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:09:05,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:09:05,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:09:05,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:09:05,944 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) [2023-02-14 02:09:05,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:09:05,955 INFO L93 Difference]: Finished difference Result 241 states and 285 transitions. [2023-02-14 02:09:05,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:09:05,955 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 [2023-02-14 02:09:05,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:09:05,956 INFO L225 Difference]: With dead ends: 241 [2023-02-14 02:09:05,956 INFO L226 Difference]: Without dead ends: 241 [2023-02-14 02:09:05,957 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 [2023-02-14 02:09:05,958 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 [2023-02-14 02:09:05,958 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] [2023-02-14 02:09:05,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-02-14 02:09:05,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2023-02-14 02:09:05,961 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) [2023-02-14 02:09:05,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 285 transitions. [2023-02-14 02:09:05,962 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 285 transitions. Word has length 33 [2023-02-14 02:09:05,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:09:05,963 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 285 transitions. [2023-02-14 02:09:05,963 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) [2023-02-14 02:09:05,963 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 285 transitions. [2023-02-14 02:09:05,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 02:09:05,966 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:09:05,966 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] [2023-02-14 02:09:05,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-14 02:09:05,967 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)] === [2023-02-14 02:09:05,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:09:05,967 INFO L85 PathProgramCache]: Analyzing trace with hash 2033494590, now seen corresponding path program 1 times [2023-02-14 02:09:05,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:09:05,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868385368] [2023-02-14 02:09:05,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:09:05,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:09:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:09:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 02:09:06,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:09:06,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868385368] [2023-02-14 02:09:06,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868385368] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:09:06,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:09:06,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 02:09:06,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625190746] [2023-02-14 02:09:06,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:09:06,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 02:09:06,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:09:06,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 02:09:06,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:09:06,135 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) [2023-02-14 02:09:06,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:09:06,469 INFO L93 Difference]: Finished difference Result 258 states and 304 transitions. [2023-02-14 02:09:06,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 02:09:06,469 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 [2023-02-14 02:09:06,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:09:06,471 INFO L225 Difference]: With dead ends: 258 [2023-02-14 02:09:06,471 INFO L226 Difference]: Without dead ends: 258 [2023-02-14 02:09:06,471 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 [2023-02-14 02:09:06,472 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 50 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 02:09:06,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 554 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 02:09:06,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-02-14 02:09:06,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 249. [2023-02-14 02:09:06,476 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) [2023-02-14 02:09:06,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 294 transitions. [2023-02-14 02:09:06,476 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 294 transitions. Word has length 36 [2023-02-14 02:09:06,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:09:06,477 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 294 transitions. [2023-02-14 02:09:06,477 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) [2023-02-14 02:09:06,477 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 294 transitions. [2023-02-14 02:09:06,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 02:09:06,478 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:09:06,478 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] [2023-02-14 02:09:06,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-14 02:09:06,478 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)] === [2023-02-14 02:09:06,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:09:06,479 INFO L85 PathProgramCache]: Analyzing trace with hash 2033554172, now seen corresponding path program 1 times [2023-02-14 02:09:06,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:09:06,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257960413] [2023-02-14 02:09:06,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:09:06,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:09:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:09:06,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 02:09:06,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:09:06,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257960413] [2023-02-14 02:09:06,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257960413] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:09:06,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:09:06,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:09:06,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861057809] [2023-02-14 02:09:06,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:09:06,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:09:06,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:09:06,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:09:06,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:09:06,537 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) [2023-02-14 02:09:06,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:09:06,661 INFO L93 Difference]: Finished difference Result 246 states and 286 transitions. [2023-02-14 02:09:06,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:09:06,662 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 [2023-02-14 02:09:06,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:09:06,663 INFO L225 Difference]: With dead ends: 246 [2023-02-14 02:09:06,663 INFO L226 Difference]: Without dead ends: 246 [2023-02-14 02:09:06,663 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 [2023-02-14 02:09:06,663 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 78 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:09:06,663 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.1s Time] [2023-02-14 02:09:06,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-02-14 02:09:06,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2023-02-14 02:09:06,668 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) [2023-02-14 02:09:06,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 286 transitions. [2023-02-14 02:09:06,669 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 286 transitions. Word has length 36 [2023-02-14 02:09:06,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:09:06,670 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 286 transitions. [2023-02-14 02:09:06,670 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) [2023-02-14 02:09:06,670 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 286 transitions. [2023-02-14 02:09:06,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 02:09:06,671 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:09:06,671 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] [2023-02-14 02:09:06,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-14 02:09:06,672 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)] === [2023-02-14 02:09:06,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:09:06,673 INFO L85 PathProgramCache]: Analyzing trace with hash 2033554173, now seen corresponding path program 1 times [2023-02-14 02:09:06,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:09:06,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042823308] [2023-02-14 02:09:06,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:09:06,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:09:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:09:06,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 02:09:06,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:09:06,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042823308] [2023-02-14 02:09:06,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042823308] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:09:06,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:09:06,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:09:06,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465396478] [2023-02-14 02:09:06,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:09:06,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:09:06,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:09:06,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:09:06,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:09:06,794 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) [2023-02-14 02:09:06,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:09:06,930 INFO L93 Difference]: Finished difference Result 241 states and 278 transitions. [2023-02-14 02:09:06,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:09:06,931 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 [2023-02-14 02:09:06,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:09:06,932 INFO L225 Difference]: With dead ends: 241 [2023-02-14 02:09:06,932 INFO L226 Difference]: Without dead ends: 241 [2023-02-14 02:09:06,932 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 [2023-02-14 02:09:06,932 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 82 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:09:06,932 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.1s Time] [2023-02-14 02:09:06,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-02-14 02:09:06,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2023-02-14 02:09:06,935 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) [2023-02-14 02:09:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 278 transitions. [2023-02-14 02:09:06,935 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 278 transitions. Word has length 36 [2023-02-14 02:09:06,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:09:06,935 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 278 transitions. [2023-02-14 02:09:06,936 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) [2023-02-14 02:09:06,936 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 278 transitions. [2023-02-14 02:09:06,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 02:09:06,936 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:09:06,936 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] [2023-02-14 02:09:06,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-14 02:09:06,936 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)] === [2023-02-14 02:09:06,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:09:06,936 INFO L85 PathProgramCache]: Analyzing trace with hash 817273180, now seen corresponding path program 1 times [2023-02-14 02:09:06,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:09:06,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892403543] [2023-02-14 02:09:06,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:09:06,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:09:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:09:07,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 02:09:07,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:09:07,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892403543] [2023-02-14 02:09:07,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892403543] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:09:07,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:09:07,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 02:09:07,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698709008] [2023-02-14 02:09:07,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:09:07,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 02:09:07,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:09:07,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 02:09:07,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 02:09:07,023 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) [2023-02-14 02:09:07,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:09:07,491 INFO L93 Difference]: Finished difference Result 261 states and 299 transitions. [2023-02-14 02:09:07,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 02:09:07,492 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 [2023-02-14 02:09:07,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:09:07,493 INFO L225 Difference]: With dead ends: 261 [2023-02-14 02:09:07,493 INFO L226 Difference]: Without dead ends: 261 [2023-02-14 02:09:07,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-14 02:09:07,493 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 114 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2023-02-14 02:09:07,493 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.4s Time] [2023-02-14 02:09:07,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-02-14 02:09:07,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 240. [2023-02-14 02:09:07,496 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) [2023-02-14 02:09:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 277 transitions. [2023-02-14 02:09:07,496 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 277 transitions. Word has length 36 [2023-02-14 02:09:07,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:09:07,497 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 277 transitions. [2023-02-14 02:09:07,497 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) [2023-02-14 02:09:07,497 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 277 transitions. [2023-02-14 02:09:07,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 02:09:07,498 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:09:07,498 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] [2023-02-14 02:09:07,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-14 02:09:07,498 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)] === [2023-02-14 02:09:07,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:09:07,498 INFO L85 PathProgramCache]: Analyzing trace with hash 817273181, now seen corresponding path program 1 times [2023-02-14 02:09:07,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:09:07,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078840928] [2023-02-14 02:09:07,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:09:07,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:09:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:09:08,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:09:08,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:09:08,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078840928] [2023-02-14 02:09:08,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078840928] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:09:08,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65271525] [2023-02-14 02:09:08,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:09:08,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:09:08,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:09:08,191 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:09:08,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-14 02:09:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:09:08,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-14 02:09:08,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:09:08,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:09:08,435 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:09:08,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 02:09:08,515 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 02:09:08,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:09:08,668 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:09:08,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-02-14 02:09:08,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 02:09:08,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-14 02:09:08,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 02:09:08,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 02:09:09,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-02-14 02:09:09,111 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:09:09,115 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:09:09,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 17 [2023-02-14 02:09:09,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:09:09,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:09:09,438 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:09:09,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2023-02-14 02:09:10,279 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:09:10,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2023-02-14 02:09:10,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:09:10,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-14 02:09:10,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2023-02-14 02:09:10,314 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:09:10,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 161 [2023-02-14 02:09:10,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 136 [2023-02-14 02:09:10,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2023-02-14 02:09:10,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 98 [2023-02-14 02:09:10,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:09:10,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65271525] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:09:10,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:09:10,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 44 [2023-02-14 02:09:10,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401485951] [2023-02-14 02:09:10,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:09:10,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-14 02:09:10,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:09:10,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-14 02:09:10,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1774, Unknown=17, NotChecked=0, Total=1980 [2023-02-14 02:09:10,834 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) [2023-02-14 02:09:17,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:09:17,845 INFO L93 Difference]: Finished difference Result 558 states and 630 transitions. [2023-02-14 02:09:17,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-02-14 02:09:17,846 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 [2023-02-14 02:09:17,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:09:17,847 INFO L225 Difference]: With dead ends: 558 [2023-02-14 02:09:17,847 INFO L226 Difference]: Without dead ends: 558 [2023-02-14 02:09:17,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1658, Invalid=9238, Unknown=24, NotChecked=0, Total=10920 [2023-02-14 02:09:17,850 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 2169 mSDsluCounter, 1820 mSDsCounter, 0 mSdLazyCounter, 2535 mSolverCounterSat, 210 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2169 SdHoareTripleChecker+Valid, 1920 SdHoareTripleChecker+Invalid, 2748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 2535 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-02-14 02:09:17,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2169 Valid, 1920 Invalid, 2748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 2535 Invalid, 3 Unknown, 0 Unchecked, 2.9s Time] [2023-02-14 02:09:17,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2023-02-14 02:09:17,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 269. [2023-02-14 02:09:17,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 239 states have (on average 1.301255230125523) internal successors, (311), 268 states have internal predecessors, (311), 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) [2023-02-14 02:09:17,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 311 transitions. [2023-02-14 02:09:17,854 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 311 transitions. Word has length 36 [2023-02-14 02:09:17,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:09:17,854 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 311 transitions. [2023-02-14 02:09:17,855 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) [2023-02-14 02:09:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 311 transitions. [2023-02-14 02:09:17,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-14 02:09:17,855 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:09:17,855 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] [2023-02-14 02:09:17,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-14 02:09:18,055 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 [2023-02-14 02:09:18,056 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)] === [2023-02-14 02:09:18,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:09:18,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1419322487, now seen corresponding path program 1 times [2023-02-14 02:09:18,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:09:18,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525247947] [2023-02-14 02:09:18,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:09:18,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:09:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:09:18,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 02:09:18,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:09:18,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525247947] [2023-02-14 02:09:18,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525247947] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:09:18,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:09:18,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 02:09:18,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098927789] [2023-02-14 02:09:18,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:09:18,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 02:09:18,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:09:18,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 02:09:18,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 02:09:18,152 INFO L87 Difference]: Start difference. First operand 269 states and 311 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) [2023-02-14 02:09:18,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:09:18,600 INFO L93 Difference]: Finished difference Result 289 states and 332 transitions. [2023-02-14 02:09:18,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 02:09:18,601 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 [2023-02-14 02:09:18,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:09:18,602 INFO L225 Difference]: With dead ends: 289 [2023-02-14 02:09:18,602 INFO L226 Difference]: Without dead ends: 289 [2023-02-14 02:09:18,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-14 02:09:18,602 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 101 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2023-02-14 02:09:18,602 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.4s Time] [2023-02-14 02:09:18,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-02-14 02:09:18,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 275. [2023-02-14 02:09:18,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 245 states have (on average 1.3061224489795917) internal successors, (320), 274 states have internal predecessors, (320), 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) [2023-02-14 02:09:18,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 320 transitions. [2023-02-14 02:09:18,606 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 320 transitions. Word has length 40 [2023-02-14 02:09:18,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:09:18,606 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 320 transitions. [2023-02-14 02:09:18,606 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) [2023-02-14 02:09:18,606 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 320 transitions. [2023-02-14 02:09:18,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-14 02:09:18,606 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:09:18,606 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] [2023-02-14 02:09:18,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-14 02:09:18,606 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)] === [2023-02-14 02:09:18,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:09:18,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1419322486, now seen corresponding path program 1 times [2023-02-14 02:09:18,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:09:18,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177794330] [2023-02-14 02:09:18,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:09:18,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:09:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:09:19,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:09:19,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:09:19,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177794330] [2023-02-14 02:09:19,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177794330] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:09:19,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845567041] [2023-02-14 02:09:19,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:09:19,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:09:19,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:09:19,169 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:09:19,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-14 02:09:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:09:19,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-14 02:09:19,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:09:19,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-02-14 02:09:19,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-02-14 02:09:19,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 02:09:19,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:09:19,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845567041] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:09:19,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 02:09:19,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2023-02-14 02:09:19,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996104207] [2023-02-14 02:09:19,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:09:19,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 02:09:19,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:09:19,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 02:09:19,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2023-02-14 02:09:19,488 INFO L87 Difference]: Start difference. First operand 275 states and 320 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) [2023-02-14 02:09:19,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:09:19,909 INFO L93 Difference]: Finished difference Result 284 states and 327 transitions. [2023-02-14 02:09:19,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 02:09:19,909 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 [2023-02-14 02:09:19,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:09:19,910 INFO L225 Difference]: With dead ends: 284 [2023-02-14 02:09:19,910 INFO L226 Difference]: Without dead ends: 284 [2023-02-14 02:09:19,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2023-02-14 02:09:19,911 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 53 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2023-02-14 02:09:19,911 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.3s Time] [2023-02-14 02:09:19,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-02-14 02:09:19,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 273. [2023-02-14 02:09:19,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 245 states have (on average 1.2857142857142858) internal successors, (315), 272 states have internal predecessors, (315), 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) [2023-02-14 02:09:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 315 transitions. [2023-02-14 02:09:19,914 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 315 transitions. Word has length 40 [2023-02-14 02:09:19,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:09:19,914 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 315 transitions. [2023-02-14 02:09:19,915 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) [2023-02-14 02:09:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 315 transitions. [2023-02-14 02:09:19,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-14 02:09:19,915 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:09:19,915 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] [2023-02-14 02:09:19,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-14 02:09:20,121 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 [2023-02-14 02:09:20,121 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)] === [2023-02-14 02:09:20,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:09:20,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1458488866, now seen corresponding path program 1 times [2023-02-14 02:09:20,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:09:20,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168605660] [2023-02-14 02:09:20,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:09:20,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:09:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:09:20,784 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:09:20,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:09:20,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168605660] [2023-02-14 02:09:20,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168605660] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:09:20,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374967133] [2023-02-14 02:09:20,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:09:20,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:09:20,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:09:20,786 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:09:20,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-14 02:09:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:09:20,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-14 02:09:20,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:09:20,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:09:21,033 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:09:21,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 02:09:21,069 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 02:09:21,185 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:09:21,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-02-14 02:09:21,358 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-14 02:09:21,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2023-02-14 02:09:21,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-14 02:09:21,526 INFO L321 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2023-02-14 02:09:21,526 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 89 treesize of output 70 [2023-02-14 02:09:21,545 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-02-14 02:09:21,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 52 [2023-02-14 02:09:22,134 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:09:22,156 INFO L321 Elim1Store]: treesize reduction 81, result has 8.0 percent of original size [2023-02-14 02:09:22,156 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 02:09:22,164 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:09:22,173 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 02:09:22,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 16 [2023-02-14 02:09:22,182 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:09:22,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:09:35,133 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:09:35,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 810 treesize of output 629 [2023-02-14 02:09:37,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:09:37,316 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 02:10:26,623 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse6 (= .cse2 |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse8 (not .cse6)) (.cse3 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse27 (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 ((.cse127 (+ 8 v_arrayElimIndex_15))) (or (= .cse127 |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) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse127 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|))))) (.cse49 (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 ((.cse126 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) 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|))) 0) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse8)) (.cse7 (< |c_ULTIMATE.start_main_~head~0#1.offset| 0)) (.cse50 (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)) (let ((.cse124 (+ 8 v_arrayElimCell_71))) (or (= .cse124 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse125 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse124 v_ArrVal_1019)))) (select .cse125 (select (select .cse125 |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|))))) (.cse60 (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 ((.cse122 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)))) (let ((.cse121 (let ((.cse123 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 .cse122 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse123 (select (select .cse123 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse121 .cse122) 0) (= (select .cse121 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)) (.cse88 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse120 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_72 0) (+ 8 v_arrayElimCell_72) v_ArrVal_1019)))) (select .cse120 (select (select .cse120 |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|))))) (.cse89 (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 ((.cse119 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse119 (select (select .cse119 |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|))))) (.cse61 (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 ((.cse117 (let ((.cse118 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| 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_ArrVal_1017) 0) (= (select .cse117 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|)) (.cse69 (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) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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)) (let ((.cse0 (+ 8 v_arrayElimCell_71))) (or (= .cse0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse0 v_ArrVal_1019)))) (select .cse1 (select (select .cse1 |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 ((.cse4 (+ 8 v_arrayElimCell_71))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= .cse4 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= (select (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse4 v_ArrVal_1019)))) (select .cse5 (select (select .cse5 |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|))))) .cse6) (or .cse7 (< |c_ULTIMATE.start_main_~x~0#1.offset| 1)) (or .cse8 (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 ((.cse9 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019)))) (select .cse9 (select (select .cse9 |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) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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 ((.cse14 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse14 (select (select .cse14 |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|))) .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_arrayElimCell_71 Int)) (let ((.cse15 (+ 8 v_arrayElimCell_71))) (or (= .cse15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (= (select (let ((.cse16 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse15 v_ArrVal_1019)))) (select .cse16 (select (select .cse16 |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)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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|)))) (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)) (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse17 v_arrayElimCell_72) 0) (forall ((v_ArrVal_1017 Int)) (= (select .cse17 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) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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)) (let ((.cse19 (+ 8 v_arrayElimIndex_15))) (or (= .cse19 |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)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse19 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 ((.cse20 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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| .cse20) (= .cse2 .cse20)))) (= |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|)))) (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 ((.cse22 (+ 8 v_arrayElimIndex_15))) (let ((.cse21 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse22 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| .cse21) (= .cse22 |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) (= .cse2 .cse21))))) (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)) (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse23 v_arrayElimCell_71) 0) (forall ((v_ArrVal_1017 Int)) (= (select .cse23 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 ((.cse26 (+ 8 v_arrayElimIndex_15))) (let ((.cse25 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse26 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| .cse25) (= .cse26 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 .cse25) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) .cse27 (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)) (let ((.cse28 (+ 8 v_arrayElimCell_71))) (or (= .cse28 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse29 (let ((.cse30 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse28 v_ArrVal_1019)))) (select .cse30 (select (select .cse30 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse29 0) 0) (= (select .cse29 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 ((.cse31 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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| .cse31) (= .cse2 .cse31)))) (= |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 ((.cse32 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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| .cse32) (= .cse2 .cse32)))) (= 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 ((.cse33 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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| .cse33) (= .cse2 .cse33)))) (= 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 ((.cse34 (let ((.cse35 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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|))))) (or (= (select .cse34 v_arrayElimCell_71) 0) (= (select .cse34 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 ((.cse36 (let ((.cse37 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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|))))) (or (= (select .cse36 v_arrayElimCell_72) 0) (= (select .cse36 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)) (let ((.cse39 (+ 8 v_arrayElimIndex_15))) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse38 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse39 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| .cse38) (= .cse2 .cse38)))) (= .cse39 |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 ((.cse40 (+ 8 v_arrayElimIndex_15))) (let ((.cse41 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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|)) (= .cse40 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse41) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 .cse41) (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)) (let ((.cse43 (+ 8 v_arrayElimIndex_15))) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse42 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse43 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| .cse42) (= .cse2 .cse42)))) (= .cse43 |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)) (let ((.cse46 (+ 8 v_arrayElimCell_71))) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (let ((.cse44 (let ((.cse45 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse46 v_ArrVal_1019)))) (select .cse45 (select (select .cse45 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse44 v_arrayElimCell_72) 0) (= (select .cse44 0) 0)))) (= .cse46 |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 ((.cse48 (+ 8 v_arrayElimCell_71))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse47 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse48 v_ArrVal_1019)))) (select .cse47 (select (select .cse47 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (= .cse48 |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|))))) .cse6) .cse49 .cse50) .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)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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 .cse7 (< |c_ULTIMATE.start_main_~head~0#1.offset| (+ |c_ULTIMATE.start_main_~x~0#1.offset| 1))) (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) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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)) (let ((.cse51 (+ 8 v_arrayElimIndex_15))) (or (= .cse51 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse52 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse51 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| .cse52) (= .cse2 .cse52))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or .cse8 (let ((.cse56 (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 ((.cse66 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| 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|))) 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 ((.cse54 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)))) (let ((.cse53 (let ((.cse55 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 .cse54 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse55 (select (select .cse55 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse53 0) 0) (= (select .cse53 .cse54) 0) (= (select .cse53 v_ArrVal_1017) 0))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse56 (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 ((.cse57 (let ((.cse58 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse58 (select (select .cse58 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse57 0) 0) (= (select .cse57 v_ArrVal_1017) 0) (= (select .cse57 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 ((.cse59 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse59 (select (select .cse59 |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|)))) .cse60 .cse61 (or (and .cse56 (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 ((.cse62 (let ((.cse63 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse63 (select (select .cse63 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse62 0) 0) (= (select .cse62 v_ArrVal_1017) 0) (= (select .cse62 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 ((.cse64 (let ((.cse65 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse65 (select (select .cse65 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse64 v_ArrVal_1017) 0) (= (select .cse64 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 ((.cse67 (let ((.cse68 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) 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|))))) (or (= (select .cse67 v_arrayElimCell_72) 0) (= (select .cse67 0) 0) (= (select .cse67 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 .cse27 .cse69)) (or .cse7 .cse11) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse71 (+ 8 v_arrayElimIndex_15))) (let ((.cse70 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse71 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| .cse70) (= .cse71 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0) (= .cse2 .cse70) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) .cse49 (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 ((.cse72 (let ((.cse73 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse73 (select (select .cse73 |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 .cse72 v_ArrVal_1017) 0) (= (select .cse72 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)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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 (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |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|))) (= (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) |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) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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 (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 ((.cse74 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse74 (select (select .cse74 |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|))) .cse6) (or .cse7 .cse8) (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 ((.cse75 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse75) (= .cse2 .cse75)))) (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 ((.cse76 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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| .cse76) (= .cse2 .cse76)))) (= |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 ((.cse78 (+ 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 ((.cse77 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse78 v_ArrVal_1019)))) (select .cse77 (select (select .cse77 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (= .cse78 |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|))))) .cse6) (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)) (let ((.cse81 (+ 8 v_arrayElimCell_71))) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (let ((.cse79 (let ((.cse80 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse81 v_ArrVal_1019)))) (select .cse80 (select (select .cse80 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse79 v_arrayElimCell_72) 0) (= (select .cse79 0) 0)))) (= .cse81 |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)) (let ((.cse82 (+ 8 v_arrayElimIndex_15))) (or (= .cse82 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse83 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse82 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| .cse83) (= .cse2 .cse83))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or .cse11 (and (or .cse6 (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 ((.cse84 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse84 (select (select .cse84 |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|)))) .cse50 (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)) (let ((.cse85 (let ((.cse86 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse86 (select (select .cse86 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse85 v_arrayElimCell_72) 0) (forall ((v_ArrVal_1017 Int)) (= (select .cse85 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|)))))) .cse60 (or .cse6 (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 ((.cse87 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse87 (select (select .cse87 |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) .cse88 .cse89)) (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 ((.cse90 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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| .cse90) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 .cse90)))) (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 ((.cse91 (let ((.cse92 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse92 (select (select .cse92 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse91 0) 0) (= (select .cse91 v_arrayElimCell_71) 0) (= (select .cse91 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 ((.cse93 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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| .cse93) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= .cse2 .cse93)))) (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 ((.cse94 (+ 8 v_arrayElimIndex_15))) (let ((.cse95 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse94 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|)) (= .cse94 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse95) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 .cse95) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) (or .cse6 (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 ((.cse96 (let ((.cse97 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_72 0) (+ 8 v_arrayElimCell_72) v_ArrVal_1019)))) (select .cse97 (select (select .cse97 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse96 0) 0) (= (select .cse96 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 ((.cse98 (let ((.cse99 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse99 (select (select .cse99 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse98 v_arrayElimCell_72) 0) (= (select .cse98 0) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse88 (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 ((.cse100 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse100 (select (select .cse100 |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 ((.cse101 (let ((.cse102 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse102 (select (select .cse102 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse101 v_arrayElimCell_72) 0) (= (select .cse101 0) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse89)) (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)) (let ((.cse103 (+ 8 v_arrayElimIndex_15))) (or (= .cse103 |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 ((.cse104 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse103 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| .cse104) (= .cse2 .cse104)))) (= |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|)))) .cse61 (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 ((.cse105 (let ((.cse106 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse106 (select (select .cse106 |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 .cse105 v_arrayElimCell_72) 0) (= (select .cse105 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 ((.cse107 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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| .cse107) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 .cse107)))) (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)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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 ((.cse108 (let ((.cse109 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019)))) (select .cse109 (select (select .cse109 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse108 v_ArrVal_1017) 0) (= (select .cse108 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)) (let ((.cse110 (let ((.cse111 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019)))) (select .cse111 (select (select .cse111 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (forall ((v_ArrVal_1017 Int)) (= (select .cse110 v_ArrVal_1017) 0)) (= (select .cse110 0) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse8) (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 ((.cse112 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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) (= .cse2 .cse112)))))) (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)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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 ((.cse113 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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| .cse113) (= v_arrayElimIndex_15 0) (= .cse2 .cse113)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse69 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimIndex_15 Int)) (let ((.cse114 (+ 8 v_arrayElimIndex_15))) (or (= .cse114 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse115 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse114 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| .cse115) (= .cse2 .cse115)))) (= |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 ((.cse116 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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| .cse116) (= .cse2 .cse116)))) (= 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 [2023-02-14 02:10:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:10:28,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374967133] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:10:28,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:10:28,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 41 [2023-02-14 02:10:28,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124120007] [2023-02-14 02:10:28,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:10:28,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-14 02:10:28,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:10:28,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-14 02:10:28,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1431, Unknown=6, NotChecked=76, Total=1640 [2023-02-14 02:10:28,340 INFO L87 Difference]: Start difference. First operand 273 states and 315 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) [2023-02-14 02:10:30,899 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse6 (= .cse2 |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse8 (not .cse6)) (.cse3 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse27 (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 ((.cse127 (+ 8 v_arrayElimIndex_15))) (or (= .cse127 |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) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse127 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|))))) (.cse49 (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 ((.cse126 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) 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|))) 0) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse8)) (.cse7 (< |c_ULTIMATE.start_main_~head~0#1.offset| 0)) (.cse50 (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)) (let ((.cse124 (+ 8 v_arrayElimCell_71))) (or (= .cse124 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse125 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse124 v_ArrVal_1019)))) (select .cse125 (select (select .cse125 |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|))))) (.cse60 (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 ((.cse122 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)))) (let ((.cse121 (let ((.cse123 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 .cse122 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse123 (select (select .cse123 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse121 .cse122) 0) (= (select .cse121 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)) (.cse88 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse120 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_72 0) (+ 8 v_arrayElimCell_72) v_ArrVal_1019)))) (select .cse120 (select (select .cse120 |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|))))) (.cse89 (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 ((.cse119 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse119 (select (select .cse119 |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|))))) (.cse61 (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 ((.cse117 (let ((.cse118 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| 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_ArrVal_1017) 0) (= (select .cse117 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|)) (.cse69 (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) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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)) (let ((.cse0 (+ 8 v_arrayElimCell_71))) (or (= .cse0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse0 v_ArrVal_1019)))) (select .cse1 (select (select .cse1 |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 ((.cse4 (+ 8 v_arrayElimCell_71))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= .cse4 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= (select (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse4 v_ArrVal_1019)))) (select .cse5 (select (select .cse5 |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|))))) .cse6) (or .cse7 (< |c_ULTIMATE.start_main_~x~0#1.offset| 1)) (or .cse8 (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 ((.cse9 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019)))) (select .cse9 (select (select .cse9 |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) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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 ((.cse14 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse14 (select (select .cse14 |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|))) .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_arrayElimCell_71 Int)) (let ((.cse15 (+ 8 v_arrayElimCell_71))) (or (= .cse15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (= (select (let ((.cse16 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse15 v_ArrVal_1019)))) (select .cse16 (select (select .cse16 |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)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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|)))) (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)) (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse17 v_arrayElimCell_72) 0) (forall ((v_ArrVal_1017 Int)) (= (select .cse17 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) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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)) (let ((.cse19 (+ 8 v_arrayElimIndex_15))) (or (= .cse19 |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)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse19 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 ((.cse20 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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| .cse20) (= .cse2 .cse20)))) (= |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|)))) (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 ((.cse22 (+ 8 v_arrayElimIndex_15))) (let ((.cse21 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse22 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| .cse21) (= .cse22 |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) (= .cse2 .cse21))))) (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)) (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse23 v_arrayElimCell_71) 0) (forall ((v_ArrVal_1017 Int)) (= (select .cse23 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 ((.cse26 (+ 8 v_arrayElimIndex_15))) (let ((.cse25 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse26 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| .cse25) (= .cse26 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 .cse25) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) .cse27 (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)) (let ((.cse28 (+ 8 v_arrayElimCell_71))) (or (= .cse28 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse29 (let ((.cse30 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse28 v_ArrVal_1019)))) (select .cse30 (select (select .cse30 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse29 0) 0) (= (select .cse29 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 ((.cse31 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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| .cse31) (= .cse2 .cse31)))) (= |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 ((.cse32 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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| .cse32) (= .cse2 .cse32)))) (= 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 ((.cse33 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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| .cse33) (= .cse2 .cse33)))) (= 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 ((.cse34 (let ((.cse35 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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|))))) (or (= (select .cse34 v_arrayElimCell_71) 0) (= (select .cse34 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 ((.cse36 (let ((.cse37 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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|))))) (or (= (select .cse36 v_arrayElimCell_72) 0) (= (select .cse36 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)) (let ((.cse39 (+ 8 v_arrayElimIndex_15))) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse38 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse39 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| .cse38) (= .cse2 .cse38)))) (= .cse39 |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 ((.cse40 (+ 8 v_arrayElimIndex_15))) (let ((.cse41 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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|)) (= .cse40 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse41) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 .cse41) (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)) (let ((.cse43 (+ 8 v_arrayElimIndex_15))) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse42 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse43 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| .cse42) (= .cse2 .cse42)))) (= .cse43 |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)) (let ((.cse46 (+ 8 v_arrayElimCell_71))) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (let ((.cse44 (let ((.cse45 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse46 v_ArrVal_1019)))) (select .cse45 (select (select .cse45 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse44 v_arrayElimCell_72) 0) (= (select .cse44 0) 0)))) (= .cse46 |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 ((.cse48 (+ 8 v_arrayElimCell_71))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse47 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse48 v_ArrVal_1019)))) (select .cse47 (select (select .cse47 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (= .cse48 |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|))))) .cse6) .cse49 .cse50) .cse11) .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)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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 .cse7 (< |c_ULTIMATE.start_main_~head~0#1.offset| (+ |c_ULTIMATE.start_main_~x~0#1.offset| 1))) (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) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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)) (let ((.cse51 (+ 8 v_arrayElimIndex_15))) (or (= .cse51 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse52 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse51 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| .cse52) (= .cse2 .cse52))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or .cse8 (let ((.cse56 (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 ((.cse66 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| 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|))) 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 ((.cse54 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)))) (let ((.cse53 (let ((.cse55 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 .cse54 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse55 (select (select .cse55 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse53 0) 0) (= (select .cse53 .cse54) 0) (= (select .cse53 v_ArrVal_1017) 0))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse56 (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 ((.cse57 (let ((.cse58 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse58 (select (select .cse58 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse57 0) 0) (= (select .cse57 v_ArrVal_1017) 0) (= (select .cse57 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 ((.cse59 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse59 (select (select .cse59 |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|)))) .cse60 .cse61 (or (and .cse56 (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 ((.cse62 (let ((.cse63 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse63 (select (select .cse63 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse62 0) 0) (= (select .cse62 v_ArrVal_1017) 0) (= (select .cse62 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 ((.cse64 (let ((.cse65 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse65 (select (select .cse65 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse64 v_ArrVal_1017) 0) (= (select .cse64 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 ((.cse67 (let ((.cse68 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) 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|))))) (or (= (select .cse67 v_arrayElimCell_72) 0) (= (select .cse67 0) 0) (= (select .cse67 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 .cse27 .cse69)) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (or .cse7 .cse11) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse71 (+ 8 v_arrayElimIndex_15))) (let ((.cse70 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse71 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| .cse70) (= .cse71 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0) (= .cse2 .cse70) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) .cse49 (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 ((.cse72 (let ((.cse73 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse73 (select (select .cse73 |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 .cse72 v_ArrVal_1017) 0) (= (select .cse72 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)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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 (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |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|))) (= (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) |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) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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 (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 ((.cse74 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse74 (select (select .cse74 |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|))) .cse6) (or .cse7 .cse8) (or (= |c_ULTIMATE.start_main_~marked~0#1| 0) (and (not .cse11) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0) (= .cse2 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |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 ((.cse75 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse75) (= .cse2 .cse75)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse8 (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 ((.cse76 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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| .cse76) (= .cse2 .cse76)))) (= |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 ((.cse78 (+ 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 ((.cse77 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse78 v_ArrVal_1019)))) (select .cse77 (select (select .cse77 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (= .cse78 |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|))))) .cse6) (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)) (let ((.cse81 (+ 8 v_arrayElimCell_71))) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (let ((.cse79 (let ((.cse80 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse81 v_ArrVal_1019)))) (select .cse80 (select (select .cse80 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse79 v_arrayElimCell_72) 0) (= (select .cse79 0) 0)))) (= .cse81 |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)) (let ((.cse82 (+ 8 v_arrayElimIndex_15))) (or (= .cse82 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse83 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse82 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| .cse83) (= .cse2 .cse83))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or .cse11 (and (or .cse6 (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 ((.cse84 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse84 (select (select .cse84 |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|)))) .cse50 (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)) (let ((.cse85 (let ((.cse86 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse86 (select (select .cse86 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse85 v_arrayElimCell_72) 0) (forall ((v_ArrVal_1017 Int)) (= (select .cse85 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|)))))) .cse60 (or .cse6 (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 ((.cse87 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse87 (select (select .cse87 |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) .cse88 .cse89)) (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 ((.cse90 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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| .cse90) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 .cse90)))) (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 ((.cse91 (let ((.cse92 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse92 (select (select .cse92 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse91 0) 0) (= (select .cse91 v_arrayElimCell_71) 0) (= (select .cse91 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 ((.cse93 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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| .cse93) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= .cse2 .cse93)))) (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 ((.cse94 (+ 8 v_arrayElimIndex_15))) (let ((.cse95 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse94 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|)) (= .cse94 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse95) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 .cse95) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) (or .cse6 (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 ((.cse96 (let ((.cse97 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_72 0) (+ 8 v_arrayElimCell_72) v_ArrVal_1019)))) (select .cse97 (select (select .cse97 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse96 0) 0) (= (select .cse96 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 ((.cse98 (let ((.cse99 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse99 (select (select .cse99 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse98 v_arrayElimCell_72) 0) (= (select .cse98 0) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse88 (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 ((.cse100 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse100 (select (select .cse100 |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 ((.cse101 (let ((.cse102 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse102 (select (select .cse102 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse101 v_arrayElimCell_72) 0) (= (select .cse101 0) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse89)) (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)) (let ((.cse103 (+ 8 v_arrayElimIndex_15))) (or (= .cse103 |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 ((.cse104 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse103 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| .cse104) (= .cse2 .cse104)))) (= |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|)))) .cse61 (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 ((.cse105 (let ((.cse106 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse106 (select (select .cse106 |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 .cse105 v_arrayElimCell_72) 0) (= (select .cse105 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 ((.cse107 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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| .cse107) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 .cse107)))) (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)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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 ((.cse108 (let ((.cse109 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019)))) (select .cse109 (select (select .cse109 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse108 v_ArrVal_1017) 0) (= (select .cse108 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)) (let ((.cse110 (let ((.cse111 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019)))) (select .cse111 (select (select .cse111 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (forall ((v_ArrVal_1017 Int)) (= (select .cse110 v_ArrVal_1017) 0)) (= (select .cse110 0) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse8) (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 ((.cse112 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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) (= .cse2 .cse112)))))) (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)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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 ((.cse113 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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| .cse113) (= v_arrayElimIndex_15 0) (= .cse2 .cse113)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse69 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimIndex_15 Int)) (let ((.cse114 (+ 8 v_arrayElimIndex_15))) (or (= .cse114 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse115 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse114 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| .cse115) (= .cse2 .cse115)))) (= |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 ((.cse116 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 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| .cse116) (= .cse2 .cse116)))) (= 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 [2023-02-14 02:10:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:10:38,128 INFO L93 Difference]: Finished difference Result 473 states and 533 transitions. [2023-02-14 02:10:38,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-14 02:10:38,128 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 [2023-02-14 02:10:38,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:10:38,141 INFO L225 Difference]: With dead ends: 473 [2023-02-14 02:10:38,141 INFO L226 Difference]: Without dead ends: 473 [2023-02-14 02:10:38,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=406, Invalid=2901, Unknown=7, NotChecked=226, Total=3540 [2023-02-14 02:10:38,143 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 918 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 2003 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 2290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 207 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-02-14 02:10:38,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1745 Invalid, 2290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2003 Invalid, 0 Unknown, 207 Unchecked, 3.2s Time] [2023-02-14 02:10:38,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2023-02-14 02:10:38,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 276. [2023-02-14 02:10:38,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 248 states have (on average 1.282258064516129) internal successors, (318), 275 states have internal predecessors, (318), 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) [2023-02-14 02:10:38,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 318 transitions. [2023-02-14 02:10:38,147 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 318 transitions. Word has length 40 [2023-02-14 02:10:38,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:10:38,147 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 318 transitions. [2023-02-14 02:10:38,147 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) [2023-02-14 02:10:38,147 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 318 transitions. [2023-02-14 02:10:38,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-14 02:10:38,148 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:10:38,148 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] [2023-02-14 02:10:38,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-14 02:10:38,353 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 [2023-02-14 02:10:38,354 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)] === [2023-02-14 02:10:38,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:10:38,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1306466284, now seen corresponding path program 1 times [2023-02-14 02:10:38,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:10:38,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634942608] [2023-02-14 02:10:38,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:10:38,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:10:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:10:38,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:10:38,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:10:38,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634942608] [2023-02-14 02:10:38,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634942608] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:10:38,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883654299] [2023-02-14 02:10:38,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:10:38,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:10:38,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:10:38,735 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:10:38,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-14 02:10:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:10:38,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-14 02:10:38,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:10:39,174 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:10:39,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 02:10:39,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 02:10:39,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 02:10:39,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 02:10:39,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 02:10:39,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 02:10:39,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 02:10:39,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 02:10:39,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 02:10:39,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:10:39,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:10:39,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2023-02-14 02:10:39,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-14 02:10:39,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-02-14 02:10:40,060 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 02:10:40,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-02-14 02:10:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:10:40,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883654299] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:10:40,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:10:40,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 34 [2023-02-14 02:10:40,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411858899] [2023-02-14 02:10:40,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:10:40,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-14 02:10:40,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:10:40,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-14 02:10:40,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=972, Unknown=14, NotChecked=0, Total=1122 [2023-02-14 02:10:40,070 INFO L87 Difference]: Start difference. First operand 276 states and 318 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) [2023-02-14 02:10:44,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:10:44,371 INFO L93 Difference]: Finished difference Result 434 states and 487 transitions. [2023-02-14 02:10:44,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-02-14 02:10:44,372 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 [2023-02-14 02:10:44,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:10:44,373 INFO L225 Difference]: With dead ends: 434 [2023-02-14 02:10:44,373 INFO L226 Difference]: Without dead ends: 434 [2023-02-14 02:10:44,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2370 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1479, Invalid=7627, Unknown=14, NotChecked=0, Total=9120 [2023-02-14 02:10:44,375 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 1073 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1826 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 1979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-14 02:10:44,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 1053 Invalid, 1979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1826 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-02-14 02:10:44,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2023-02-14 02:10:44,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 286. [2023-02-14 02:10:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 259 states have (on average 1.2625482625482625) internal successors, (327), 285 states have internal predecessors, (327), 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) [2023-02-14 02:10:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 327 transitions. [2023-02-14 02:10:44,386 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 327 transitions. Word has length 42 [2023-02-14 02:10:44,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:10:44,386 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 327 transitions. [2023-02-14 02:10:44,387 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) [2023-02-14 02:10:44,387 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 327 transitions. [2023-02-14 02:10:44,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-14 02:10:44,387 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:10:44,387 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] [2023-02-14 02:10:44,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-14 02:10:44,592 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 [2023-02-14 02:10:44,592 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)] === [2023-02-14 02:10:44,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:10:44,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1830693833, now seen corresponding path program 1 times [2023-02-14 02:10:44,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:10:44,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94896720] [2023-02-14 02:10:44,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:10:44,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:10:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:10:45,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:10:45,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:10:45,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94896720] [2023-02-14 02:10:45,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94896720] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:10:45,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160818634] [2023-02-14 02:10:45,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:10:45,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:10:45,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:10:45,473 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:10:45,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-14 02:10:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:10:45,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-14 02:10:45,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:10:45,760 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-14 02:10:45,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-02-14 02:10:45,794 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 02:10:45,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2023-02-14 02:10:45,964 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2023-02-14 02:10:45,965 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 02:10:45,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:10:45,980 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-14 02:10:45,980 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 02:10:45,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-02-14 02:10:46,769 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:10:46,788 INFO L321 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2023-02-14 02:10:46,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 60 [2023-02-14 02:10:46,793 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:10:46,805 INFO L321 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2023-02-14 02:10:46,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 43 [2023-02-14 02:10:46,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-14 02:10:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:10:46,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:10:47,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 77 [2023-02-14 02:10:47,490 INFO L350 Elim1Store]: Elim1 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 111 treesize of output 77 [2023-02-14 02:10:53,597 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:10:53,598 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 02:10:53,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:10:53,670 INFO L350 Elim1Store]: Elim1 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 866 treesize of output 671 [2023-02-14 02:11:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:11:42,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160818634] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:11:42,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:11:42,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 40 [2023-02-14 02:11:42,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279756030] [2023-02-14 02:11:42,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:11:42,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-02-14 02:11:42,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:11:42,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-02-14 02:11:42,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1397, Unknown=0, NotChecked=0, Total=1560 [2023-02-14 02:11:42,371 INFO L87 Difference]: Start difference. First operand 286 states and 327 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) [2023-02-14 02:11:50,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:11:50,013 INFO L93 Difference]: Finished difference Result 429 states and 482 transitions. [2023-02-14 02:11:50,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-02-14 02:11:50,014 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 [2023-02-14 02:11:50,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:11:50,015 INFO L225 Difference]: With dead ends: 429 [2023-02-14 02:11:50,015 INFO L226 Difference]: Without dead ends: 429 [2023-02-14 02:11:50,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=776, Invalid=4774, Unknown=0, NotChecked=0, Total=5550 [2023-02-14 02:11:50,016 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 1702 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 2233 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 1718 SdHoareTripleChecker+Invalid, 2347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-02-14 02:11:50,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1702 Valid, 1718 Invalid, 2347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 2233 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-02-14 02:11:50,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2023-02-14 02:11:50,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 294. [2023-02-14 02:11:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 267 states have (on average 1.2621722846441947) internal successors, (337), 293 states have internal predecessors, (337), 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) [2023-02-14 02:11:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 337 transitions. [2023-02-14 02:11:50,020 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 337 transitions. Word has length 42 [2023-02-14 02:11:50,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:11:50,020 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 337 transitions. [2023-02-14 02:11:50,020 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) [2023-02-14 02:11:50,020 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 337 transitions. [2023-02-14 02:11:50,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 02:11:50,025 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:11:50,025 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] [2023-02-14 02:11:50,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-14 02:11:50,234 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 [2023-02-14 02:11:50,234 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)] === [2023-02-14 02:11:50,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:11:50,234 INFO L85 PathProgramCache]: Analyzing trace with hash 916938157, now seen corresponding path program 1 times [2023-02-14 02:11:50,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:11:50,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435951353] [2023-02-14 02:11:50,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:11:50,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:11:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:11:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:11:50,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:11:50,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435951353] [2023-02-14 02:11:50,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435951353] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:11:50,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767537953] [2023-02-14 02:11:50,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:11:50,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:11:50,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:11:50,742 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:11:50,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-14 02:11:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:11:50,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-14 02:11:50,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:11:51,037 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 02:11:51,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2023-02-14 02:11:51,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:11:51,115 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 02:11:51,115 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 02:11:51,543 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:11:51,570 INFO L321 Elim1Store]: treesize reduction 12, result has 57.1 percent of original size [2023-02-14 02:11:51,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 25 [2023-02-14 02:11:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:11:51,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:11:51,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-02-14 02:11:52,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:11:52,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 170 [2023-02-14 02:11:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:11:52,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767537953] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:11:52,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:11:52,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 32 [2023-02-14 02:11:52,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209265736] [2023-02-14 02:11:52,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:11:52,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-14 02:11:52,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:11:52,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-14 02:11:52,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2023-02-14 02:11:52,397 INFO L87 Difference]: Start difference. First operand 294 states and 337 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) [2023-02-14 02:11:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:11:56,201 INFO L93 Difference]: Finished difference Result 514 states and 578 transitions. [2023-02-14 02:11:56,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-02-14 02:11:56,202 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 [2023-02-14 02:11:56,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:11:56,203 INFO L225 Difference]: With dead ends: 514 [2023-02-14 02:11:56,203 INFO L226 Difference]: Without dead ends: 514 [2023-02-14 02:11:56,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1657 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1365, Invalid=4955, Unknown=0, NotChecked=0, Total=6320 [2023-02-14 02:11:56,204 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 2123 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2123 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-14 02:11:56,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2123 Valid, 1256 Invalid, 1724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-14 02:11:56,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2023-02-14 02:11:56,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 304. [2023-02-14 02:11:56,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 277 states have (on average 1.263537906137184) internal successors, (350), 303 states have internal predecessors, (350), 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) [2023-02-14 02:11:56,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 350 transitions. [2023-02-14 02:11:56,209 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 350 transitions. Word has length 43 [2023-02-14 02:11:56,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:11:56,209 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 350 transitions. [2023-02-14 02:11:56,209 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) [2023-02-14 02:11:56,209 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 350 transitions. [2023-02-14 02:11:56,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 02:11:56,209 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:11:56,210 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] [2023-02-14 02:11:56,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-14 02:11:56,419 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 [2023-02-14 02:11:56,420 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)] === [2023-02-14 02:11:56,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:11:56,420 INFO L85 PathProgramCache]: Analyzing trace with hash -377567726, now seen corresponding path program 1 times [2023-02-14 02:11:56,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:11:56,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423797788] [2023-02-14 02:11:56,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:11:56,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:11:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:11:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:11:57,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:11:57,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423797788] [2023-02-14 02:11:57,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423797788] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:11:57,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841012654] [2023-02-14 02:11:57,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:11:57,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:11:57,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:11:57,058 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:11:57,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-14 02:11:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:11:57,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-14 02:11:57,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:11:57,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:11:57,278 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 02:11:57,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-14 02:11:57,319 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 02:11:57,431 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:11:57,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-14 02:11:57,549 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:11:57,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-14 02:11:57,600 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:11:57,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-14 02:11:57,898 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-02-14 02:11:57,898 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 02:11:57,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-02-14 02:11:57,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-02-14 02:11:58,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-02-14 02:11:58,046 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:11:58,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-14 02:11:58,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:11:58,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:11:58,100 WARN L837 $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 [2023-02-14 02:11:59,003 WARN L837 $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 [2023-02-14 02:11:59,030 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:11:59,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 37 [2023-02-14 02:11:59,049 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:11:59,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1750 treesize of output 1629 [2023-02-14 02:11:59,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:11:59,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1614 treesize of output 1558 [2023-02-14 02:11:59,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1550 treesize of output 1518 [2023-02-14 02:11:59,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1518 treesize of output 1454 [2023-02-14 02:12:21,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:12:21,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841012654] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:12:21,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:12:21,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 15] total 41 [2023-02-14 02:12:21,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394828979] [2023-02-14 02:12:21,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:12:21,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-02-14 02:12:21,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:12:21,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-02-14 02:12:21,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1352, Unknown=18, NotChecked=154, Total=1722 [2023-02-14 02:12:21,323 INFO L87 Difference]: Start difference. First operand 304 states and 350 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) [2023-02-14 02:12:26,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:12:26,827 INFO L93 Difference]: Finished difference Result 483 states and 542 transitions. [2023-02-14 02:12:26,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-14 02:12:26,827 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 [2023-02-14 02:12:26,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:12:26,828 INFO L225 Difference]: With dead ends: 483 [2023-02-14 02:12:26,828 INFO L226 Difference]: Without dead ends: 483 [2023-02-14 02:12:26,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=561, Invalid=2969, Unknown=18, NotChecked=234, Total=3782 [2023-02-14 02:12:26,830 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1239 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 1939 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1239 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 2577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 485 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-14 02:12:26,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1239 Valid, 1437 Invalid, 2577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1939 Invalid, 0 Unknown, 485 Unchecked, 1.9s Time] [2023-02-14 02:12:26,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2023-02-14 02:12:26,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 313. [2023-02-14 02:12:26,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 286 states have (on average 1.2622377622377623) internal successors, (361), 312 states have internal predecessors, (361), 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) [2023-02-14 02:12:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 361 transitions. [2023-02-14 02:12:26,835 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 361 transitions. Word has length 45 [2023-02-14 02:12:26,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:12:26,835 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 361 transitions. [2023-02-14 02:12:26,835 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) [2023-02-14 02:12:26,835 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 361 transitions. [2023-02-14 02:12:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 02:12:26,836 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:12:26,836 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] [2023-02-14 02:12:26,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-14 02:12:27,045 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 [2023-02-14 02:12:27,045 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)] === [2023-02-14 02:12:27,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:12:27,045 INFO L85 PathProgramCache]: Analyzing trace with hash -377567725, now seen corresponding path program 1 times [2023-02-14 02:12:27,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:12:27,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635844787] [2023-02-14 02:12:27,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:12:27,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:12:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:12:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:12:28,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:12:28,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635844787] [2023-02-14 02:12:28,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635844787] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:12:28,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111136967] [2023-02-14 02:12:28,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:12:28,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:12:28,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:12:28,019 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:12:28,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-14 02:12:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:12:28,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-14 02:12:28,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:12:28,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:12:28,269 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 02:12:28,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-14 02:12:28,282 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 02:12:28,341 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 02:12:28,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 02:12:28,527 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:12:28,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2023-02-14 02:12:28,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 02:12:28,719 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:12:28,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2023-02-14 02:12:28,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:12:28,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 02:12:28,824 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:12:28,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2023-02-14 02:12:28,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 02:12:29,291 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-14 02:12:29,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2023-02-14 02:12:29,320 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-14 02:12:29,321 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 02:12:29,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-02-14 02:12:29,399 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 02:12:29,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-14 02:12:29,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-02-14 02:12:29,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-02-14 02:12:29,455 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 02:12:29,564 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:12:29,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-14 02:12:29,574 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:12:29,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 02:12:29,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:12:29,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:12:29,716 WARN L837 $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 [2023-02-14 02:12:41,567 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:12:41,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2023-02-14 02:12:41,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:12:41,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2023-02-14 02:12:41,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2023-02-14 02:12:41,595 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:12:41,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 356 treesize of output 351 [2023-02-14 02:12:41,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 336 treesize of output 316 [2023-02-14 02:12:41,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 254 [2023-02-14 02:12:41,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 312 treesize of output 302 [2023-02-14 02:12:41,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 234 [2023-02-14 02:12:41,931 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:12:41,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 83 [2023-02-14 02:12:41,941 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:12:41,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 59 [2023-02-14 02:12:41,944 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:12:41,963 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:12:41,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 382 treesize of output 349 [2023-02-14 02:12:41,981 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:12:41,998 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:12:41,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1070 treesize of output 1029 [2023-02-14 02:12:42,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1014 treesize of output 974 [2023-02-14 02:12:42,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 974 treesize of output 958 [2023-02-14 02:12:42,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 958 treesize of output 918 [2023-02-14 02:12:42,052 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:12:42,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 918 treesize of output 850 [2023-02-14 02:12:45,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 189 [2023-02-14 02:12:50,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:12:50,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111136967] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:12:50,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:12:50,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 42 [2023-02-14 02:12:50,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551000125] [2023-02-14 02:12:50,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:12:50,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-02-14 02:12:50,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:12:50,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-14 02:12:50,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1525, Unknown=19, NotChecked=80, Total=1806 [2023-02-14 02:12:50,425 INFO L87 Difference]: Start difference. First operand 313 states and 361 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) [2023-02-14 02:12:57,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:12:57,318 INFO L93 Difference]: Finished difference Result 509 states and 576 transitions. [2023-02-14 02:12:57,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-14 02:12:57,318 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 [2023-02-14 02:12:57,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:12:57,319 INFO L225 Difference]: With dead ends: 509 [2023-02-14 02:12:57,320 INFO L226 Difference]: Without dead ends: 509 [2023-02-14 02:12:57,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=602, Invalid=3286, Unknown=22, NotChecked=122, Total=4032 [2023-02-14 02:12:57,320 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 1471 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 2098 mSolverCounterSat, 136 mSolverCounterUnsat, 53 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 2484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 2098 IncrementalHoareTripleChecker+Invalid, 53 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-02-14 02:12:57,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1471 Valid, 1573 Invalid, 2484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 2098 Invalid, 53 Unknown, 197 Unchecked, 3.7s Time] [2023-02-14 02:12:57,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2023-02-14 02:12:57,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 313. [2023-02-14 02:12:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 286 states have (on average 1.2587412587412588) internal successors, (360), 312 states have internal predecessors, (360), 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) [2023-02-14 02:12:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 360 transitions. [2023-02-14 02:12:57,324 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 360 transitions. Word has length 45 [2023-02-14 02:12:57,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:12:57,324 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 360 transitions. [2023-02-14 02:12:57,324 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) [2023-02-14 02:12:57,325 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 360 transitions. [2023-02-14 02:12:57,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 02:12:57,325 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:12:57,325 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] [2023-02-14 02:12:57,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-02-14 02:12:57,533 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 [2023-02-14 02:12:57,535 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)] === [2023-02-14 02:12:57,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:12:57,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1349607265, now seen corresponding path program 2 times [2023-02-14 02:12:57,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:12:57,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461326249] [2023-02-14 02:12:57,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:12:57,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:12:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:12:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:12:58,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:12:58,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461326249] [2023-02-14 02:12:58,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461326249] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:12:58,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105292677] [2023-02-14 02:12:58,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 02:12:58,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:12:58,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:12:58,342 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 02:12:58,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-14 02:12:58,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 02:12:58,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 02:12:58,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 54 conjunts are in the unsatisfiable core [2023-02-14 02:12:58,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:12:58,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-14 02:12:58,609 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:12:58,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-14 02:12:58,657 INFO L350 Elim1Store]: Elim1 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 [2023-02-14 02:12:58,808 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:12:58,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-02-14 02:12:58,946 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:12:58,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2023-02-14 02:12:59,054 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:12:59,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2023-02-14 02:12:59,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:12:59,120 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-14 02:12:59,120 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2023-02-14 02:12:59,188 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-14 02:12:59,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2023-02-14 02:12:59,358 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-02-14 02:12:59,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 38 [2023-02-14 02:12:59,547 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-14 02:12:59,548 INFO L350 Elim1Store]: Elim1 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 63 treesize of output 53 [2023-02-14 02:12:59,643 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-14 02:12:59,644 INFO L350 Elim1Store]: Elim1 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 60 treesize of output 53 [2023-02-14 02:12:59,973 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 02:12:59,981 INFO L321 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2023-02-14 02:12:59,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 27 [2023-02-14 02:12:59,985 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:12:59,985 INFO L328 TraceCheckSpWp]: Computing backward predicates...