./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-sorted-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-sorted-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e45b14428dafe2f20aeac8c38d2592befc15b6791b0365935474ded4fd47d0f2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:08:09,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:08:09,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:08:09,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:08:09,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:08:09,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:08:09,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:08:09,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:08:09,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:08:09,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:08:09,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:08:09,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:08:09,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:08:09,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:08:09,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:08:09,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:08:09,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:08:09,179 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:08:09,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:08:09,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:08:09,186 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:08:09,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:08:09,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:08:09,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:08:09,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:08:09,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:08:09,197 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:08:09,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:08:09,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:08:09,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:08:09,200 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:08:09,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:08:09,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:08:09,202 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:08:09,203 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:08:09,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:08:09,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:08:09,204 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:08:09,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:08:09,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:08:09,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:08:09,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:08:09,209 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-07-12 18:08:09,235 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:08:09,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:08:09,236 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:08:09,237 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:08:09,237 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:08:09,237 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:08:09,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:08:09,238 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:08:09,238 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:08:09,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:08:09,239 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:08:09,239 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:08:09,239 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:08:09,240 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:08:09,240 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:08:09,240 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:08:09,240 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:08:09,240 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:08:09,240 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:08:09,241 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:08:09,241 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:08:09,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:08:09,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:08:09,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:08:09,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:08:09,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:08:09,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:08:09,242 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:08:09,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:08:09,242 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) 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 -> e45b14428dafe2f20aeac8c38d2592befc15b6791b0365935474ded4fd47d0f2 [2022-07-12 18:08:09,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:08:09,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:08:09,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:08:09,484 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:08:09,485 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:08:09,486 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-sorted-1.i [2022-07-12 18:08:09,550 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f139b91/23d4b943e01d4a98affd298c8dc127fc/FLAG859e6c010 [2022-07-12 18:08:10,071 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:08:10,072 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-1.i [2022-07-12 18:08:10,087 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f139b91/23d4b943e01d4a98affd298c8dc127fc/FLAG859e6c010 [2022-07-12 18:08:10,534 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f139b91/23d4b943e01d4a98affd298c8dc127fc [2022-07-12 18:08:10,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:08:10,538 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:08:10,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:08:10,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:08:10,544 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:08:10,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:08:10" (1/1) ... [2022-07-12 18:08:10,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec55073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:10, skipping insertion in model container [2022-07-12 18:08:10,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:08:10" (1/1) ... [2022-07-12 18:08:10,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:08:10,598 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:08:10,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-1.i[22317,22330] [2022-07-12 18:08:10,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-1.i[22547,22560] [2022-07-12 18:08:10,900 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-1.i[22877,22890] [2022-07-12 18:08:10,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-1.i[22941,22954] [2022-07-12 18:08:10,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-1.i[23072,23085] [2022-07-12 18:08:10,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-1.i[23136,23149] [2022-07-12 18:08:10,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:08:10,920 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:08:10,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-1.i[22317,22330] [2022-07-12 18:08:10,961 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-1.i[22547,22560] [2022-07-12 18:08:10,965 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-1.i[22877,22890] [2022-07-12 18:08:10,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-1.i[22941,22954] [2022-07-12 18:08:10,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-1.i[23072,23085] [2022-07-12 18:08:10,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-1.i[23136,23149] [2022-07-12 18:08:10,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:08:10,996 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:08:10,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:10 WrapperNode [2022-07-12 18:08:10,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:08:10,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:08:10,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:08:10,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:08:11,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:10" (1/1) ... [2022-07-12 18:08:11,029 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:10" (1/1) ... [2022-07-12 18:08:11,062 INFO L137 Inliner]: procedures = 119, calls = 39, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 189 [2022-07-12 18:08:11,063 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:08:11,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:08:11,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:08:11,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:08:11,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:10" (1/1) ... [2022-07-12 18:08:11,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:10" (1/1) ... [2022-07-12 18:08:11,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:10" (1/1) ... [2022-07-12 18:08:11,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:10" (1/1) ... [2022-07-12 18:08:11,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:10" (1/1) ... [2022-07-12 18:08:11,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:10" (1/1) ... [2022-07-12 18:08:11,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:10" (1/1) ... [2022-07-12 18:08:11,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:08:11,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:08:11,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:08:11,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:08:11,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:10" (1/1) ... [2022-07-12 18:08:11,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:08:11,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:08:11,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 18:08:11,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 18:08:11,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 18:08:11,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 18:08:11,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:08:11,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:08:11,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:08:11,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:08:11,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:08:11,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 18:08:11,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:08:11,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:08:11,331 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:08:11,333 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:08:11,701 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:08:11,707 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:08:11,707 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-07-12 18:08:11,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:08:11 BoogieIcfgContainer [2022-07-12 18:08:11,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:08:11,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:08:11,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:08:11,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:08:11,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:08:10" (1/3) ... [2022-07-12 18:08:11,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5e13e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:08:11, skipping insertion in model container [2022-07-12 18:08:11,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:10" (2/3) ... [2022-07-12 18:08:11,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5e13e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:08:11, skipping insertion in model container [2022-07-12 18:08:11,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:08:11" (3/3) ... [2022-07-12 18:08:11,720 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-sorted-1.i [2022-07-12 18:08:11,731 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:08:11,732 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 68 error locations. [2022-07-12 18:08:11,769 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:08:11,777 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6547b0d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@646dda98 [2022-07-12 18:08:11,777 INFO L358 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2022-07-12 18:08:11,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 90 states have (on average 2.1555555555555554) internal successors, (194), 158 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:11,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 18:08:11,801 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:11,801 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 18:08:11,807 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-07-12 18:08:11,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:11,811 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-12 18:08:11,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:11,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169733575] [2022-07-12 18:08:11,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:11,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:11,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:11,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:11,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169733575] [2022-07-12 18:08:11,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169733575] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:11,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:11,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:08:11,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012257260] [2022-07-12 18:08:11,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:11,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:08:11,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:11,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:08:11,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:11,994 INFO L87 Difference]: Start difference. First operand has 159 states, 90 states have (on average 2.1555555555555554) internal successors, (194), 158 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:12,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:12,119 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2022-07-12 18:08:12,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:08:12,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-12 18:08:12,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:12,128 INFO L225 Difference]: With dead ends: 163 [2022-07-12 18:08:12,128 INFO L226 Difference]: Without dead ends: 159 [2022-07-12 18:08:12,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:12,132 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:12,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 111 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:08:12,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-12 18:08:12,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2022-07-12 18:08:12,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 89 states have (on average 1.8651685393258426) internal successors, (166), 154 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 166 transitions. [2022-07-12 18:08:12,166 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 166 transitions. Word has length 3 [2022-07-12 18:08:12,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:12,166 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 166 transitions. [2022-07-12 18:08:12,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:12,167 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2022-07-12 18:08:12,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 18:08:12,167 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:12,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 18:08:12,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 18:08:12,168 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-07-12 18:08:12,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:12,169 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-12 18:08:12,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:12,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956918223] [2022-07-12 18:08:12,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:12,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:12,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:12,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:12,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956918223] [2022-07-12 18:08:12,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956918223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:12,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:12,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:08:12,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467333876] [2022-07-12 18:08:12,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:12,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:08:12,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:12,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:08:12,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:12,225 INFO L87 Difference]: Start difference. First operand 155 states and 166 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:12,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:12,324 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-07-12 18:08:12,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:08:12,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-12 18:08:12,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:12,326 INFO L225 Difference]: With dead ends: 157 [2022-07-12 18:08:12,327 INFO L226 Difference]: Without dead ends: 157 [2022-07-12 18:08:12,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:12,328 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 149 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:12,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 109 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:08:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-12 18:08:12,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2022-07-12 18:08:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 89 states have (on average 1.8426966292134832) internal successors, (164), 152 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:12,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions. [2022-07-12 18:08:12,339 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 3 [2022-07-12 18:08:12,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:12,339 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 164 transitions. [2022-07-12 18:08:12,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:12,339 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2022-07-12 18:08:12,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:08:12,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:12,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:12,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 18:08:12,341 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-07-12 18:08:12,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:12,341 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2022-07-12 18:08:12,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:12,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459563214] [2022-07-12 18:08:12,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:12,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:12,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:12,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:12,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459563214] [2022-07-12 18:08:12,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459563214] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:12,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:12,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:08:12,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387194076] [2022-07-12 18:08:12,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:12,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:08:12,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:12,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:08:12,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:08:12,425 INFO L87 Difference]: Start difference. First operand 153 states and 164 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:12,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:12,617 INFO L93 Difference]: Finished difference Result 162 states and 176 transitions. [2022-07-12 18:08:12,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:08:12,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-07-12 18:08:12,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:12,621 INFO L225 Difference]: With dead ends: 162 [2022-07-12 18:08:12,622 INFO L226 Difference]: Without dead ends: 162 [2022-07-12 18:08:12,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:08:12,625 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 264 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:12,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 84 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:08:12,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-12 18:08:12,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 151. [2022-07-12 18:08:12,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 103 states have (on average 1.6796116504854368) internal successors, (173), 150 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:12,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 173 transitions. [2022-07-12 18:08:12,643 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 173 transitions. Word has length 8 [2022-07-12 18:08:12,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:12,643 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 173 transitions. [2022-07-12 18:08:12,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:12,643 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 173 transitions. [2022-07-12 18:08:12,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:08:12,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:12,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:12,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 18:08:12,645 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-07-12 18:08:12,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:12,645 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2022-07-12 18:08:12,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:12,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039612509] [2022-07-12 18:08:12,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:12,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:12,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:12,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:12,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039612509] [2022-07-12 18:08:12,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039612509] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:12,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:12,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:08:12,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489415254] [2022-07-12 18:08:12,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:12,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:08:12,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:12,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:08:12,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:08:12,716 INFO L87 Difference]: Start difference. First operand 151 states and 173 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:12,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:12,931 INFO L93 Difference]: Finished difference Result 229 states and 253 transitions. [2022-07-12 18:08:12,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:08:12,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-07-12 18:08:12,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:12,933 INFO L225 Difference]: With dead ends: 229 [2022-07-12 18:08:12,933 INFO L226 Difference]: Without dead ends: 229 [2022-07-12 18:08:12,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:08:12,934 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 299 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:12,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 138 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:08:12,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-12 18:08:12,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 197. [2022-07-12 18:08:12,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 149 states have (on average 1.5771812080536913) internal successors, (235), 196 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:12,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 235 transitions. [2022-07-12 18:08:12,943 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 235 transitions. Word has length 8 [2022-07-12 18:08:12,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:12,943 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 235 transitions. [2022-07-12 18:08:12,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:12,944 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 235 transitions. [2022-07-12 18:08:12,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:08:12,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:12,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:12,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 18:08:12,945 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-07-12 18:08:12,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:12,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1117776432, now seen corresponding path program 1 times [2022-07-12 18:08:12,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:12,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727207360] [2022-07-12 18:08:12,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:12,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:12,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:12,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727207360] [2022-07-12 18:08:12,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727207360] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:12,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:12,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:08:12,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163381225] [2022-07-12 18:08:12,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:12,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:08:12,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:12,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:08:12,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:12,979 INFO L87 Difference]: Start difference. First operand 197 states and 235 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:12,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:12,995 INFO L93 Difference]: Finished difference Result 237 states and 278 transitions. [2022-07-12 18:08:12,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:08:12,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-07-12 18:08:12,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:12,998 INFO L225 Difference]: With dead ends: 237 [2022-07-12 18:08:12,998 INFO L226 Difference]: Without dead ends: 237 [2022-07-12 18:08:12,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:12,999 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 105 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:13,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 211 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:08:13,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-07-12 18:08:13,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 207. [2022-07-12 18:08:13,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 159 states have (on average 1.5660377358490567) internal successors, (249), 206 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:13,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 249 transitions. [2022-07-12 18:08:13,008 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 249 transitions. Word has length 10 [2022-07-12 18:08:13,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:13,008 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 249 transitions. [2022-07-12 18:08:13,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:13,009 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 249 transitions. [2022-07-12 18:08:13,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 18:08:13,009 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:13,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:13,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 18:08:13,010 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-07-12 18:08:13,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:13,010 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2022-07-12 18:08:13,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:13,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846757690] [2022-07-12 18:08:13,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:13,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:13,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:13,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846757690] [2022-07-12 18:08:13,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846757690] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:13,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:13,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:08:13,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436314133] [2022-07-12 18:08:13,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:13,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:08:13,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:13,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:08:13,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:08:13,067 INFO L87 Difference]: Start difference. First operand 207 states and 249 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:13,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:13,321 INFO L93 Difference]: Finished difference Result 213 states and 254 transitions. [2022-07-12 18:08:13,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:08:13,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 18:08:13,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:13,323 INFO L225 Difference]: With dead ends: 213 [2022-07-12 18:08:13,323 INFO L226 Difference]: Without dead ends: 213 [2022-07-12 18:08:13,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:08:13,324 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 100 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:13,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 356 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:08:13,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-12 18:08:13,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 206. [2022-07-12 18:08:13,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 159 states have (on average 1.5534591194968554) internal successors, (247), 205 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 247 transitions. [2022-07-12 18:08:13,331 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 247 transitions. Word has length 12 [2022-07-12 18:08:13,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:13,331 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 247 transitions. [2022-07-12 18:08:13,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 247 transitions. [2022-07-12 18:08:13,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 18:08:13,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:13,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:13,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 18:08:13,332 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-07-12 18:08:13,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:13,333 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2022-07-12 18:08:13,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:13,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808174441] [2022-07-12 18:08:13,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:13,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:13,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:13,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808174441] [2022-07-12 18:08:13,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808174441] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:13,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:13,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:08:13,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060873893] [2022-07-12 18:08:13,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:13,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:08:13,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:13,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:08:13,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:08:13,432 INFO L87 Difference]: Start difference. First operand 206 states and 247 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:13,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:13,694 INFO L93 Difference]: Finished difference Result 202 states and 240 transitions. [2022-07-12 18:08:13,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:08:13,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 18:08:13,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:13,696 INFO L225 Difference]: With dead ends: 202 [2022-07-12 18:08:13,696 INFO L226 Difference]: Without dead ends: 202 [2022-07-12 18:08:13,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:08:13,697 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 15 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:13,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 434 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:08:13,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-12 18:08:13,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 196. [2022-07-12 18:08:13,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 195 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:13,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 234 transitions. [2022-07-12 18:08:13,703 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 234 transitions. Word has length 12 [2022-07-12 18:08:13,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:13,703 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 234 transitions. [2022-07-12 18:08:13,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 234 transitions. [2022-07-12 18:08:13,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 18:08:13,705 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:13,705 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] [2022-07-12 18:08:13,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 18:08:13,705 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-07-12 18:08:13,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:13,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1270421215, now seen corresponding path program 1 times [2022-07-12 18:08:13,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:13,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957980662] [2022-07-12 18:08:13,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:13,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:08:13,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:13,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957980662] [2022-07-12 18:08:13,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957980662] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:13,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:13,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:08:13,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911870488] [2022-07-12 18:08:13,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:13,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:08:13,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:13,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:08:13,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:08:13,765 INFO L87 Difference]: Start difference. First operand 196 states and 234 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:13,866 INFO L93 Difference]: Finished difference Result 226 states and 249 transitions. [2022-07-12 18:08:13,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:08:13,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 18:08:13,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:13,870 INFO L225 Difference]: With dead ends: 226 [2022-07-12 18:08:13,870 INFO L226 Difference]: Without dead ends: 226 [2022-07-12 18:08:13,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:08:13,872 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 267 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:13,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 187 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:08:13,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-07-12 18:08:13,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 194. [2022-07-12 18:08:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 153 states have (on average 1.5032679738562091) internal successors, (230), 193 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:13,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 230 transitions. [2022-07-12 18:08:13,877 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 230 transitions. Word has length 21 [2022-07-12 18:08:13,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:13,877 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 230 transitions. [2022-07-12 18:08:13,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:13,877 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 230 transitions. [2022-07-12 18:08:13,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:08:13,878 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:13,878 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] [2022-07-12 18:08:13,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 18:08:13,879 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-07-12 18:08:13,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:13,879 INFO L85 PathProgramCache]: Analyzing trace with hash -697189136, now seen corresponding path program 1 times [2022-07-12 18:08:13,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:13,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587822893] [2022-07-12 18:08:13,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:13,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:14,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:14,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:14,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587822893] [2022-07-12 18:08:14,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587822893] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:08:14,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055053104] [2022-07-12 18:08:14,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:14,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:08:14,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:08:14,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:08:14,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 18:08:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:14,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-12 18:08:14,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:08:14,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:08:14,406 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 18:08:14,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 18:08:14,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:08:14,580 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:08:14,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-12 18:08:14,640 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:08:14,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-12 18:08:14,774 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:08:14,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-12 18:08:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:14,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:08:15,119 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:15,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-12 18:08:15,130 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:15,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-07-12 18:08:15,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 18:08:19,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:19,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055053104] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:08:19,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:08:19,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-07-12 18:08:19,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101027698] [2022-07-12 18:08:19,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:08:19,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 18:08:19,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:19,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 18:08:19,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=740, Unknown=7, NotChecked=0, Total=870 [2022-07-12 18:08:19,491 INFO L87 Difference]: Start difference. First operand 194 states and 230 transitions. Second operand has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:20,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:20,361 INFO L93 Difference]: Finished difference Result 389 states and 441 transitions. [2022-07-12 18:08:20,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 18:08:20,361 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-12 18:08:20,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:20,363 INFO L225 Difference]: With dead ends: 389 [2022-07-12 18:08:20,363 INFO L226 Difference]: Without dead ends: 389 [2022-07-12 18:08:20,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=279, Invalid=1196, Unknown=7, NotChecked=0, Total=1482 [2022-07-12 18:08:20,364 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 1127 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 1978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1005 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:20,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 1280 Invalid, 1978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 883 Invalid, 0 Unknown, 1005 Unchecked, 0.6s Time] [2022-07-12 18:08:20,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-07-12 18:08:20,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 216. [2022-07-12 18:08:20,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 175 states have (on average 1.4685714285714286) internal successors, (257), 215 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:20,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 257 transitions. [2022-07-12 18:08:20,370 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 257 transitions. Word has length 27 [2022-07-12 18:08:20,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:20,370 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 257 transitions. [2022-07-12 18:08:20,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:20,370 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 257 transitions. [2022-07-12 18:08:20,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:08:20,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:20,373 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] [2022-07-12 18:08:20,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 18:08:20,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:08:20,574 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-07-12 18:08:20,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:20,574 INFO L85 PathProgramCache]: Analyzing trace with hash -697189135, now seen corresponding path program 1 times [2022-07-12 18:08:20,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:20,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929664870] [2022-07-12 18:08:20,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:20,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:20,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:20,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:20,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929664870] [2022-07-12 18:08:20,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929664870] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:08:20,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331009830] [2022-07-12 18:08:20,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:20,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:08:20,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:08:20,818 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:08:20,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 18:08:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:20,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-12 18:08:20,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:08:20,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:08:21,001 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:08:21,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:08:21,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:08:21,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:08:21,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:08:21,178 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:08:21,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 18:08:21,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 18:08:21,199 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:08:21,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-12 18:08:21,265 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:08:21,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-12 18:08:21,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:08:21,430 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:08:21,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:08:21,435 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:08:21,438 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:21,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-07-12 18:08:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:21,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:08:21,685 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_69| Int) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (or (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_69|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_69|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_69| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_69| 0))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_69| Int) (v_ArrVal_279 (Array Int Int))) (or (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_69|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_69| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_69| 0)))) is different from false [2022-07-12 18:08:21,803 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_69| Int) (v_ArrVal_279 (Array Int Int))) (or (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_69|) 4)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_69| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_69| 0))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_69| Int) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_69| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_69| 0) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_69|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_69|)))))) is different from false [2022-07-12 18:08:21,826 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_69| Int) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_69|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_280) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_69|)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_69| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_69| 0))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_69| Int) (v_ArrVal_279 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_69| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_69| 0) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_69|) 4))))) is different from false [2022-07-12 18:08:21,862 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:21,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-12 18:08:21,870 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:21,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-07-12 18:08:21,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 18:08:21,908 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:21,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-07-12 18:08:21,915 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:21,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-12 18:08:21,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:08:21,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:08:21,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:08:21,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-07-12 18:08:21,925 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:08:21,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:08:21,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:08:21,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-07-12 18:08:22,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:22,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331009830] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:08:22,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:08:22,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-07-12 18:08:22,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114080568] [2022-07-12 18:08:22,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:08:22,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 18:08:22,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:22,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 18:08:22,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=722, Unknown=3, NotChecked=168, Total=992 [2022-07-12 18:08:22,135 INFO L87 Difference]: Start difference. First operand 216 states and 257 transitions. Second operand has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 32 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:23,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:23,905 INFO L93 Difference]: Finished difference Result 490 states and 564 transitions. [2022-07-12 18:08:23,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-12 18:08:23,905 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 32 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-12 18:08:23,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:23,907 INFO L225 Difference]: With dead ends: 490 [2022-07-12 18:08:23,907 INFO L226 Difference]: Without dead ends: 490 [2022-07-12 18:08:23,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=370, Invalid=1895, Unknown=3, NotChecked=282, Total=2550 [2022-07-12 18:08:23,909 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 833 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 2719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1160 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:23,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1285 Invalid, 2719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1484 Invalid, 0 Unknown, 1160 Unchecked, 0.9s Time] [2022-07-12 18:08:23,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-07-12 18:08:23,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 216. [2022-07-12 18:08:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 175 states have (on average 1.4628571428571429) internal successors, (256), 215 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 256 transitions. [2022-07-12 18:08:23,916 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 256 transitions. Word has length 27 [2022-07-12 18:08:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:23,916 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 256 transitions. [2022-07-12 18:08:23,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 32 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 256 transitions. [2022-07-12 18:08:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 18:08:23,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:23,918 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] [2022-07-12 18:08:23,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 18:08:24,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 18:08:24,139 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-07-12 18:08:24,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:24,140 INFO L85 PathProgramCache]: Analyzing trace with hash 24881054, now seen corresponding path program 1 times [2022-07-12 18:08:24,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:24,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41422763] [2022-07-12 18:08:24,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:24,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:24,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:08:24,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:24,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41422763] [2022-07-12 18:08:24,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41422763] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:24,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:24,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:08:24,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225877782] [2022-07-12 18:08:24,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:24,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:08:24,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:24,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:08:24,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:24,192 INFO L87 Difference]: Start difference. First operand 216 states and 256 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:24,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:24,200 INFO L93 Difference]: Finished difference Result 218 states and 258 transitions. [2022-07-12 18:08:24,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:08:24,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 29 [2022-07-12 18:08:24,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:24,202 INFO L225 Difference]: With dead ends: 218 [2022-07-12 18:08:24,202 INFO L226 Difference]: Without dead ends: 218 [2022-07-12 18:08:24,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:24,203 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:24,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 272 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:08:24,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-12 18:08:24,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-07-12 18:08:24,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 177 states have (on average 1.4576271186440677) internal successors, (258), 217 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 258 transitions. [2022-07-12 18:08:24,209 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 258 transitions. Word has length 29 [2022-07-12 18:08:24,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:24,210 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 258 transitions. [2022-07-12 18:08:24,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:24,210 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 258 transitions. [2022-07-12 18:08:24,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 18:08:24,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:24,216 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] [2022-07-12 18:08:24,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 18:08:24,216 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-07-12 18:08:24,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:24,217 INFO L85 PathProgramCache]: Analyzing trace with hash -197373836, now seen corresponding path program 1 times [2022-07-12 18:08:24,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:24,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113575407] [2022-07-12 18:08:24,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:24,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:08:24,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:24,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113575407] [2022-07-12 18:08:24,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113575407] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:24,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:24,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:08:24,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507203541] [2022-07-12 18:08:24,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:24,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:08:24,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:24,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:08:24,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:08:24,282 INFO L87 Difference]: Start difference. First operand 218 states and 258 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:24,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:24,493 INFO L93 Difference]: Finished difference Result 243 states and 288 transitions. [2022-07-12 18:08:24,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:08:24,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-12 18:08:24,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:24,495 INFO L225 Difference]: With dead ends: 243 [2022-07-12 18:08:24,495 INFO L226 Difference]: Without dead ends: 243 [2022-07-12 18:08:24,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:08:24,496 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 109 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:24,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 345 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:08:24,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-12 18:08:24,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 217. [2022-07-12 18:08:24,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.4519774011299436) internal successors, (257), 216 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:24,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 257 transitions. [2022-07-12 18:08:24,500 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 257 transitions. Word has length 32 [2022-07-12 18:08:24,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:24,500 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 257 transitions. [2022-07-12 18:08:24,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:24,501 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 257 transitions. [2022-07-12 18:08:24,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 18:08:24,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:24,502 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] [2022-07-12 18:08:24,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 18:08:24,502 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-07-12 18:08:24,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:24,503 INFO L85 PathProgramCache]: Analyzing trace with hash -197373835, now seen corresponding path program 1 times [2022-07-12 18:08:24,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:24,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829104715] [2022-07-12 18:08:24,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:24,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:24,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:24,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:24,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829104715] [2022-07-12 18:08:24,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829104715] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:08:24,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109570279] [2022-07-12 18:08:24,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:24,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:08:24,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:08:24,747 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:08:24,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 18:08:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:24,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-12 18:08:24,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:08:24,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:08:24,940 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:08:24,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:08:24,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:08:24,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:08:25,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-12 18:08:25,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 18:08:25,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 18:08:25,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-12 18:08:25,266 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:08:25,312 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:25,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 17 [2022-07-12 18:08:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:25,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:08:25,461 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:25,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-07-12 18:08:25,781 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_74| Int) (v_ArrVal_423 (Array Int Int))) (or (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_423) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_74|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_74| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0))) is different from false [2022-07-12 18:08:25,822 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_74| Int) (v_ArrVal_423 (Array Int Int))) (or (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_423) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_74|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_74| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0))) is different from false [2022-07-12 18:08:25,833 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_74| Int) (v_ArrVal_423 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_74| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_423) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_74|)))) is different from false [2022-07-12 18:08:25,849 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:25,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-12 18:08:25,857 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:25,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-12 18:08:25,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-12 18:08:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:26,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109570279] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:08:26,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:08:26,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2022-07-12 18:08:26,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383077647] [2022-07-12 18:08:26,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:08:26,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-12 18:08:26,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:26,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-12 18:08:26,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1260, Unknown=3, NotChecked=222, Total=1640 [2022-07-12 18:08:26,111 INFO L87 Difference]: Start difference. First operand 217 states and 257 transitions. Second operand has 41 states, 40 states have (on average 2.35) internal successors, (94), 41 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:27,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:27,607 INFO L93 Difference]: Finished difference Result 322 states and 372 transitions. [2022-07-12 18:08:27,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-12 18:08:27,608 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.35) internal successors, (94), 41 states have internal predecessors, (94), 0 states have call successors, (0), 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 32 [2022-07-12 18:08:27,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:27,609 INFO L225 Difference]: With dead ends: 322 [2022-07-12 18:08:27,609 INFO L226 Difference]: Without dead ends: 322 [2022-07-12 18:08:27,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=557, Invalid=3234, Unknown=3, NotChecked=366, Total=4160 [2022-07-12 18:08:27,611 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 550 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 2211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 820 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:27,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1792 Invalid, 2211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1278 Invalid, 0 Unknown, 820 Unchecked, 0.7s Time] [2022-07-12 18:08:27,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-07-12 18:08:27,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 208. [2022-07-12 18:08:27,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 174 states have (on average 1.4137931034482758) internal successors, (246), 207 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 246 transitions. [2022-07-12 18:08:27,616 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 246 transitions. Word has length 32 [2022-07-12 18:08:27,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:27,616 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 246 transitions. [2022-07-12 18:08:27,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.35) internal successors, (94), 41 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:27,616 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 246 transitions. [2022-07-12 18:08:27,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 18:08:27,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:27,617 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] [2022-07-12 18:08:27,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 18:08:27,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:08:27,835 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-07-12 18:08:27,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:27,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1018847574, now seen corresponding path program 1 times [2022-07-12 18:08:27,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:27,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519455173] [2022-07-12 18:08:27,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:27,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:08:27,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:27,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519455173] [2022-07-12 18:08:27,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519455173] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:27,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:27,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:08:27,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234472450] [2022-07-12 18:08:27,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:27,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:08:27,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:27,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:08:27,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:08:27,951 INFO L87 Difference]: Start difference. First operand 208 states and 246 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:28,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:28,351 INFO L93 Difference]: Finished difference Result 224 states and 264 transitions. [2022-07-12 18:08:28,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:08:28,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-12 18:08:28,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:28,353 INFO L225 Difference]: With dead ends: 224 [2022-07-12 18:08:28,353 INFO L226 Difference]: Without dead ends: 224 [2022-07-12 18:08:28,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:08:28,354 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 31 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:28,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 547 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 18:08:28,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-12 18:08:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 216. [2022-07-12 18:08:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 215 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:28,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 254 transitions. [2022-07-12 18:08:28,358 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 254 transitions. Word has length 32 [2022-07-12 18:08:28,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:28,358 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 254 transitions. [2022-07-12 18:08:28,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:28,358 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 254 transitions. [2022-07-12 18:08:28,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 18:08:28,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:28,358 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] [2022-07-12 18:08:28,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 18:08:28,359 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-07-12 18:08:28,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:28,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1018907156, now seen corresponding path program 1 times [2022-07-12 18:08:28,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:28,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785551997] [2022-07-12 18:08:28,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:28,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:28,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:08:28,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:28,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785551997] [2022-07-12 18:08:28,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785551997] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:28,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:28,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:08:28,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194814128] [2022-07-12 18:08:28,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:28,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:08:28,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:28,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:08:28,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:28,443 INFO L87 Difference]: Start difference. First operand 216 states and 254 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:28,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:28,502 INFO L93 Difference]: Finished difference Result 214 states and 249 transitions. [2022-07-12 18:08:28,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:08:28,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-12 18:08:28,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:28,504 INFO L225 Difference]: With dead ends: 214 [2022-07-12 18:08:28,504 INFO L226 Difference]: Without dead ends: 214 [2022-07-12 18:08:28,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:28,506 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 67 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:28,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 152 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:08:28,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-12 18:08:28,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2022-07-12 18:08:28,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 212 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 249 transitions. [2022-07-12 18:08:28,518 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 249 transitions. Word has length 32 [2022-07-12 18:08:28,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:28,519 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 249 transitions. [2022-07-12 18:08:28,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:28,519 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 249 transitions. [2022-07-12 18:08:28,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 18:08:28,520 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:28,520 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] [2022-07-12 18:08:28,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 18:08:28,521 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-07-12 18:08:28,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:28,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1018907157, now seen corresponding path program 1 times [2022-07-12 18:08:28,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:28,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325348213] [2022-07-12 18:08:28,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:28,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:28,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:08:28,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:28,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325348213] [2022-07-12 18:08:28,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325348213] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:28,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:28,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:08:28,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127018669] [2022-07-12 18:08:28,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:28,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:08:28,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:28,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:08:28,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:28,574 INFO L87 Difference]: Start difference. First operand 213 states and 249 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:28,633 INFO L93 Difference]: Finished difference Result 210 states and 244 transitions. [2022-07-12 18:08:28,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:08:28,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-12 18:08:28,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:28,635 INFO L225 Difference]: With dead ends: 210 [2022-07-12 18:08:28,635 INFO L226 Difference]: Without dead ends: 210 [2022-07-12 18:08:28,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:28,636 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 72 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:28,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 136 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:08:28,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-12 18:08:28,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-07-12 18:08:28,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 182 states have (on average 1.3406593406593406) internal successors, (244), 209 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:28,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 244 transitions. [2022-07-12 18:08:28,642 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 244 transitions. Word has length 32 [2022-07-12 18:08:28,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:28,642 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 244 transitions. [2022-07-12 18:08:28,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:28,642 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 244 transitions. [2022-07-12 18:08:28,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 18:08:28,643 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:28,643 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:28,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 18:08:28,643 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-07-12 18:08:28,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:28,644 INFO L85 PathProgramCache]: Analyzing trace with hash 948343841, now seen corresponding path program 1 times [2022-07-12 18:08:28,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:28,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313850481] [2022-07-12 18:08:28,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:28,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:08:28,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:28,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313850481] [2022-07-12 18:08:28,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313850481] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:28,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:28,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:08:28,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294118288] [2022-07-12 18:08:28,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:28,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:08:28,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:28,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:08:28,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:08:28,697 INFO L87 Difference]: Start difference. First operand 210 states and 244 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:28,886 INFO L93 Difference]: Finished difference Result 230 states and 265 transitions. [2022-07-12 18:08:28,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:08:28,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-12 18:08:28,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:28,887 INFO L225 Difference]: With dead ends: 230 [2022-07-12 18:08:28,887 INFO L226 Difference]: Without dead ends: 230 [2022-07-12 18:08:28,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:08:28,888 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 92 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:28,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 321 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:08:28,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-12 18:08:28,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 216. [2022-07-12 18:08:28,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 188 states have (on average 1.3457446808510638) internal successors, (253), 215 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 253 transitions. [2022-07-12 18:08:28,893 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 253 transitions. Word has length 36 [2022-07-12 18:08:28,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:28,893 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 253 transitions. [2022-07-12 18:08:28,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:28,893 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 253 transitions. [2022-07-12 18:08:28,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 18:08:28,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:28,894 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:28,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 18:08:28,894 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-07-12 18:08:28,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:28,895 INFO L85 PathProgramCache]: Analyzing trace with hash 948343842, now seen corresponding path program 1 times [2022-07-12 18:08:28,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:28,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681132435] [2022-07-12 18:08:28,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:28,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:29,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:29,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:29,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681132435] [2022-07-12 18:08:29,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681132435] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:08:29,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690025214] [2022-07-12 18:08:29,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:29,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:08:29,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:08:29,135 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:08:29,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 18:08:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:29,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 18:08:29,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:08:29,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-12 18:08:29,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-12 18:08:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:08:29,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:08:29,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690025214] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:29,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 18:08:29,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 18 [2022-07-12 18:08:29,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535827011] [2022-07-12 18:08:29,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:29,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:08:29,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:29,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:08:29,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:08:29,412 INFO L87 Difference]: Start difference. First operand 216 states and 253 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:29,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:29,613 INFO L93 Difference]: Finished difference Result 225 states and 260 transitions. [2022-07-12 18:08:29,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:08:29,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-12 18:08:29,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:29,615 INFO L225 Difference]: With dead ends: 225 [2022-07-12 18:08:29,615 INFO L226 Difference]: Without dead ends: 225 [2022-07-12 18:08:29,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2022-07-12 18:08:29,616 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 53 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:29,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 389 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:08:29,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-07-12 18:08:29,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 214. [2022-07-12 18:08:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 188 states have (on average 1.3191489361702127) internal successors, (248), 213 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:29,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 248 transitions. [2022-07-12 18:08:29,624 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 248 transitions. Word has length 36 [2022-07-12 18:08:29,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:29,625 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 248 transitions. [2022-07-12 18:08:29,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:29,625 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 248 transitions. [2022-07-12 18:08:29,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 18:08:29,625 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:29,626 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] [2022-07-12 18:08:29,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 18:08:29,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-12 18:08:29,851 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 65 more)] === [2022-07-12 18:08:29,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:29,851 INFO L85 PathProgramCache]: Analyzing trace with hash -468812102, now seen corresponding path program 1 times [2022-07-12 18:08:29,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:29,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832776156] [2022-07-12 18:08:29,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:29,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:30,267 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:30,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:30,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832776156] [2022-07-12 18:08:30,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832776156] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:08:30,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923793021] [2022-07-12 18:08:30,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:30,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:08:30,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:08:30,269 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:08:30,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 18:08:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:30,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-12 18:08:30,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:08:30,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:08:30,443 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:08:30,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:08:30,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:08:30,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:08:30,606 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:08:30,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2022-07-12 18:08:30,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-07-12 18:08:30,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:08:30,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:08:30,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:08:30,707 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 18:08:30,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 70 [2022-07-12 18:08:30,719 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-12 18:08:30,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 58 [2022-07-12 18:08:31,264 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:08:31,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:08:31,266 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:08:31,272 INFO L356 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-07-12 18:08:31,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 69 treesize of output 42 [2022-07-12 18:08:31,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:08:31,284 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 18:08:31,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 22 [2022-07-12 18:08:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:31,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:08:53,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2778 treesize of output 2762 [2022-07-12 18:08:53,880 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:08:53,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:08:55,375 INFO L356 Elim1Store]: treesize reduction 624, result has 48.3 percent of original size [2022-07-12 18:08:55,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 15 new quantified variables, introduced 92 case distinctions, treesize of input 320758 treesize of output 306847 [2022-07-12 18:09:14,528 WARN L233 SmtUtils]: Spent 19.15s on a formula simplification. DAG size of input: 817 DAG size of output: 792 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-12 18:09:27,419 WARN L233 SmtUtils]: Spent 12.88s on a formula simplification. DAG size of input: 777 DAG size of output: 769 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-12 18:09:27,571 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:27,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 234624 treesize of output 234612 [2022-07-12 18:09:29,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 18:09:30,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 18:09:30,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 18:09:31,016 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:31,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2022-07-12 18:09:31,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 18:09:31,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 18:09:35,626 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-12 18:09:35,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 57 [2022-07-12 18:09:36,115 INFO L356 Elim1Store]: treesize reduction 48, result has 40.7 percent of original size [2022-07-12 18:09:36,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 93 [2022-07-12 18:09:37,118 INFO L356 Elim1Store]: treesize reduction 48, result has 40.7 percent of original size [2022-07-12 18:09:37,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 93 [2022-07-12 18:09:37,569 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-12 18:09:37,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 57 [2022-07-12 18:09:37,851 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-12 18:09:37,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 57 [2022-07-12 18:09:38,297 INFO L356 Elim1Store]: treesize reduction 48, result has 40.7 percent of original size [2022-07-12 18:09:38,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 93 [2022-07-12 18:09:38,854 INFO L356 Elim1Store]: treesize reduction 48, result has 40.7 percent of original size [2022-07-12 18:09:38,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 93 [2022-07-12 18:09:40,003 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-12 18:09:40,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 57 [2022-07-12 18:09:41,330 INFO L356 Elim1Store]: treesize reduction 73, result has 9.9 percent of original size [2022-07-12 18:09:41,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 81 treesize of output 79 [2022-07-12 18:09:41,886 INFO L356 Elim1Store]: treesize reduction 80, result has 33.9 percent of original size [2022-07-12 18:09:41,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 87 treesize of output 115