./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-sorted-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7e1ff0e6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-sorted-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 01:25:56,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:25:56,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:25:56,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:25:56,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:25:56,217 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:25:56,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:25:56,220 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:25:56,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:25:56,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:25:56,223 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:25:56,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:25:56,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:25:56,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:25:56,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:25:56,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:25:56,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:25:56,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:25:56,241 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:25:56,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:25:56,247 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:25:56,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:25:56,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:25:56,250 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:25:56,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:25:56,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:25:56,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:25:56,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:25:56,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:25:56,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:25:56,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:25:56,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:25:56,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:25:56,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:25:56,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:25:56,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:25:56,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:25:56,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:25:56,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:25:56,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:25:56,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:25:56,264 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 01:25:56,281 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:25:56,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:25:56,282 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:25:56,282 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:25:56,282 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:25:56,283 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:25:56,283 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:25:56,283 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:25:56,283 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:25:56,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:25:56,284 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:25:56,284 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:25:56,284 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:25:56,284 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:25:56,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:25:56,285 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:25:56,285 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:25:56,285 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:25:56,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:25:56,285 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:25:56,286 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:25:56,286 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:25:56,286 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:25:56,286 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:25:56,286 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:25:56,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:25:56,287 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:25:56,287 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:25:56,287 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 01:25:56,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 01:25:56,288 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:25:56,288 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:25:56,288 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:25:56,288 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:25:56,288 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 [2023-02-15 01:25:56,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:25:56,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:25:56,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:25:56,538 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:25:56,538 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:25:56,539 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-sorted-2.i [2023-02-15 01:25:57,605 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:25:57,813 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:25:57,815 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i [2023-02-15 01:25:57,823 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3835ff906/e3b399083d7d469f9e197f2302152b61/FLAG72a561de3 [2023-02-15 01:25:57,833 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3835ff906/e3b399083d7d469f9e197f2302152b61 [2023-02-15 01:25:57,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:25:57,836 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:25:57,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:25:57,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:25:57,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:25:57,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:25:57" (1/1) ... [2023-02-15 01:25:57,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8fbea3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:25:57, skipping insertion in model container [2023-02-15 01:25:57,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:25:57" (1/1) ... [2023-02-15 01:25:57,850 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:25:57,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:25:58,121 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22384,22397] [2023-02-15 01:25:58,130 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22614,22627] [2023-02-15 01:25:58,134 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22989,23002] [2023-02-15 01:25:58,135 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23053,23066] [2023-02-15 01:25:58,136 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23184,23197] [2023-02-15 01:25:58,137 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23248,23261] [2023-02-15 01:25:58,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:25:58,152 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:25:58,189 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22384,22397] [2023-02-15 01:25:58,192 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22614,22627] [2023-02-15 01:25:58,195 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22989,23002] [2023-02-15 01:25:58,195 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23053,23066] [2023-02-15 01:25:58,196 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23184,23197] [2023-02-15 01:25:58,197 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23248,23261] [2023-02-15 01:25:58,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:25:58,221 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:25:58,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:25:58 WrapperNode [2023-02-15 01:25:58,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:25:58,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:25:58,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:25:58,224 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:25:58,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:25:58" (1/1) ... [2023-02-15 01:25:58,241 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:25:58" (1/1) ... [2023-02-15 01:25:58,261 INFO L138 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 197 [2023-02-15 01:25:58,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:25:58,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:25:58,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:25:58,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:25:58,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:25:58" (1/1) ... [2023-02-15 01:25:58,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:25:58" (1/1) ... [2023-02-15 01:25:58,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:25:58" (1/1) ... [2023-02-15 01:25:58,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:25:58" (1/1) ... [2023-02-15 01:25:58,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:25:58" (1/1) ... [2023-02-15 01:25:58,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:25:58" (1/1) ... [2023-02-15 01:25:58,300 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:25:58" (1/1) ... [2023-02-15 01:25:58,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:25:58" (1/1) ... [2023-02-15 01:25:58,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:25:58,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:25:58,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:25:58,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:25:58,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:25:58" (1/1) ... [2023-02-15 01:25:58,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:25:58,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:25:58,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 01:25:58,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 01:25:58,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 01:25:58,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 01:25:58,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 01:25:58,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:25:58,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 01:25:58,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 01:25:58,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 01:25:58,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 01:25:58,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:25:58,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:25:58,513 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:25:58,515 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:25:58,961 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:25:58,977 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:25:58,978 INFO L300 CfgBuilder]: Removed 18 assume(true) statements. [2023-02-15 01:25:58,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:25:58 BoogieIcfgContainer [2023-02-15 01:25:58,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:25:58,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:25:58,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:25:58,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:25:58,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:25:57" (1/3) ... [2023-02-15 01:25:58,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31de7323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:25:58, skipping insertion in model container [2023-02-15 01:25:58,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:25:58" (2/3) ... [2023-02-15 01:25:58,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31de7323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:25:58, skipping insertion in model container [2023-02-15 01:25:58,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:25:58" (3/3) ... [2023-02-15 01:25:58,990 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2023-02-15 01:25:59,002 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:25:59,002 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2023-02-15 01:25:59,036 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:25:59,041 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@166b90ec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:25:59,041 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2023-02-15 01:25:59,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 98 states have (on average 2.183673469387755) internal successors, (214), 178 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:25:59,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 01:25:59,048 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:25:59,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 01:25:59,049 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 01:25:59,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:25:59,053 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 01:25:59,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:25:59,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365677565] [2023-02-15 01:25:59,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:25:59,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:25:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:25:59,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:25:59,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:25:59,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365677565] [2023-02-15 01:25:59,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365677565] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:25:59,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:25:59,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:25:59,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659212967] [2023-02-15 01:25:59,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:25:59,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:25:59,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:25:59,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:25:59,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:25:59,308 INFO L87 Difference]: Start difference. First operand has 179 states, 98 states have (on average 2.183673469387755) internal successors, (214), 178 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:25:59,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:25:59,464 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2023-02-15 01:25:59,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:25:59,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-15 01:25:59,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:25:59,474 INFO L225 Difference]: With dead ends: 182 [2023-02-15 01:25:59,475 INFO L226 Difference]: Without dead ends: 178 [2023-02-15 01:25:59,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:25:59,479 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 172 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:25:59,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 118 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:25:59,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-02-15 01:25:59,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2023-02-15 01:25:59,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 97 states have (on average 1.907216494845361) internal successors, (185), 173 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:25:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 185 transitions. [2023-02-15 01:25:59,520 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 185 transitions. Word has length 3 [2023-02-15 01:25:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:25:59,520 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 185 transitions. [2023-02-15 01:25:59,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:25:59,521 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 185 transitions. [2023-02-15 01:25:59,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 01:25:59,521 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:25:59,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 01:25:59,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 01:25:59,522 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 01:25:59,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:25:59,524 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 01:25:59,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:25:59,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52913887] [2023-02-15 01:25:59,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:25:59,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:25:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:25:59,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:25:59,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:25:59,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52913887] [2023-02-15 01:25:59,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52913887] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:25:59,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:25:59,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:25:59,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547845540] [2023-02-15 01:25:59,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:25:59,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:25:59,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:25:59,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:25:59,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:25:59,647 INFO L87 Difference]: Start difference. First operand 174 states and 185 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:25:59,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:25:59,771 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2023-02-15 01:25:59,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:25:59,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-15 01:25:59,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:25:59,773 INFO L225 Difference]: With dead ends: 175 [2023-02-15 01:25:59,773 INFO L226 Difference]: Without dead ends: 175 [2023-02-15 01:25:59,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:25:59,775 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 167 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:25:59,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 116 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:25:59,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-02-15 01:25:59,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2023-02-15 01:25:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 97 states have (on average 1.8762886597938144) internal successors, (182), 170 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:25:59,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 182 transitions. [2023-02-15 01:25:59,789 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 182 transitions. Word has length 3 [2023-02-15 01:25:59,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:25:59,790 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 182 transitions. [2023-02-15 01:25:59,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:25:59,791 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 182 transitions. [2023-02-15 01:25:59,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 01:25:59,791 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:25:59,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:25:59,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 01:25:59,792 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 01:25:59,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:25:59,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2023-02-15 01:25:59,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:25:59,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548266276] [2023-02-15 01:25:59,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:25:59,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:25:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:25:59,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:25:59,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:25:59,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548266276] [2023-02-15 01:25:59,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548266276] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:25:59,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:25:59,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:25:59,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742574988] [2023-02-15 01:25:59,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:25:59,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:25:59,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:25:59,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:25:59,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:25:59,922 INFO L87 Difference]: Start difference. First operand 171 states and 182 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:00,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:26:00,093 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2023-02-15 01:26:00,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:26:00,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 01:26:00,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:26:00,097 INFO L225 Difference]: With dead ends: 178 [2023-02-15 01:26:00,097 INFO L226 Difference]: Without dead ends: 178 [2023-02-15 01:26:00,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:26:00,100 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 298 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:26:00,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 89 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:26:00,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-02-15 01:26:00,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 167. [2023-02-15 01:26:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 111 states have (on average 1.7027027027027026) internal successors, (189), 166 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:00,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 189 transitions. [2023-02-15 01:26:00,125 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 189 transitions. Word has length 9 [2023-02-15 01:26:00,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:26:00,126 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 189 transitions. [2023-02-15 01:26:00,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:00,126 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 189 transitions. [2023-02-15 01:26:00,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 01:26:00,127 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:26:00,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:26:00,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 01:26:00,127 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 01:26:00,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:26:00,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2023-02-15 01:26:00,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:26:00,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720975670] [2023-02-15 01:26:00,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:00,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:26:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:26:00,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:26:00,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720975670] [2023-02-15 01:26:00,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720975670] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:26:00,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:26:00,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:26:00,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971226411] [2023-02-15 01:26:00,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:26:00,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:26:00,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:26:00,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:26:00,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:26:00,353 INFO L87 Difference]: Start difference. First operand 167 states and 189 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:00,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:26:00,631 INFO L93 Difference]: Finished difference Result 258 states and 282 transitions. [2023-02-15 01:26:00,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:26:00,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 01:26:00,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:26:00,633 INFO L225 Difference]: With dead ends: 258 [2023-02-15 01:26:00,633 INFO L226 Difference]: Without dead ends: 258 [2023-02-15 01:26:00,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:26:00,634 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 439 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:26:00,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 130 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:26:00,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-02-15 01:26:00,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 220. [2023-02-15 01:26:00,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 164 states have (on average 1.6097560975609757) internal successors, (264), 219 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:00,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 264 transitions. [2023-02-15 01:26:00,643 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 264 transitions. Word has length 9 [2023-02-15 01:26:00,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:26:00,643 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 264 transitions. [2023-02-15 01:26:00,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:00,644 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 264 transitions. [2023-02-15 01:26:00,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 01:26:00,644 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:26:00,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:26:00,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 01:26:00,645 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 01:26:00,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:26:00,645 INFO L85 PathProgramCache]: Analyzing trace with hash 233093812, now seen corresponding path program 1 times [2023-02-15 01:26:00,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:26:00,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205931403] [2023-02-15 01:26:00,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:00,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:26:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:00,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:26:00,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:26:00,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205931403] [2023-02-15 01:26:00,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205931403] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:26:00,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:26:00,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:26:00,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281088328] [2023-02-15 01:26:00,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:26:00,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:26:00,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:26:00,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:26:00,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:26:00,693 INFO L87 Difference]: Start difference. First operand 220 states and 264 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:00,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:26:00,715 INFO L93 Difference]: Finished difference Result 266 states and 313 transitions. [2023-02-15 01:26:00,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:26:00,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-15 01:26:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:26:00,718 INFO L225 Difference]: With dead ends: 266 [2023-02-15 01:26:00,719 INFO L226 Difference]: Without dead ends: 266 [2023-02-15 01:26:00,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:26:00,722 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 120 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:26:00,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 235 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:26:00,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-02-15 01:26:00,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 233. [2023-02-15 01:26:00,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 177 states have (on average 1.6045197740112995) internal successors, (284), 232 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:00,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 284 transitions. [2023-02-15 01:26:00,738 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 284 transitions. Word has length 11 [2023-02-15 01:26:00,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:26:00,738 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 284 transitions. [2023-02-15 01:26:00,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:00,738 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 284 transitions. [2023-02-15 01:26:00,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 01:26:00,739 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:26:00,739 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:26:00,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 01:26:00,739 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 01:26:00,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:26:00,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2023-02-15 01:26:00,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:26:00,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731354771] [2023-02-15 01:26:00,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:00,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:26:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:00,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:26:00,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:26:00,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731354771] [2023-02-15 01:26:00,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731354771] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:26:00,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:26:00,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:26:00,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628527511] [2023-02-15 01:26:00,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:26:00,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:26:00,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:26:00,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:26:00,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:26:00,898 INFO L87 Difference]: Start difference. First operand 233 states and 284 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:01,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:26:01,072 INFO L93 Difference]: Finished difference Result 232 states and 281 transitions. [2023-02-15 01:26:01,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:26:01,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 01:26:01,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:26:01,073 INFO L225 Difference]: With dead ends: 232 [2023-02-15 01:26:01,073 INFO L226 Difference]: Without dead ends: 232 [2023-02-15 01:26:01,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:26:01,074 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 7 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:26:01,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 406 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:26:01,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-02-15 01:26:01,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2023-02-15 01:26:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 177 states have (on average 1.5875706214689265) internal successors, (281), 231 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:01,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 281 transitions. [2023-02-15 01:26:01,079 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 281 transitions. Word has length 12 [2023-02-15 01:26:01,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:26:01,079 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 281 transitions. [2023-02-15 01:26:01,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:01,080 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 281 transitions. [2023-02-15 01:26:01,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 01:26:01,080 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:26:01,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:26:01,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 01:26:01,081 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 01:26:01,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:26:01,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2023-02-15 01:26:01,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:26:01,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297279423] [2023-02-15 01:26:01,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:01,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:26:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:26:01,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:26:01,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297279423] [2023-02-15 01:26:01,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297279423] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:26:01,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:26:01,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:26:01,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491737177] [2023-02-15 01:26:01,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:26:01,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:26:01,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:26:01,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:26:01,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:26:01,192 INFO L87 Difference]: Start difference. First operand 232 states and 281 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:01,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:26:01,338 INFO L93 Difference]: Finished difference Result 231 states and 278 transitions. [2023-02-15 01:26:01,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:26:01,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 01:26:01,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:26:01,339 INFO L225 Difference]: With dead ends: 231 [2023-02-15 01:26:01,340 INFO L226 Difference]: Without dead ends: 231 [2023-02-15 01:26:01,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:26:01,341 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 8 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:26:01,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 426 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:26:01,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-02-15 01:26:01,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2023-02-15 01:26:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 177 states have (on average 1.5706214689265536) internal successors, (278), 230 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 278 transitions. [2023-02-15 01:26:01,348 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 278 transitions. Word has length 12 [2023-02-15 01:26:01,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:26:01,349 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 278 transitions. [2023-02-15 01:26:01,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:01,349 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 278 transitions. [2023-02-15 01:26:01,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 01:26:01,350 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:26:01,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:26:01,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 01:26:01,350 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 01:26:01,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:26:01,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2023-02-15 01:26:01,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:26:01,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390657532] [2023-02-15 01:26:01,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:01,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:26:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:01,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:26:01,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:26:01,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390657532] [2023-02-15 01:26:01,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390657532] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:26:01,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:26:01,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 01:26:01,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148566256] [2023-02-15 01:26:01,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:26:01,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 01:26:01,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:26:01,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 01:26:01,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:26:01,591 INFO L87 Difference]: Start difference. First operand 231 states and 278 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:26:01,854 INFO L93 Difference]: Finished difference Result 237 states and 279 transitions. [2023-02-15 01:26:01,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 01:26:01,855 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 01:26:01,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:26:01,857 INFO L225 Difference]: With dead ends: 237 [2023-02-15 01:26:01,857 INFO L226 Difference]: Without dead ends: 237 [2023-02-15 01:26:01,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-15 01:26:01,859 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 296 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:26:01,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 289 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:26:01,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-02-15 01:26:01,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 230. [2023-02-15 01:26:01,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 177 states have (on average 1.5593220338983051) internal successors, (276), 229 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:01,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 276 transitions. [2023-02-15 01:26:01,866 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 276 transitions. Word has length 16 [2023-02-15 01:26:01,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:26:01,867 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 276 transitions. [2023-02-15 01:26:01,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:01,867 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 276 transitions. [2023-02-15 01:26:01,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 01:26:01,867 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:26:01,867 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:26:01,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 01:26:01,868 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 01:26:01,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:26:01,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2023-02-15 01:26:01,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:26:01,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973323280] [2023-02-15 01:26:01,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:01,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:26:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:26:02,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:26:02,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973323280] [2023-02-15 01:26:02,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973323280] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:26:02,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:26:02,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 01:26:02,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036133433] [2023-02-15 01:26:02,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:26:02,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 01:26:02,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:26:02,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 01:26:02,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-15 01:26:02,145 INFO L87 Difference]: Start difference. First operand 230 states and 276 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:26:02,645 INFO L93 Difference]: Finished difference Result 232 states and 270 transitions. [2023-02-15 01:26:02,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 01:26:02,646 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 01:26:02,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:26:02,647 INFO L225 Difference]: With dead ends: 232 [2023-02-15 01:26:02,647 INFO L226 Difference]: Without dead ends: 232 [2023-02-15 01:26:02,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2023-02-15 01:26:02,648 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 294 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:26:02,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 388 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 01:26:02,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-02-15 01:26:02,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 216. [2023-02-15 01:26:02,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 169 states have (on average 1.5266272189349113) internal successors, (258), 215 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:02,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 258 transitions. [2023-02-15 01:26:02,652 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 258 transitions. Word has length 16 [2023-02-15 01:26:02,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:26:02,652 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 258 transitions. [2023-02-15 01:26:02,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:02,652 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 258 transitions. [2023-02-15 01:26:02,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 01:26:02,655 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:26:02,655 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:26:02,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 01:26:02,655 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 01:26:02,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:26:02,656 INFO L85 PathProgramCache]: Analyzing trace with hash -961820477, now seen corresponding path program 1 times [2023-02-15 01:26:02,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:26:02,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894194726] [2023-02-15 01:26:02,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:02,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:26:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 01:26:02,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:26:02,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894194726] [2023-02-15 01:26:02,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894194726] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:26:02,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:26:02,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:26:02,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224097402] [2023-02-15 01:26:02,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:26:02,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:26:02,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:26:02,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:26:02,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:26:02,708 INFO L87 Difference]: Start difference. First operand 216 states and 258 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:02,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:26:02,825 INFO L93 Difference]: Finished difference Result 253 states and 276 transitions. [2023-02-15 01:26:02,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:26:02,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-15 01:26:02,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:26:02,827 INFO L225 Difference]: With dead ends: 253 [2023-02-15 01:26:02,827 INFO L226 Difference]: Without dead ends: 253 [2023-02-15 01:26:02,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:26:02,828 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 297 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:26:02,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 202 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:26:02,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-02-15 01:26:02,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 214. [2023-02-15 01:26:02,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 168 states have (on average 1.5119047619047619) internal successors, (254), 213 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:02,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 254 transitions. [2023-02-15 01:26:02,833 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 254 transitions. Word has length 25 [2023-02-15 01:26:02,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:26:02,834 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 254 transitions. [2023-02-15 01:26:02,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:02,834 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 254 transitions. [2023-02-15 01:26:02,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 01:26:02,834 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:26:02,835 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:26:02,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 01:26:02,835 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 01:26:02,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:26:02,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1496912174, now seen corresponding path program 1 times [2023-02-15 01:26:02,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:26:02,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37718607] [2023-02-15 01:26:02,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:02,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:26:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:03,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:26:03,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:26:03,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37718607] [2023-02-15 01:26:03,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37718607] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:26:03,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680972212] [2023-02-15 01:26:03,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:03,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:26:03,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:26:03,236 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:26:03,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 01:26:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:03,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 01:26:03,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:26:03,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:26:03,443 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:26:03,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:26:03,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:26:03,547 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:26:03,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-02-15 01:26:03,622 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:26:03,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2023-02-15 01:26:03,688 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:26:03,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-15 01:26:03,827 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:26:03,829 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:26:03,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2023-02-15 01:26:03,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:26:03,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:26:04,040 INFO L321 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2023-02-15 01:26:04,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 01:26:04,201 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_334 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_334))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) .cse1))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_71|)))) is different from false [2023-02-15 01:26:04,213 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_334 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_71|)) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_334))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)))))) is different from false [2023-02-15 01:26:04,231 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:26:04,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 36 [2023-02-15 01:26:04,241 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:26:04,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 137 [2023-02-15 01:26:04,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2023-02-15 01:26:04,255 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:26:04,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 102 [2023-02-15 01:26:04,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:26:04,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680972212] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:26:04,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:26:04,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2023-02-15 01:26:04,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855748061] [2023-02-15 01:26:04,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:26:04,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 01:26:04,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:26:04,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 01:26:04,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=947, Unknown=10, NotChecked=126, Total=1190 [2023-02-15 01:26:04,665 INFO L87 Difference]: Start difference. First operand 214 states and 254 transitions. Second operand has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:06,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:26:06,596 INFO L93 Difference]: Finished difference Result 427 states and 484 transitions. [2023-02-15 01:26:06,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 01:26:06,598 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-15 01:26:06,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:26:06,599 INFO L225 Difference]: With dead ends: 427 [2023-02-15 01:26:06,599 INFO L226 Difference]: Without dead ends: 427 [2023-02-15 01:26:06,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=402, Invalid=2146, Unknown=10, NotChecked=198, Total=2756 [2023-02-15 01:26:06,601 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 998 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 2729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 675 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:26:06,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 1491 Invalid, 2729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1957 Invalid, 0 Unknown, 675 Unchecked, 1.1s Time] [2023-02-15 01:26:06,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2023-02-15 01:26:06,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 239. [2023-02-15 01:26:06,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 193 states have (on average 1.471502590673575) internal successors, (284), 238 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:06,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 284 transitions. [2023-02-15 01:26:06,608 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 284 transitions. Word has length 31 [2023-02-15 01:26:06,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:26:06,609 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 284 transitions. [2023-02-15 01:26:06,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:06,609 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 284 transitions. [2023-02-15 01:26:06,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 01:26:06,612 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:26:06,612 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:26:06,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 01:26:06,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-15 01:26:06,819 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 01:26:06,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:26:06,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1496912173, now seen corresponding path program 1 times [2023-02-15 01:26:06,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:26:06,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253736767] [2023-02-15 01:26:06,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:06,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:26:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:26:07,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:26:07,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253736767] [2023-02-15 01:26:07,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253736767] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:26:07,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226018893] [2023-02-15 01:26:07,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:07,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:26:07,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:26:07,337 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:26:07,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 01:26:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:07,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-15 01:26:07,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:26:07,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:26:07,527 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:26:07,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:26:07,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:26:07,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:26:07,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:26:07,668 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:26:07,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-15 01:26:07,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 01:26:07,768 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:26:07,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-15 01:26:07,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:26:07,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:26:07,819 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:26:07,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-15 01:26:07,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 01:26:07,979 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:26:07,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:26:07,985 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:26:07,987 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:26:07,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2023-02-15 01:26:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:26:08,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:26:08,731 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int) (v_ArrVal_440 (Array Int Int))) (or (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_435))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_436) .cse1 v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_440) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_436) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_435) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))))) is different from false [2023-02-15 01:26:08,762 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:26:08,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2023-02-15 01:26:08,767 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:26:08,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-02-15 01:26:08,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2023-02-15 01:26:08,787 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:26:08,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 181 [2023-02-15 01:26:08,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 156 [2023-02-15 01:26:08,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 126 [2023-02-15 01:26:08,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2023-02-15 01:26:08,932 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:26:08,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2023-02-15 01:26:08,939 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:26:08,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2023-02-15 01:26:08,944 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:26:08,945 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:26:08,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:26:08,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:26:08,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2023-02-15 01:26:08,951 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:26:08,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:26:08,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:26:08,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2023-02-15 01:26:08,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2023-02-15 01:26:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:26:09,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226018893] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:26:09,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:26:09,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2023-02-15 01:26:09,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971635938] [2023-02-15 01:26:09,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:26:09,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-15 01:26:09,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:26:09,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-15 01:26:09,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1052, Unknown=18, NotChecked=66, Total=1260 [2023-02-15 01:26:09,237 INFO L87 Difference]: Start difference. First operand 239 states and 284 transitions. Second operand has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:17,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:26:17,373 INFO L93 Difference]: Finished difference Result 418 states and 475 transitions. [2023-02-15 01:26:17,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 01:26:17,374 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-15 01:26:17,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:26:17,375 INFO L225 Difference]: With dead ends: 418 [2023-02-15 01:26:17,375 INFO L226 Difference]: Without dead ends: 418 [2023-02-15 01:26:17,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=426, Invalid=2316, Unknown=18, NotChecked=102, Total=2862 [2023-02-15 01:26:17,377 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 1599 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 1991 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 2342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 244 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-02-15 01:26:17,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1599 Valid, 1233 Invalid, 2342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1991 Invalid, 0 Unknown, 244 Unchecked, 2.6s Time] [2023-02-15 01:26:17,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2023-02-15 01:26:17,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 239. [2023-02-15 01:26:17,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 193 states have (on average 1.4663212435233162) internal successors, (283), 238 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:17,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 283 transitions. [2023-02-15 01:26:17,383 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 283 transitions. Word has length 31 [2023-02-15 01:26:17,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:26:17,383 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 283 transitions. [2023-02-15 01:26:17,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:17,383 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 283 transitions. [2023-02-15 01:26:17,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 01:26:17,387 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:26:17,387 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:26:17,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 01:26:17,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-15 01:26:17,593 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 01:26:17,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:26:17,594 INFO L85 PathProgramCache]: Analyzing trace with hash 290187840, now seen corresponding path program 1 times [2023-02-15 01:26:17,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:26:17,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596347539] [2023-02-15 01:26:17,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:17,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:26:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:17,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 01:26:17,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:26:17,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596347539] [2023-02-15 01:26:17,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596347539] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:26:17,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:26:17,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:26:17,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081759739] [2023-02-15 01:26:17,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:26:17,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:26:17,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:26:17,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:26:17,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:26:17,642 INFO L87 Difference]: Start difference. First operand 239 states and 283 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:17,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:26:17,658 INFO L93 Difference]: Finished difference Result 241 states and 285 transitions. [2023-02-15 01:26:17,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:26:17,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-15 01:26:17,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:26:17,659 INFO L225 Difference]: With dead ends: 241 [2023-02-15 01:26:17,660 INFO L226 Difference]: Without dead ends: 241 [2023-02-15 01:26:17,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:26:17,661 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:26:17,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:26:17,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-02-15 01:26:17,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2023-02-15 01:26:17,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 195 states have (on average 1.4615384615384615) internal successors, (285), 240 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:17,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 285 transitions. [2023-02-15 01:26:17,666 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 285 transitions. Word has length 33 [2023-02-15 01:26:17,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:26:17,667 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 285 transitions. [2023-02-15 01:26:17,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:17,667 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 285 transitions. [2023-02-15 01:26:17,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 01:26:17,669 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:26:17,669 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:26:17,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 01:26:17,670 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 01:26:17,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:26:17,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2033494590, now seen corresponding path program 1 times [2023-02-15 01:26:17,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:26:17,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713233797] [2023-02-15 01:26:17,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:17,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:26:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:17,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 01:26:17,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:26:17,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713233797] [2023-02-15 01:26:17,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713233797] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:26:17,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:26:17,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 01:26:17,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109249604] [2023-02-15 01:26:17,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:26:17,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:26:17,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:26:17,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:26:17,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:26:17,860 INFO L87 Difference]: Start difference. First operand 241 states and 285 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:18,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:26:18,294 INFO L93 Difference]: Finished difference Result 258 states and 304 transitions. [2023-02-15 01:26:18,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 01:26:18,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-15 01:26:18,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:26:18,295 INFO L225 Difference]: With dead ends: 258 [2023-02-15 01:26:18,295 INFO L226 Difference]: Without dead ends: 258 [2023-02-15 01:26:18,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:26:18,296 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 50 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:26:18,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 554 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 01:26:18,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-02-15 01:26:18,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 249. [2023-02-15 01:26:18,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 203 states have (on average 1.4482758620689655) internal successors, (294), 248 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 294 transitions. [2023-02-15 01:26:18,301 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 294 transitions. Word has length 36 [2023-02-15 01:26:18,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:26:18,301 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 294 transitions. [2023-02-15 01:26:18,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:18,301 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 294 transitions. [2023-02-15 01:26:18,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 01:26:18,302 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:26:18,302 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:26:18,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 01:26:18,302 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 01:26:18,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:26:18,302 INFO L85 PathProgramCache]: Analyzing trace with hash 2033554172, now seen corresponding path program 1 times [2023-02-15 01:26:18,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:26:18,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558744902] [2023-02-15 01:26:18,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:18,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:26:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:18,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 01:26:18,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:26:18,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558744902] [2023-02-15 01:26:18,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558744902] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:26:18,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:26:18,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:26:18,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106551643] [2023-02-15 01:26:18,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:26:18,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:26:18,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:26:18,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:26:18,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:26:18,368 INFO L87 Difference]: Start difference. First operand 249 states and 294 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:18,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:26:18,467 INFO L93 Difference]: Finished difference Result 246 states and 286 transitions. [2023-02-15 01:26:18,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:26:18,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-15 01:26:18,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:26:18,469 INFO L225 Difference]: With dead ends: 246 [2023-02-15 01:26:18,469 INFO L226 Difference]: Without dead ends: 246 [2023-02-15 01:26:18,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:26:18,470 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 78 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:26:18,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 170 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:26:18,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-02-15 01:26:18,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2023-02-15 01:26:18,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 203 states have (on average 1.4088669950738917) internal successors, (286), 244 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 286 transitions. [2023-02-15 01:26:18,476 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 286 transitions. Word has length 36 [2023-02-15 01:26:18,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:26:18,477 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 286 transitions. [2023-02-15 01:26:18,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:18,478 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 286 transitions. [2023-02-15 01:26:18,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 01:26:18,478 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:26:18,479 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:26:18,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 01:26:18,479 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 01:26:18,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:26:18,480 INFO L85 PathProgramCache]: Analyzing trace with hash 2033554173, now seen corresponding path program 1 times [2023-02-15 01:26:18,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:26:18,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351589862] [2023-02-15 01:26:18,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:18,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:26:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:18,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 01:26:18,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:26:18,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351589862] [2023-02-15 01:26:18,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351589862] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:26:18,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:26:18,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:26:18,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586454580] [2023-02-15 01:26:18,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:26:18,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:26:18,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:26:18,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:26:18,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:26:18,591 INFO L87 Difference]: Start difference. First operand 245 states and 286 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:18,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:26:18,738 INFO L93 Difference]: Finished difference Result 241 states and 278 transitions. [2023-02-15 01:26:18,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:26:18,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-15 01:26:18,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:26:18,740 INFO L225 Difference]: With dead ends: 241 [2023-02-15 01:26:18,740 INFO L226 Difference]: Without dead ends: 241 [2023-02-15 01:26:18,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:26:18,740 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 82 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:26:18,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 148 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:26:18,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-02-15 01:26:18,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2023-02-15 01:26:18,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 203 states have (on average 1.3694581280788178) internal successors, (278), 240 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 278 transitions. [2023-02-15 01:26:18,745 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 278 transitions. Word has length 36 [2023-02-15 01:26:18,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:26:18,745 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 278 transitions. [2023-02-15 01:26:18,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:18,745 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 278 transitions. [2023-02-15 01:26:18,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 01:26:18,746 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:26:18,746 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:26:18,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 01:26:18,746 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 01:26:18,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:26:18,746 INFO L85 PathProgramCache]: Analyzing trace with hash 817273180, now seen corresponding path program 1 times [2023-02-15 01:26:18,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:26:18,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316939631] [2023-02-15 01:26:18,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:18,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:26:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:18,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 01:26:18,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:26:18,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316939631] [2023-02-15 01:26:18,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316939631] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:26:18,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:26:18,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:26:18,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592086387] [2023-02-15 01:26:18,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:26:18,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:26:18,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:26:18,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:26:18,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:26:18,852 INFO L87 Difference]: Start difference. First operand 241 states and 278 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:19,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:26:19,549 INFO L93 Difference]: Finished difference Result 261 states and 299 transitions. [2023-02-15 01:26:19,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:26:19,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-15 01:26:19,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:26:19,550 INFO L225 Difference]: With dead ends: 261 [2023-02-15 01:26:19,550 INFO L226 Difference]: Without dead ends: 261 [2023-02-15 01:26:19,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 01:26:19,551 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 114 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 01:26:19,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 335 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 01:26:19,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-02-15 01:26:19,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 240. [2023-02-15 01:26:19,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 203 states have (on average 1.3645320197044335) internal successors, (277), 239 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 277 transitions. [2023-02-15 01:26:19,555 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 277 transitions. Word has length 36 [2023-02-15 01:26:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:26:19,555 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 277 transitions. [2023-02-15 01:26:19,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 277 transitions. [2023-02-15 01:26:19,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 01:26:19,557 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:26:19,557 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:26:19,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 01:26:19,557 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 01:26:19,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:26:19,558 INFO L85 PathProgramCache]: Analyzing trace with hash 817273181, now seen corresponding path program 1 times [2023-02-15 01:26:19,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:26:19,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798356135] [2023-02-15 01:26:19,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:19,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:26:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:26:20,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:26:20,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798356135] [2023-02-15 01:26:20,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798356135] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:26:20,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926460811] [2023-02-15 01:26:20,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:20,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:26:20,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:26:20,425 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:26:20,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 01:26:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:20,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-15 01:26:20,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:26:20,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:26:20,717 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:26:20,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:26:20,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:26:20,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:26:21,009 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:26:21,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-02-15 01:26:21,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 01:26:21,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-15 01:26:21,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:26:21,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:26:21,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-02-15 01:26:21,595 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:26:21,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:26:21,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 17 [2023-02-15 01:26:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:26:21,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:26:21,891 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:26:21,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2023-02-15 01:26:22,960 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:26:22,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2023-02-15 01:26:22,975 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:26:22,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-15 01:26:22,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2023-02-15 01:26:23,010 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:26:23,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 161 [2023-02-15 01:26:23,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 136 [2023-02-15 01:26:23,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2023-02-15 01:26:23,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 98 [2023-02-15 01:26:23,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:26:23,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926460811] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:26:23,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 01:26:23,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 44 [2023-02-15 01:26:23,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885648940] [2023-02-15 01:26:23,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 01:26:23,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-15 01:26:23,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:26:23,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-15 01:26:23,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1774, Unknown=18, NotChecked=0, Total=1980 [2023-02-15 01:26:23,654 INFO L87 Difference]: Start difference. First operand 240 states and 277 transitions. Second operand has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 45 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:26:31,661 INFO L93 Difference]: Finished difference Result 558 states and 630 transitions. [2023-02-15 01:26:31,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-02-15 01:26:31,662 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 45 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-15 01:26:31,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:26:31,664 INFO L225 Difference]: With dead ends: 558 [2023-02-15 01:26:31,664 INFO L226 Difference]: Without dead ends: 558 [2023-02-15 01:26:31,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3378 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1658, Invalid=9234, Unknown=28, NotChecked=0, Total=10920 [2023-02-15 01:26:31,667 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 2169 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 2596 mSolverCounterSat, 210 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2169 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 2809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 2596 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:26:31,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2169 Valid, 1968 Invalid, 2809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 2596 Invalid, 3 Unknown, 0 Unchecked, 3.3s Time] [2023-02-15 01:26:31,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2023-02-15 01:26:31,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 269. [2023-02-15 01:26:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 239 states have (on average 1.301255230125523) internal successors, (311), 268 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:31,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 311 transitions. [2023-02-15 01:26:31,673 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 311 transitions. Word has length 36 [2023-02-15 01:26:31,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:26:31,673 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 311 transitions. [2023-02-15 01:26:31,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 45 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:31,673 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 311 transitions. [2023-02-15 01:26:31,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 01:26:31,673 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:26:31,674 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:26:31,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 01:26:31,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-15 01:26:31,874 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 01:26:31,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:26:31,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1419322487, now seen corresponding path program 1 times [2023-02-15 01:26:31,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:26:31,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658574287] [2023-02-15 01:26:31,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:31,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:26:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 01:26:31,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:26:31,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658574287] [2023-02-15 01:26:31,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658574287] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:26:31,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:26:31,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:26:31,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600889143] [2023-02-15 01:26:31,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:26:31,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:26:31,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:26:31,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:26:31,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:26:31,998 INFO L87 Difference]: Start difference. First operand 269 states and 311 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:32,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:26:32,408 INFO L93 Difference]: Finished difference Result 289 states and 332 transitions. [2023-02-15 01:26:32,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:26:32,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-02-15 01:26:32,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:26:32,409 INFO L225 Difference]: With dead ends: 289 [2023-02-15 01:26:32,409 INFO L226 Difference]: Without dead ends: 289 [2023-02-15 01:26:32,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 01:26:32,410 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 101 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:26:32,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 334 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 01:26:32,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-02-15 01:26:32,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 275. [2023-02-15 01:26:32,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 245 states have (on average 1.3061224489795917) internal successors, (320), 274 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:32,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 320 transitions. [2023-02-15 01:26:32,421 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 320 transitions. Word has length 40 [2023-02-15 01:26:32,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:26:32,421 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 320 transitions. [2023-02-15 01:26:32,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:32,421 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 320 transitions. [2023-02-15 01:26:32,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 01:26:32,422 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:26:32,422 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:26:32,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-15 01:26:32,422 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 01:26:32,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:26:32,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1419322486, now seen corresponding path program 1 times [2023-02-15 01:26:32,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:26:32,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441002098] [2023-02-15 01:26:32,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:32,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:26:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:26:33,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:26:33,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441002098] [2023-02-15 01:26:33,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441002098] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:26:33,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971980573] [2023-02-15 01:26:33,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:33,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:26:33,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:26:33,175 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:26:33,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 01:26:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:33,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 01:26:33,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:26:33,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-02-15 01:26:33,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-02-15 01:26:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 01:26:33,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:26:33,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971980573] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:26:33,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 01:26:33,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2023-02-15 01:26:33,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37610944] [2023-02-15 01:26:33,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:26:33,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:26:33,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:26:33,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:26:33,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2023-02-15 01:26:33,557 INFO L87 Difference]: Start difference. First operand 275 states and 320 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:34,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:26:34,061 INFO L93 Difference]: Finished difference Result 284 states and 327 transitions. [2023-02-15 01:26:34,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:26:34,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-02-15 01:26:34,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:26:34,063 INFO L225 Difference]: With dead ends: 284 [2023-02-15 01:26:34,063 INFO L226 Difference]: Without dead ends: 284 [2023-02-15 01:26:34,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2023-02-15 01:26:34,064 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 53 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:26:34,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 412 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 01:26:34,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-02-15 01:26:34,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 273. [2023-02-15 01:26:34,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 245 states have (on average 1.2857142857142858) internal successors, (315), 272 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 315 transitions. [2023-02-15 01:26:34,068 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 315 transitions. Word has length 40 [2023-02-15 01:26:34,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:26:34,068 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 315 transitions. [2023-02-15 01:26:34,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:26:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 315 transitions. [2023-02-15 01:26:34,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 01:26:34,069 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:26:34,070 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:26:34,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 01:26:34,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:26:34,276 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-02-15 01:26:34,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:26:34,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1458488866, now seen corresponding path program 1 times [2023-02-15 01:26:34,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:26:34,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981431621] [2023-02-15 01:26:34,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:34,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:26:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:35,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:26:35,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:26:35,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981431621] [2023-02-15 01:26:35,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981431621] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:26:35,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812530160] [2023-02-15 01:26:35,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:35,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:26:35,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:26:35,271 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:26:35,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 01:26:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:35,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-15 01:26:35,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:26:35,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:26:35,650 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:26:35,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:26:35,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:26:35,946 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:26:35,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-02-15 01:26:36,129 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 01:26:36,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2023-02-15 01:26:36,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 01:26:36,305 INFO L321 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2023-02-15 01:26:36,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 70 [2023-02-15 01:26:36,332 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-02-15 01:26:36,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 52 [2023-02-15 01:26:37,045 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:26:37,071 INFO L321 Elim1Store]: treesize reduction 81, result has 8.0 percent of original size [2023-02-15 01:26:37,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 45 [2023-02-15 01:26:37,080 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:26:37,090 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 01:26:37,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 16 [2023-02-15 01:26:37,110 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:26:37,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:26:52,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:26:52,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 810 treesize of output 629 [2023-02-15 01:26:59,037 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:26:59,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 6311 treesize of output 4269