./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-sorted-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-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 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:21:38,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:21:38,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:21:38,258 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:21:38,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:21:38,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:21:38,263 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:21:38,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:21:38,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:21:38,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:21:38,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:21:38,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:21:38,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:21:38,277 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:21:38,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:21:38,281 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:21:38,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:21:38,283 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:21:38,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:21:38,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:21:38,289 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:21:38,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:21:38,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:21:38,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:21:38,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:21:38,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:21:38,295 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:21:38,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:21:38,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:21:38,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:21:38,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:21:38,312 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:21:38,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:21:38,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:21:38,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:21:38,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:21:38,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:21:38,314 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:21:38,315 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:21:38,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:21:38,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:21:38,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:21:38,316 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 06:21:38,333 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:21:38,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:21:38,338 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:21:38,338 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:21:38,339 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:21:38,339 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:21:38,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:21:38,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:21:38,340 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:21:38,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:21:38,341 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:21:38,341 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:21:38,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:21:38,341 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:21:38,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:21:38,341 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:21:38,342 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:21:38,342 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:21:38,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:21:38,342 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:21:38,343 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:21:38,344 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:21:38,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:21:38,344 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:21:38,344 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:21:38,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:21:38,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:21:38,345 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:21:38,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 06:21:38,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 06:21:38,345 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f [2022-07-23 06:21:38,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:21:38,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:21:38,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:21:38,590 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:21:38,591 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:21:38,592 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-sorted-2.i [2022-07-23 06:21:38,636 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f14b8d1/088bfb8cd604475fabd8fe8121c23eae/FLAG66217b1d2 [2022-07-23 06:21:39,110 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:21:39,111 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i [2022-07-23 06:21:39,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f14b8d1/088bfb8cd604475fabd8fe8121c23eae/FLAG66217b1d2 [2022-07-23 06:21:39,132 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f14b8d1/088bfb8cd604475fabd8fe8121c23eae [2022-07-23 06:21:39,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:21:39,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:21:39,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:21:39,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:21:39,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:21:39,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:21:39" (1/1) ... [2022-07-23 06:21:39,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fb4a477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:21:39, skipping insertion in model container [2022-07-23 06:21:39,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:21:39" (1/1) ... [2022-07-23 06:21:39,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:21:39,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:21:39,410 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22317,22330] [2022-07-23 06:21:39,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22452,22465] [2022-07-23 06:21:39,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22612,22625] [2022-07-23 06:21:39,416 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22941,22954] [2022-07-23 06:21:39,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[23005,23018] [2022-07-23 06:21:39,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[23136,23149] [2022-07-23 06:21:39,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[23200,23213] [2022-07-23 06:21:39,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:21:39,440 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:21:39,463 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22317,22330] [2022-07-23 06:21:39,471 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22452,22465] [2022-07-23 06:21:39,480 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22612,22625] [2022-07-23 06:21:39,483 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22941,22954] [2022-07-23 06:21:39,483 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[23005,23018] [2022-07-23 06:21:39,484 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[23136,23149] [2022-07-23 06:21:39,484 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[23200,23213] [2022-07-23 06:21:39,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:21:39,502 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:21:39,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:21:39 WrapperNode [2022-07-23 06:21:39,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:21:39,504 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:21:39,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:21:39,504 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:21:39,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:21:39" (1/1) ... [2022-07-23 06:21:39,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:21:39" (1/1) ... [2022-07-23 06:21:39,559 INFO L137 Inliner]: procedures = 119, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 199 [2022-07-23 06:21:39,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:21:39,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:21:39,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:21:39,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:21:39,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:21:39" (1/1) ... [2022-07-23 06:21:39,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:21:39" (1/1) ... [2022-07-23 06:21:39,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:21:39" (1/1) ... [2022-07-23 06:21:39,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:21:39" (1/1) ... [2022-07-23 06:21:39,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:21:39" (1/1) ... [2022-07-23 06:21:39,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:21:39" (1/1) ... [2022-07-23 06:21:39,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:21:39" (1/1) ... [2022-07-23 06:21:39,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:21:39,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:21:39,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:21:39,607 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:21:39,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:21:39" (1/1) ... [2022-07-23 06:21:39,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:21:39,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:21:39,639 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-23 06:21:39,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-23 06:21:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 06:21:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 06:21:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:21:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 06:21:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:21:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:21:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:21:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 06:21:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:21:39,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:21:39,748 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:21:39,749 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:21:40,118 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:21:40,124 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:21:40,124 INFO L299 CfgBuilder]: Removed 20 assume(true) statements. [2022-07-23 06:21:40,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:21:40 BoogieIcfgContainer [2022-07-23 06:21:40,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:21:40,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:21:40,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:21:40,130 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:21:40,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:21:39" (1/3) ... [2022-07-23 06:21:40,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465fefcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:21:40, skipping insertion in model container [2022-07-23 06:21:40,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:21:39" (2/3) ... [2022-07-23 06:21:40,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465fefcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:21:40, skipping insertion in model container [2022-07-23 06:21:40,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:21:40" (3/3) ... [2022-07-23 06:21:40,133 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-sorted-2.i [2022-07-23 06:21:40,143 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:21:40,143 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2022-07-23 06:21:40,175 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:21:40,179 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@60a2fa48, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6f302a10 [2022-07-23 06:21:40,180 INFO L358 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2022-07-23 06:21:40,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 166 states, 94 states have (on average 2.1702127659574466) internal successors, (204), 165 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 06:21:40,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:21:40,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 06:21:40,214 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:21:40,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:21:40,217 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-23 06:21:40,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:21:40,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426069573] [2022-07-23 06:21:40,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:40,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:21:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:40,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:21:40,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426069573] [2022-07-23 06:21:40,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426069573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:21:40,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:21:40,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:21:40,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818230093] [2022-07-23 06:21:40,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:21:40,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:21:40,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:21:40,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:21:40,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:21:40,370 INFO L87 Difference]: Start difference. First operand has 166 states, 94 states have (on average 2.1702127659574466) internal successors, (204), 165 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:40,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:21:40,511 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2022-07-23 06:21:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:21:40,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-23 06:21:40,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:21:40,521 INFO L225 Difference]: With dead ends: 170 [2022-07-23 06:21:40,522 INFO L226 Difference]: Without dead ends: 166 [2022-07-23 06:21:40,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:21:40,526 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:21:40,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 116 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:21:40,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-23 06:21:40,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2022-07-23 06:21:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 93 states have (on average 1.8602150537634408) internal successors, (173), 161 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:40,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2022-07-23 06:21:40,569 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 3 [2022-07-23 06:21:40,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:21:40,570 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2022-07-23 06:21:40,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:40,570 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2022-07-23 06:21:40,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 06:21:40,571 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:21:40,571 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 06:21:40,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 06:21:40,571 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:21:40,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:21:40,573 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-23 06:21:40,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:21:40,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657400941] [2022-07-23 06:21:40,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:40,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:21:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:40,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:40,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:21:40,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657400941] [2022-07-23 06:21:40,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657400941] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:21:40,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:21:40,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:21:40,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175946840] [2022-07-23 06:21:40,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:21:40,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:21:40,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:21:40,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:21:40,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:21:40,647 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:40,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:21:40,754 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2022-07-23 06:21:40,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:21:40,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-23 06:21:40,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:21:40,758 INFO L225 Difference]: With dead ends: 164 [2022-07-23 06:21:40,758 INFO L226 Difference]: Without dead ends: 164 [2022-07-23 06:21:40,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:21:40,761 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 156 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:21:40,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 114 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:21:40,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-23 06:21:40,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2022-07-23 06:21:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 93 states have (on average 1.8387096774193548) internal successors, (171), 159 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:40,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2022-07-23 06:21:40,778 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 3 [2022-07-23 06:21:40,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:21:40,781 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2022-07-23 06:21:40,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:40,781 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2022-07-23 06:21:40,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-23 06:21:40,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:21:40,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:21:40,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 06:21:40,782 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:21:40,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:21:40,783 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2022-07-23 06:21:40,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:21:40,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405848051] [2022-07-23 06:21:40,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:40,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:21:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:40,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:21:40,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405848051] [2022-07-23 06:21:40,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405848051] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:21:40,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:21:40,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:21:40,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660738485] [2022-07-23 06:21:40,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:21:40,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:21:40,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:21:40,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:21:40,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:21:40,871 INFO L87 Difference]: Start difference. First operand 160 states and 171 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:41,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:21:41,019 INFO L93 Difference]: Finished difference Result 168 states and 182 transitions. [2022-07-23 06:21:41,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:21:41,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-23 06:21:41,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:21:41,021 INFO L225 Difference]: With dead ends: 168 [2022-07-23 06:21:41,021 INFO L226 Difference]: Without dead ends: 168 [2022-07-23 06:21:41,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:21:41,023 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 276 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:21:41,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 88 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:21:41,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-23 06:21:41,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 157. [2022-07-23 06:21:41,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 107 states have (on average 1.6728971962616823) internal successors, (179), 156 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 179 transitions. [2022-07-23 06:21:41,035 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 179 transitions. Word has length 8 [2022-07-23 06:21:41,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:21:41,035 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 179 transitions. [2022-07-23 06:21:41,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 179 transitions. [2022-07-23 06:21:41,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-23 06:21:41,036 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:21:41,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:21:41,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 06:21:41,036 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:21:41,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:21:41,037 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2022-07-23 06:21:41,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:21:41,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418296421] [2022-07-23 06:21:41,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:41,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:21:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:41,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:41,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:21:41,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418296421] [2022-07-23 06:21:41,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418296421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:21:41,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:21:41,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:21:41,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975004630] [2022-07-23 06:21:41,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:21:41,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:21:41,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:21:41,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:21:41,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:21:41,125 INFO L87 Difference]: Start difference. First operand 157 states and 179 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:21:41,291 INFO L93 Difference]: Finished difference Result 240 states and 264 transitions. [2022-07-23 06:21:41,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:21:41,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-23 06:21:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:21:41,292 INFO L225 Difference]: With dead ends: 240 [2022-07-23 06:21:41,292 INFO L226 Difference]: Without dead ends: 240 [2022-07-23 06:21:41,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:21:41,296 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 315 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:21:41,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 146 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:21:41,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-07-23 06:21:41,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 206. [2022-07-23 06:21:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 156 states have (on average 1.5705128205128205) internal successors, (245), 205 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 245 transitions. [2022-07-23 06:21:41,314 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 245 transitions. Word has length 8 [2022-07-23 06:21:41,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:21:41,314 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 245 transitions. [2022-07-23 06:21:41,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:41,314 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 245 transitions. [2022-07-23 06:21:41,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 06:21:41,315 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:21:41,315 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:21:41,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 06:21:41,316 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:21:41,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:21:41,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1117776432, now seen corresponding path program 1 times [2022-07-23 06:21:41,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:21:41,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113913020] [2022-07-23 06:21:41,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:41,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:21:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:41,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:41,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:21:41,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113913020] [2022-07-23 06:21:41,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113913020] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:21:41,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:21:41,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:21:41,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343654422] [2022-07-23 06:21:41,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:21:41,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:21:41,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:21:41,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:21:41,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:21:41,355 INFO L87 Difference]: Start difference. First operand 206 states and 245 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:41,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:21:41,368 INFO L93 Difference]: Finished difference Result 246 states and 288 transitions. [2022-07-23 06:21:41,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:21:41,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-23 06:21:41,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:21:41,372 INFO L225 Difference]: With dead ends: 246 [2022-07-23 06:21:41,372 INFO L226 Difference]: Without dead ends: 246 [2022-07-23 06:21:41,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:21:41,373 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 111 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:21:41,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 217 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:21:41,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-07-23 06:21:41,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 216. [2022-07-23 06:21:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 166 states have (on average 1.5602409638554218) internal successors, (259), 215 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:41,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 259 transitions. [2022-07-23 06:21:41,379 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 259 transitions. Word has length 10 [2022-07-23 06:21:41,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:21:41,380 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 259 transitions. [2022-07-23 06:21:41,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:41,380 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 259 transitions. [2022-07-23 06:21:41,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 06:21:41,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:21:41,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:21:41,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 06:21:41,381 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:21:41,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:21:41,381 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2022-07-23 06:21:41,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:21:41,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383407726] [2022-07-23 06:21:41,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:41,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:21:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:41,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:21:41,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383407726] [2022-07-23 06:21:41,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383407726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:21:41,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:21:41,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:21:41,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089011483] [2022-07-23 06:21:41,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:21:41,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:21:41,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:21:41,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:21:41,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:21:41,443 INFO L87 Difference]: Start difference. First operand 216 states and 259 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:41,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:21:41,624 INFO L93 Difference]: Finished difference Result 222 states and 264 transitions. [2022-07-23 06:21:41,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:21:41,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-23 06:21:41,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:21:41,625 INFO L225 Difference]: With dead ends: 222 [2022-07-23 06:21:41,625 INFO L226 Difference]: Without dead ends: 222 [2022-07-23 06:21:41,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:21:41,626 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 106 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:21:41,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 372 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:21:41,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-07-23 06:21:41,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 215. [2022-07-23 06:21:41,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 166 states have (on average 1.5481927710843373) internal successors, (257), 214 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 257 transitions. [2022-07-23 06:21:41,630 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 257 transitions. Word has length 12 [2022-07-23 06:21:41,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:21:41,630 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 257 transitions. [2022-07-23 06:21:41,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:41,630 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 257 transitions. [2022-07-23 06:21:41,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 06:21:41,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:21:41,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:21:41,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 06:21:41,631 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:21:41,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:21:41,631 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2022-07-23 06:21:41,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:21:41,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798246757] [2022-07-23 06:21:41,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:41,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:21:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:41,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:41,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:21:41,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798246757] [2022-07-23 06:21:41,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798246757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:21:41,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:21:41,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:21:41,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522664343] [2022-07-23 06:21:41,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:21:41,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:21:41,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:21:41,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:21:41,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:21:41,683 INFO L87 Difference]: Start difference. First operand 215 states and 257 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:41,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:21:41,873 INFO L93 Difference]: Finished difference Result 211 states and 250 transitions. [2022-07-23 06:21:41,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 06:21:41,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-23 06:21:41,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:21:41,875 INFO L225 Difference]: With dead ends: 211 [2022-07-23 06:21:41,875 INFO L226 Difference]: Without dead ends: 211 [2022-07-23 06:21:41,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:21:41,875 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 15 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:21:41,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 456 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:21:41,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-23 06:21:41,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 205. [2022-07-23 06:21:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 161 states have (on average 1.515527950310559) internal successors, (244), 204 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:41,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 244 transitions. [2022-07-23 06:21:41,878 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 244 transitions. Word has length 12 [2022-07-23 06:21:41,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:21:41,878 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 244 transitions. [2022-07-23 06:21:41,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:41,878 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 244 transitions. [2022-07-23 06:21:41,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-23 06:21:41,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:21:41,879 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:21:41,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 06:21:41,879 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:21:41,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:21:41,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1270421215, now seen corresponding path program 1 times [2022-07-23 06:21:41,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:21:41,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005311577] [2022-07-23 06:21:41,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:41,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:21:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:41,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:21:41,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:21:41,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005311577] [2022-07-23 06:21:41,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005311577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:21:41,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:21:41,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:21:41,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130526027] [2022-07-23 06:21:41,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:21:41,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:21:41,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:21:41,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:21:41,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:21:41,914 INFO L87 Difference]: Start difference. First operand 205 states and 244 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:42,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:21:42,043 INFO L93 Difference]: Finished difference Result 237 states and 260 transitions. [2022-07-23 06:21:42,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:21:42,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-23 06:21:42,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:21:42,045 INFO L225 Difference]: With dead ends: 237 [2022-07-23 06:21:42,045 INFO L226 Difference]: Without dead ends: 237 [2022-07-23 06:21:42,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:21:42,046 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 283 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:21:42,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 196 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:21:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-07-23 06:21:42,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 203. [2022-07-23 06:21:42,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 160 states have (on average 1.5) internal successors, (240), 202 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 240 transitions. [2022-07-23 06:21:42,049 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 240 transitions. Word has length 21 [2022-07-23 06:21:42,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:21:42,049 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 240 transitions. [2022-07-23 06:21:42,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:42,050 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 240 transitions. [2022-07-23 06:21:42,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 06:21:42,050 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:21:42,050 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:21:42,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 06:21:42,051 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:21:42,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:21:42,051 INFO L85 PathProgramCache]: Analyzing trace with hash -697189136, now seen corresponding path program 1 times [2022-07-23 06:21:42,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:21:42,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361879688] [2022-07-23 06:21:42,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:42,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:21:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:42,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:42,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:21:42,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361879688] [2022-07-23 06:21:42,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361879688] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:21:42,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962034157] [2022-07-23 06:21:42,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:42,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:21:42,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:21:42,196 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:21:42,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-23 06:21:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:42,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-23 06:21:42,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:21:42,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:21:42,365 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:21:42,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 06:21:42,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:21:42,518 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:21:42,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-23 06:21:42,563 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:21:42,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-23 06:21:42,700 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:21:42,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-23 06:21:42,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:42,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:21:42,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:21:42,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-23 06:21:42,971 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:21:42,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-07-23 06:21:42,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-23 06:21:47,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:47,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962034157] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:21:47,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:21:47,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-07-23 06:21:47,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968062727] [2022-07-23 06:21:47,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:21:47,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-23 06:21:47,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:21:47,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-23 06:21:47,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=740, Unknown=7, NotChecked=0, Total=870 [2022-07-23 06:21:47,285 INFO L87 Difference]: Start difference. First operand 203 states and 240 transitions. Second operand has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:48,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:21:48,280 INFO L93 Difference]: Finished difference Result 660 states and 757 transitions. [2022-07-23 06:21:48,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-23 06:21:48,280 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-23 06:21:48,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:21:48,282 INFO L225 Difference]: With dead ends: 660 [2022-07-23 06:21:48,282 INFO L226 Difference]: Without dead ends: 660 [2022-07-23 06:21:48,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=359, Invalid=1704, Unknown=7, NotChecked=0, Total=2070 [2022-07-23 06:21:48,283 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 1340 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1153 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 06:21:48,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 1400 Invalid, 2302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1055 Invalid, 0 Unknown, 1153 Unchecked, 0.6s Time] [2022-07-23 06:21:48,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2022-07-23 06:21:48,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 225. [2022-07-23 06:21:48,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 182 states have (on average 1.467032967032967) internal successors, (267), 224 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:48,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 267 transitions. [2022-07-23 06:21:48,288 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 267 transitions. Word has length 27 [2022-07-23 06:21:48,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:21:48,288 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 267 transitions. [2022-07-23 06:21:48,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:48,289 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 267 transitions. [2022-07-23 06:21:48,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 06:21:48,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:21:48,289 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:21:48,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-23 06:21:48,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:21:48,507 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:21:48,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:21:48,508 INFO L85 PathProgramCache]: Analyzing trace with hash -697189135, now seen corresponding path program 1 times [2022-07-23 06:21:48,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:21:48,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115532190] [2022-07-23 06:21:48,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:48,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:21:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:48,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:48,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:21:48,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115532190] [2022-07-23 06:21:48,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115532190] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:21:48,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428088781] [2022-07-23 06:21:48,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:48,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:21:48,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:21:48,752 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:21:48,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-23 06:21:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:48,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-23 06:21:48,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:21:48,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:21:48,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:21:48,912 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:21:48,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:21:48,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:21:48,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:21:49,047 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:21:49,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-23 06:21:49,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:21:49,064 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:21:49,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-23 06:21:49,110 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:21:49,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-23 06:21:49,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 06:21:49,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:21:49,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:21:49,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:21:49,247 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:21:49,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-07-23 06:21:49,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:49,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:21:49,458 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_279 (Array Int Int))) (or (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) 4)) (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|)))) (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_279 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_71|))))) is different from false [2022-07-23 06:21:49,537 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_279 (Array Int Int))) (or (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) 4)) (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|)))) (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_279 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_71|))))) is different from false [2022-07-23 06:21:49,553 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_279 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_280) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_71|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_279 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) 4)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_71|))))) is different from false [2022-07-23 06:21:49,579 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:21:49,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-07-23 06:21:49,583 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:21:49,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-23 06:21:49,605 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:21:49,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 55 [2022-07-23 06:21:49,620 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:21:49,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 81 [2022-07-23 06:21:49,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-07-23 06:21:49,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2022-07-23 06:21:49,674 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:21:49,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-23 06:21:49,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:21:49,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:21:49,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:21:49,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-23 06:21:49,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:49,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428088781] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:21:49,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:21:49,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-07-23 06:21:49,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939716035] [2022-07-23 06:21:49,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:21:49,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-23 06:21:49,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:21:49,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-23 06:21:49,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=722, Unknown=3, NotChecked=168, Total=992 [2022-07-23 06:21:49,834 INFO L87 Difference]: Start difference. First operand 225 states and 267 transitions. Second operand has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 32 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:51,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:21:51,314 INFO L93 Difference]: Finished difference Result 472 states and 532 transitions. [2022-07-23 06:21:51,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-23 06:21:51,314 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 32 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-23 06:21:51,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:21:51,315 INFO L225 Difference]: With dead ends: 472 [2022-07-23 06:21:51,315 INFO L226 Difference]: Without dead ends: 472 [2022-07-23 06:21:51,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=469, Invalid=2296, Unknown=3, NotChecked=312, Total=3080 [2022-07-23 06:21:51,317 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 1350 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1492 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 06:21:51,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 1197 Invalid, 2789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1201 Invalid, 0 Unknown, 1492 Unchecked, 0.6s Time] [2022-07-23 06:21:51,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-07-23 06:21:51,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 225. [2022-07-23 06:21:51,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 182 states have (on average 1.4615384615384615) internal successors, (266), 224 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:51,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 266 transitions. [2022-07-23 06:21:51,321 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 266 transitions. Word has length 27 [2022-07-23 06:21:51,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:21:51,321 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 266 transitions. [2022-07-23 06:21:51,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 32 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:51,321 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 266 transitions. [2022-07-23 06:21:51,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 06:21:51,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:21:51,322 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:21:51,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-23 06:21:51,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-23 06:21:51,531 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:21:51,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:21:51,532 INFO L85 PathProgramCache]: Analyzing trace with hash 24884122, now seen corresponding path program 1 times [2022-07-23 06:21:51,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:21:51,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999400133] [2022-07-23 06:21:51,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:51,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:21:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:21:51,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:21:51,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999400133] [2022-07-23 06:21:51,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999400133] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:21:51,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:21:51,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:21:51,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037890684] [2022-07-23 06:21:51,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:21:51,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:21:51,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:21:51,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:21:51,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:21:51,558 INFO L87 Difference]: Start difference. First operand 225 states and 266 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:51,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:21:51,564 INFO L93 Difference]: Finished difference Result 227 states and 268 transitions. [2022-07-23 06:21:51,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:21:51,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-23 06:21:51,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:21:51,565 INFO L225 Difference]: With dead ends: 227 [2022-07-23 06:21:51,565 INFO L226 Difference]: Without dead ends: 227 [2022-07-23 06:21:51,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:21:51,565 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:21:51,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:21:51,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-23 06:21:51,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2022-07-23 06:21:51,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 184 states have (on average 1.4565217391304348) internal successors, (268), 226 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:51,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 268 transitions. [2022-07-23 06:21:51,568 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 268 transitions. Word has length 29 [2022-07-23 06:21:51,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:21:51,569 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 268 transitions. [2022-07-23 06:21:51,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:51,569 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 268 transitions. [2022-07-23 06:21:51,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 06:21:51,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:21:51,570 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:21:51,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 06:21:51,570 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:21:51,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:21:51,570 INFO L85 PathProgramCache]: Analyzing trace with hash -197370768, now seen corresponding path program 1 times [2022-07-23 06:21:51,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:21:51,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479105901] [2022-07-23 06:21:51,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:51,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:21:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:51,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:51,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:21:51,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479105901] [2022-07-23 06:21:51,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479105901] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:21:51,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037248333] [2022-07-23 06:21:51,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:51,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:21:51,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:21:51,799 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:21:51,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-23 06:21:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:51,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-23 06:21:51,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:21:51,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:21:51,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:21:51,938 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:21:51,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:21:51,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:21:51,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:21:51,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:21:52,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-23 06:21:52,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 06:21:52,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 06:21:52,180 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:21:52,181 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:21:52,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-07-23 06:21:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:52,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:21:52,286 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_391 (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|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_391) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_75|)) 0))) is different from false [2022-07-23 06:21:52,324 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_391 (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|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_391) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_75|)) 0) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) is different from false [2022-07-23 06:21:52,332 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_391 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_391) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_75|)) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) is different from false [2022-07-23 06:21:52,352 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (v_ArrVal_391 (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|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_389)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_391) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_75|)) 0) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) is different from false [2022-07-23 06:21:52,409 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (v_ArrVal_391 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_12| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_77| Int)) (or (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_77| v_ArrVal_389)) |v_ULTIMATE.start_main_#t~malloc3#1.base_12| v_ArrVal_391) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_75|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_77| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) is different from false [2022-07-23 06:21:52,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:21:52,418 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:21:52,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2022-07-23 06:21:52,426 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:21:52,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 36 [2022-07-23 06:21:52,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:21:52,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:52,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037248333] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:21:52,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:21:52,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 35 [2022-07-23 06:21:52,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218824121] [2022-07-23 06:21:52,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:21:52,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-23 06:21:52,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:21:52,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-23 06:21:52,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=769, Unknown=6, NotChecked=300, Total=1190 [2022-07-23 06:21:52,473 INFO L87 Difference]: Start difference. First operand 227 states and 268 transitions. Second operand has 35 states, 35 states have (on average 2.6) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:52,881 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (or (= |c_ULTIMATE.start_main_~marked~0#1| 0) (and (not .cse0) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~marked~0#1| 1))) (<= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) 4) 0) (<= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_389 Int) (v_ArrVal_391 (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|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_389)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_391) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_75|)) 0) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (<= 0 |c_ULTIMATE.start_main_~x~0#1.offset|) (= |c_ULTIMATE.start_main_#t~malloc3#1.offset| 0))) is different from false [2022-07-23 06:21:54,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:21:54,326 INFO L93 Difference]: Finished difference Result 377 states and 438 transitions. [2022-07-23 06:21:54,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-23 06:21:54,326 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.6) internal successors, (91), 35 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 32 [2022-07-23 06:21:54,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:21:54,328 INFO L225 Difference]: With dead ends: 377 [2022-07-23 06:21:54,328 INFO L226 Difference]: Without dead ends: 377 [2022-07-23 06:21:54,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=474, Invalid=2089, Unknown=11, NotChecked=618, Total=3192 [2022-07-23 06:21:54,329 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 493 mSDsluCounter, 2858 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 3033 SdHoareTripleChecker+Invalid, 2757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1155 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 06:21:54,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 3033 Invalid, 2757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1540 Invalid, 0 Unknown, 1155 Unchecked, 0.7s Time] [2022-07-23 06:21:54,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-23 06:21:54,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 228. [2022-07-23 06:21:54,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 185 states have (on average 1.454054054054054) internal successors, (269), 227 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:54,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 269 transitions. [2022-07-23 06:21:54,332 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 269 transitions. Word has length 32 [2022-07-23 06:21:54,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:21:54,332 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 269 transitions. [2022-07-23 06:21:54,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.6) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 269 transitions. [2022-07-23 06:21:54,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 06:21:54,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:21:54,333 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:21:54,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-23 06:21:54,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:21:54,543 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:21:54,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:21:54,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1640100151, now seen corresponding path program 1 times [2022-07-23 06:21:54,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:21:54,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743684397] [2022-07-23 06:21:54,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:54,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:21:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:21:54,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:21:54,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743684397] [2022-07-23 06:21:54,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743684397] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:21:54,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:21:54,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 06:21:54,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97375082] [2022-07-23 06:21:54,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:21:54,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:21:54,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:21:54,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:21:54,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:21:54,619 INFO L87 Difference]: Start difference. First operand 228 states and 269 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:54,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:21:54,777 INFO L93 Difference]: Finished difference Result 246 states and 289 transitions. [2022-07-23 06:21:54,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:21:54,777 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-23 06:21:54,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:21:54,778 INFO L225 Difference]: With dead ends: 246 [2022-07-23 06:21:54,778 INFO L226 Difference]: Without dead ends: 246 [2022-07-23 06:21:54,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:21:54,779 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 34 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:21:54,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 595 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:21:54,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-07-23 06:21:54,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 237. [2022-07-23 06:21:54,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 194 states have (on average 1.4381443298969072) internal successors, (279), 236 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:54,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 279 transitions. [2022-07-23 06:21:54,781 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 279 transitions. Word has length 32 [2022-07-23 06:21:54,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:21:54,782 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 279 transitions. [2022-07-23 06:21:54,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:54,782 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 279 transitions. [2022-07-23 06:21:54,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 06:21:54,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:21:54,782 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:21:54,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 06:21:54,783 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:21:54,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:21:54,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1640159733, now seen corresponding path program 1 times [2022-07-23 06:21:54,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:21:54,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082949833] [2022-07-23 06:21:54,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:54,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:21:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:54,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:21:54,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:21:54,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082949833] [2022-07-23 06:21:54,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082949833] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:21:54,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:21:54,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:21:54,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326910105] [2022-07-23 06:21:54,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:21:54,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:21:54,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:21:54,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:21:54,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:21:54,833 INFO L87 Difference]: Start difference. First operand 237 states and 279 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:54,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:21:54,882 INFO L93 Difference]: Finished difference Result 234 states and 273 transitions. [2022-07-23 06:21:54,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:21:54,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-23 06:21:54,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:21:54,884 INFO L225 Difference]: With dead ends: 234 [2022-07-23 06:21:54,884 INFO L226 Difference]: Without dead ends: 234 [2022-07-23 06:21:54,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:21:54,885 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 78 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:21:54,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 151 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:21:54,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-23 06:21:54,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2022-07-23 06:21:54,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 194 states have (on average 1.407216494845361) internal successors, (273), 233 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 273 transitions. [2022-07-23 06:21:54,891 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 273 transitions. Word has length 32 [2022-07-23 06:21:54,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:21:54,891 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 273 transitions. [2022-07-23 06:21:54,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:54,891 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 273 transitions. [2022-07-23 06:21:54,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 06:21:54,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:21:54,894 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:21:54,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 06:21:54,895 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:21:54,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:21:54,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1640159732, now seen corresponding path program 1 times [2022-07-23 06:21:54,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:21:54,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887557990] [2022-07-23 06:21:54,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:54,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:21:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:21:54,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:21:54,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887557990] [2022-07-23 06:21:54,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887557990] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:21:54,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:21:54,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:21:54,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953803834] [2022-07-23 06:21:54,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:21:54,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:21:54,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:21:54,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:21:54,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:21:54,936 INFO L87 Difference]: Start difference. First operand 234 states and 273 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:54,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:21:54,974 INFO L93 Difference]: Finished difference Result 232 states and 267 transitions. [2022-07-23 06:21:54,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:21:54,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-23 06:21:54,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:21:54,975 INFO L225 Difference]: With dead ends: 232 [2022-07-23 06:21:54,975 INFO L226 Difference]: Without dead ends: 232 [2022-07-23 06:21:54,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:21:54,978 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 67 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:21:54,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 173 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 06:21:54,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-23 06:21:54,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2022-07-23 06:21:54,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 194 states have (on average 1.3762886597938144) internal successors, (267), 230 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 267 transitions. [2022-07-23 06:21:54,988 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 267 transitions. Word has length 32 [2022-07-23 06:21:54,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:21:54,988 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 267 transitions. [2022-07-23 06:21:54,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:54,988 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 267 transitions. [2022-07-23 06:21:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:21:54,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:21:54,989 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:21:54,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 06:21:54,989 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:21:54,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:21:54,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1267662762, now seen corresponding path program 1 times [2022-07-23 06:21:54,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:21:54,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000606554] [2022-07-23 06:21:54,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:54,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:21:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:55,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:21:55,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:21:55,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000606554] [2022-07-23 06:21:55,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000606554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:21:55,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:21:55,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:21:55,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516682669] [2022-07-23 06:21:55,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:21:55,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:21:55,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:21:55,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:21:55,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:21:55,024 INFO L87 Difference]: Start difference. First operand 231 states and 267 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:55,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:21:55,204 INFO L93 Difference]: Finished difference Result 254 states and 291 transitions. [2022-07-23 06:21:55,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:21:55,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-23 06:21:55,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:21:55,206 INFO L225 Difference]: With dead ends: 254 [2022-07-23 06:21:55,206 INFO L226 Difference]: Without dead ends: 254 [2022-07-23 06:21:55,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:21:55,206 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 113 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:21:55,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 334 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:21:55,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-07-23 06:21:55,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 238. [2022-07-23 06:21:55,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 201 states have (on average 1.3880597014925373) internal successors, (279), 237 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:55,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 279 transitions. [2022-07-23 06:21:55,210 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 279 transitions. Word has length 36 [2022-07-23 06:21:55,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:21:55,210 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 279 transitions. [2022-07-23 06:21:55,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:55,210 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 279 transitions. [2022-07-23 06:21:55,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:21:55,211 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:21:55,211 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:21:55,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 06:21:55,211 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:21:55,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:21:55,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1267662761, now seen corresponding path program 1 times [2022-07-23 06:21:55,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:21:55,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387157403] [2022-07-23 06:21:55,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:55,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:21:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:55,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:55,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:21:55,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387157403] [2022-07-23 06:21:55,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387157403] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:21:55,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217711920] [2022-07-23 06:21:55,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:55,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:21:55,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:21:55,425 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:21:55,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-23 06:21:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:55,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-23 06:21:55,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:21:55,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-23 06:21:55,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-23 06:21:55,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:21:55,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:21:55,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217711920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:21:55,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 06:21:55,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 18 [2022-07-23 06:21:55,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969830503] [2022-07-23 06:21:55,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:21:55,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:21:55,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:21:55,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:21:55,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-07-23 06:21:55,591 INFO L87 Difference]: Start difference. First operand 238 states and 279 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:21:55,785 INFO L93 Difference]: Finished difference Result 250 states and 286 transitions. [2022-07-23 06:21:55,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:21:55,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-23 06:21:55,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:21:55,786 INFO L225 Difference]: With dead ends: 250 [2022-07-23 06:21:55,786 INFO L226 Difference]: Without dead ends: 250 [2022-07-23 06:21:55,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2022-07-23 06:21:55,787 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 69 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:21:55,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 407 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:21:55,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-07-23 06:21:55,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 236. [2022-07-23 06:21:55,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 201 states have (on average 1.36318407960199) internal successors, (274), 235 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 274 transitions. [2022-07-23 06:21:55,791 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 274 transitions. Word has length 36 [2022-07-23 06:21:55,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:21:55,791 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 274 transitions. [2022-07-23 06:21:55,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:55,791 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 274 transitions. [2022-07-23 06:21:55,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 06:21:55,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:21:55,792 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] [2022-07-23 06:21:55,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-23 06:21:56,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-23 06:21:56,000 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:21:56,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:21:56,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1546801846, now seen corresponding path program 1 times [2022-07-23 06:21:56,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:21:56,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466835801] [2022-07-23 06:21:56,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:56,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:21:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:56,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:56,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:21:56,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466835801] [2022-07-23 06:21:56,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466835801] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:21:56,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294525562] [2022-07-23 06:21:56,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:56,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:21:56,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:21:56,343 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:21:56,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-23 06:21:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:56,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-23 06:21:56,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:21:56,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:21:56,451 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:21:56,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:21:56,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:21:56,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:21:56,541 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:21:56,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-07-23 06:21:56,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:21:56,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-23 06:21:56,600 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:21:56,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 47 [2022-07-23 06:21:56,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 06:21:56,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-23 06:21:56,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:21:56,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-07-23 06:21:56,854 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:21:56,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:21:56,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:21:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:56,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:21:57,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 57 [2022-07-23 06:21:57,316 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:21:57,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-23 06:21:57,322 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:21:57,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-23 06:21:57,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-23 06:21:57,353 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:21:57,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-23 06:21:57,355 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:21:57,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:21:57,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:21:57,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-23 06:21:57,368 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:21:57,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2022-07-23 06:21:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:57,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294525562] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:21:57,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:21:57,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 33 [2022-07-23 06:21:57,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751076054] [2022-07-23 06:21:57,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:21:57,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-23 06:21:57,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:21:57,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-23 06:21:57,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=949, Unknown=1, NotChecked=0, Total=1056 [2022-07-23 06:21:57,524 INFO L87 Difference]: Start difference. First operand 236 states and 274 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:58,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:21:58,155 INFO L93 Difference]: Finished difference Result 278 states and 317 transitions. [2022-07-23 06:21:58,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-23 06:21:58,157 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 38 [2022-07-23 06:21:58,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:21:58,158 INFO L225 Difference]: With dead ends: 278 [2022-07-23 06:21:58,158 INFO L226 Difference]: Without dead ends: 278 [2022-07-23 06:21:58,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=206, Invalid=1515, Unknown=1, NotChecked=0, Total=1722 [2022-07-23 06:21:58,158 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 160 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 629 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:21:58,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1737 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 838 Invalid, 0 Unknown, 629 Unchecked, 0.3s Time] [2022-07-23 06:21:58,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-07-23 06:21:58,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 244. [2022-07-23 06:21:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 209 states have (on average 1.3588516746411483) internal successors, (284), 243 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:58,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 284 transitions. [2022-07-23 06:21:58,162 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 284 transitions. Word has length 38 [2022-07-23 06:21:58,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:21:58,162 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 284 transitions. [2022-07-23 06:21:58,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:21:58,162 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 284 transitions. [2022-07-23 06:21:58,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 06:21:58,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:21:58,163 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:21:58,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-23 06:21:58,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-23 06:21:58,363 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:21:58,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:21:58,364 INFO L85 PathProgramCache]: Analyzing trace with hash -247701985, now seen corresponding path program 2 times [2022-07-23 06:21:58,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:21:58,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056596091] [2022-07-23 06:21:58,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:21:58,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:21:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:21:58,599 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:58,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:21:58,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056596091] [2022-07-23 06:21:58,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056596091] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:21:58,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905141739] [2022-07-23 06:21:58,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:21:58,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:21:58,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:21:58,602 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:21:58,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-23 06:21:58,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:21:58,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:21:58,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-23 06:21:58,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:21:58,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:21:58,790 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:21:58,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:21:58,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:21:58,902 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:21:58,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-07-23 06:21:58,931 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:21:58,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-07-23 06:21:58,946 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:21:58,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:21:58,977 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-23 06:21:58,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2022-07-23 06:21:59,082 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-23 06:21:59,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2022-07-23 06:21:59,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-23 06:21:59,167 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-23 06:21:59,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2022-07-23 06:21:59,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-23 06:21:59,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:21:59,284 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:21:59,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-07-23 06:21:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:21:59,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:21:59,512 INFO L356 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2022-07-23 06:21:59,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-07-23 06:21:59,519 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_85| Int) (v_ArrVal_797 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_797) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-23 06:21:59,573 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:21:59,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-23 06:21:59,581 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_85| Int) (v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_797 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_9 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_9) .cse0 v_ArrVal_797) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| .cse0) 0))))) is different from false [2022-07-23 06:21:59,622 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_85| Int) (v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_797 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_9 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| .cse0) 0)) (= |c_ULTIMATE.start_main_#t~mem4#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_9) .cse0 v_ArrVal_797) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|))))) is different from false [2022-07-23 06:21:59,631 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_85| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_88| Int) (v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_797 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_9 |v_ULTIMATE.start_main_~x~0#1.offset_88|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |c_ULTIMATE.start_main_~head~0#1.offset|)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_9) .cse1 v_ArrVal_797) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|))) (not (= (select |c_#valid| .cse1) 0))))) is different from false [2022-07-23 06:21:59,647 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:21:59,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-23 06:21:59,654 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:21:59,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 133 [2022-07-23 06:21:59,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2022-07-23 06:21:59,667 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:21:59,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 108 [2022-07-23 06:21:59,675 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:21:59,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-23 06:21:59,893 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-23 06:21:59,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905141739] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:21:59,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:21:59,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 43 [2022-07-23 06:21:59,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140646331] [2022-07-23 06:21:59,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:21:59,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-23 06:21:59,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:21:59,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-23 06:21:59,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1413, Unknown=9, NotChecked=316, Total=1892 [2022-07-23 06:21:59,895 INFO L87 Difference]: Start difference. First operand 244 states and 284 transitions. Second operand has 44 states, 43 states have (on average 2.488372093023256) internal successors, (107), 44 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:22:01,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:22:01,394 INFO L93 Difference]: Finished difference Result 524 states and 596 transitions. [2022-07-23 06:22:01,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-23 06:22:01,394 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.488372093023256) internal successors, (107), 44 states have internal predecessors, (107), 0 states have call successors, (0), 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 38 [2022-07-23 06:22:01,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:22:01,396 INFO L225 Difference]: With dead ends: 524 [2022-07-23 06:22:01,396 INFO L226 Difference]: Without dead ends: 524 [2022-07-23 06:22:01,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1110 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=497, Invalid=3539, Unknown=12, NotChecked=508, Total=4556 [2022-07-23 06:22:01,397 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 1035 mSDsluCounter, 1819 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 3804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2224 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 06:22:01,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1900 Invalid, 3804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1488 Invalid, 0 Unknown, 2224 Unchecked, 0.7s Time] [2022-07-23 06:22:01,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-07-23 06:22:01,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 275. [2022-07-23 06:22:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 240 states have (on average 1.3375) internal successors, (321), 274 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:22:01,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 321 transitions. [2022-07-23 06:22:01,405 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 321 transitions. Word has length 38 [2022-07-23 06:22:01,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:22:01,405 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 321 transitions. [2022-07-23 06:22:01,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.488372093023256) internal successors, (107), 44 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:22:01,406 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 321 transitions. [2022-07-23 06:22:01,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 06:22:01,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:22:01,406 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:22:01,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-23 06:22:01,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:22:01,616 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:22:01,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:22:01,616 INFO L85 PathProgramCache]: Analyzing trace with hash -247701984, now seen corresponding path program 2 times [2022-07-23 06:22:01,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:22:01,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616636637] [2022-07-23 06:22:01,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:22:01,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:22:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:22:01,939 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:22:01,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:22:01,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616636637] [2022-07-23 06:22:01,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616636637] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:22:01,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849332777] [2022-07-23 06:22:01,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:22:01,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:22:01,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:22:01,941 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:22:01,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-23 06:22:02,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:22:02,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:22:02,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-23 06:22:02,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:22:02,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:22:02,111 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:22:02,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-23 06:22:02,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:22:02,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:22:02,255 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:22:02,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-23 06:22:02,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:22:02,270 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:22:02,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-23 06:22:02,350 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:22:02,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-23 06:22:02,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:22:02,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:22:02,418 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:22:02,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-23 06:22:02,435 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-23 06:22:02,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-23 06:22:02,487 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:22:02,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-23 06:22:02,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:22:02,505 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-23 06:22:02,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2022-07-23 06:22:02,664 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-23 06:22:02,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 55 [2022-07-23 06:22:02,678 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:22:02,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-23 06:22:02,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-23 06:22:02,753 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-23 06:22:02,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 63 [2022-07-23 06:22:02,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-23 06:22:02,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:22:02,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:22:02,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:22:02,942 INFO L356 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-07-23 06:22:02,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 29 [2022-07-23 06:22:02,946 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:22:02,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:22:03,098 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_922 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) 4)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)))) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|))))) is different from false [2022-07-23 06:22:03,156 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_922 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)))) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_923) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|))))) is different from false [2022-07-23 06:22:03,172 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_922 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) 4)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)))) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_923) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|)))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|))))) is different from false [2022-07-23 06:22:03,196 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_922 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int) (v_ArrVal_917 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)))) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int) (v_ArrVal_917 (Array Int Int))) (or (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_923) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|))))) is different from false [2022-07-23 06:22:03,335 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:03,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 139 [2022-07-23 06:22:03,342 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:03,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 130 [2022-07-23 06:22:03,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-23 06:22:03,735 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select |c_#valid| (select v_arrayElimArr_11 |ULTIMATE.start_main_~x~0#1.offset|)) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_11) (select v_arrayElimArr_11 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_923) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) |c_ULTIMATE.start_main_~x~0#1.base|)))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)))))) (forall ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_4 (Array Int Int))) (or (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_4) v_prenex_2 v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) v_prenex_3) 4)) (not (<= 0 v_prenex_3)) (not (<= v_prenex_3 |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| v_prenex_2) 0)))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select |c_#valid| (select v_arrayElimArr_11 |ULTIMATE.start_main_~x~0#1.offset|)) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (not (let ((.cse0 (select v_arrayElimArr_11 |ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_11) .cse0 v_ArrVal_923) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|))))))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)))))) (forall ((v_ArrVal_922 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int) (v_ArrVal_917 (Array Int Int)) (v_arrayElimCell_104 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_104) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_917) v_arrayElimCell_104 v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) 0) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|))))) is different from false [2022-07-23 06:22:03,792 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select |c_#valid| (select v_arrayElimArr_11 |ULTIMATE.start_main_~x~0#1.offset|)) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem4#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_11) (select v_arrayElimArr_11 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_923) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|))))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)))))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (forall ((v_ArrVal_923 (Array Int Int))) (not (let ((.cse0 (select v_arrayElimArr_11 |ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_11) .cse0 v_ArrVal_923) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|))))) (not (= (select |c_#valid| (select v_arrayElimArr_11 |ULTIMATE.start_main_~x~0#1.offset|)) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)))))) (forall ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_4 (Array Int Int))) (or (not (<= 0 v_prenex_3)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_prenex_4) v_prenex_2 v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) v_prenex_3) 4)) (not (<= v_prenex_3 |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| v_prenex_2) 0)))) (forall ((v_ArrVal_922 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int) (v_ArrVal_917 (Array Int Int)) (v_arrayElimCell_104 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_104) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_917) v_arrayElimCell_104 v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) 0) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|))))) is different from false [2022-07-23 06:22:03,838 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_922 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int) (v_ArrVal_917 (Array Int Int)) (v_arrayElimCell_104 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_104) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_917) v_arrayElimCell_104 v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) 0) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)))) (forall ((v_subst_1 Int)) (or (not (<= 0 v_subst_1)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select |c_#valid| (select v_arrayElimArr_11 v_subst_1)) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (not (let ((.cse0 (select v_arrayElimArr_11 v_subst_1))) (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_arrayElimArr_11) .cse0 v_ArrVal_923) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) .cse0)))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)))))) (forall ((v_subst_2 Int)) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)) (forall ((v_arrayElimArr_11 (Array Int Int))) (or (not (= (select |c_#valid| (select v_arrayElimArr_11 v_subst_2)) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_11) (select v_arrayElimArr_11 v_subst_2) v_ArrVal_923) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|)))))))) (not (<= 0 v_subst_2)))) (forall ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_4 (Array Int Int))) (or (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_prenex_4) v_prenex_2 v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) v_prenex_3) 4)) (not (<= 0 v_prenex_3)) (not (<= v_prenex_3 |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| v_prenex_2) 0))))) is different from false [2022-07-23 06:22:03,900 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:03,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-23 06:22:03,907 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:03,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 71 [2022-07-23 06:22:03,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-07-23 06:22:03,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-07-23 06:22:04,034 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:04,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-23 06:22:04,044 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:22:04,049 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:04,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 40 [2022-07-23 06:22:04,055 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:04,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2022-07-23 06:22:04,119 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:04,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-23 06:22:04,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:22:04,129 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:04,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-23 06:22:04,137 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:04,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-07-23 06:22:04,163 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:04,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-07-23 06:22:04,166 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:22:04,171 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:04,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-23 06:22:04,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-23 06:22:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-23 06:22:04,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849332777] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:22:04,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:22:04,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 47 [2022-07-23 06:22:04,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46727788] [2022-07-23 06:22:04,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:22:04,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-23 06:22:04,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:22:04,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-23 06:22:04,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1472, Unknown=13, NotChecked=588, Total=2256 [2022-07-23 06:22:04,567 INFO L87 Difference]: Start difference. First operand 275 states and 321 transitions. Second operand has 48 states, 47 states have (on average 2.3617021276595747) internal successors, (111), 48 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:22:19,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:22:19,755 INFO L93 Difference]: Finished difference Result 691 states and 786 transitions. [2022-07-23 06:22:19,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-23 06:22:19,755 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.3617021276595747) internal successors, (111), 48 states have internal predecessors, (111), 0 states have call successors, (0), 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 38 [2022-07-23 06:22:19,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:22:19,757 INFO L225 Difference]: With dead ends: 691 [2022-07-23 06:22:19,757 INFO L226 Difference]: Without dead ends: 691 [2022-07-23 06:22:19,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 49 SyntacticMatches, 7 SemanticMatches, 81 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 1699 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=692, Invalid=5011, Unknown=25, NotChecked=1078, Total=6806 [2022-07-23 06:22:19,759 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 966 mSDsluCounter, 2406 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 2519 SdHoareTripleChecker+Invalid, 5146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3303 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 06:22:19,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 2519 Invalid, 5146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1724 Invalid, 0 Unknown, 3303 Unchecked, 0.8s Time] [2022-07-23 06:22:19,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-07-23 06:22:19,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 275. [2022-07-23 06:22:19,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 240 states have (on average 1.3333333333333333) 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) [2022-07-23 06:22:19,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 320 transitions. [2022-07-23 06:22:19,764 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 320 transitions. Word has length 38 [2022-07-23 06:22:19,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:22:19,764 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 320 transitions. [2022-07-23 06:22:19,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.3617021276595747) internal successors, (111), 48 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:22:19,764 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 320 transitions. [2022-07-23 06:22:19,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-23 06:22:19,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:22:19,764 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] [2022-07-23 06:22:19,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-23 06:22:19,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:22:19,965 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:22:19,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:22:19,965 INFO L85 PathProgramCache]: Analyzing trace with hash 706221163, now seen corresponding path program 1 times [2022-07-23 06:22:19,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:22:19,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784438734] [2022-07-23 06:22:19,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:22:19,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:22:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:22:20,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:22:20,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:22:20,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784438734] [2022-07-23 06:22:20,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784438734] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:22:20,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011275011] [2022-07-23 06:22:20,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:22:20,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:22:20,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:22:20,185 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:22:20,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-23 06:22:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:22:20,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-23 06:22:20,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:22:20,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:22:20,334 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:22:20,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:22:20,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:22:20,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:22:20,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-23 06:22:20,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:22:20,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:22:20,543 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:22:20,545 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:20,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-07-23 06:22:20,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:22:20,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:22:20,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-07-23 06:22:20,691 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_998 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_98| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_998) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_98|)))) is different from false [2022-07-23 06:22:20,717 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_998 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (or (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_998) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_98| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_98|)))) is different from false [2022-07-23 06:22:20,732 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_998 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_98| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_998) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_98|)))) is different from false [2022-07-23 06:22:20,744 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:20,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-23 06:22:20,750 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:20,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-23 06:22:20,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-23 06:22:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:22:20,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011275011] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:22:20,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:22:20,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 36 [2022-07-23 06:22:20,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421082852] [2022-07-23 06:22:20,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:22:20,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-23 06:22:20,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:22:20,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-23 06:22:20,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=994, Unknown=3, NotChecked=198, Total=1332 [2022-07-23 06:22:20,905 INFO L87 Difference]: Start difference. First operand 275 states and 320 transitions. Second operand has 37 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 37 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:22:21,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:22:21,947 INFO L93 Difference]: Finished difference Result 312 states and 355 transitions. [2022-07-23 06:22:21,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-23 06:22:21,947 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 37 states have internal predecessors, (107), 0 states have call successors, (0), 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 39 [2022-07-23 06:22:21,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:22:21,948 INFO L225 Difference]: With dead ends: 312 [2022-07-23 06:22:21,948 INFO L226 Difference]: Without dead ends: 312 [2022-07-23 06:22:21,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=608, Invalid=3183, Unknown=3, NotChecked=366, Total=4160 [2022-07-23 06:22:21,950 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 518 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 856 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:22:21,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1454 Invalid, 1961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 949 Invalid, 0 Unknown, 856 Unchecked, 0.4s Time] [2022-07-23 06:22:21,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-07-23 06:22:21,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 264. [2022-07-23 06:22:21,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 235 states have (on average 1.3021276595744682) internal successors, (306), 263 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:22:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 306 transitions. [2022-07-23 06:22:21,953 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 306 transitions. Word has length 39 [2022-07-23 06:22:21,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:22:21,953 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 306 transitions. [2022-07-23 06:22:21,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 37 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:22:21,953 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 306 transitions. [2022-07-23 06:22:21,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-23 06:22:21,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:22:21,954 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:22:21,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-23 06:22:22,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-23 06:22:22,167 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:22:22,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:22:22,168 INFO L85 PathProgramCache]: Analyzing trace with hash 337780897, now seen corresponding path program 2 times [2022-07-23 06:22:22,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:22:22,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115883524] [2022-07-23 06:22:22,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:22:22,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:22:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:22:22,615 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:22:22,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:22:22,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115883524] [2022-07-23 06:22:22,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115883524] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:22:22,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520457931] [2022-07-23 06:22:22,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:22:22,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:22:22,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:22:22,617 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:22:22,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-23 06:22:22,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:22:22,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:22:22,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-23 06:22:22,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:22:22,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:22:22,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:22:22,818 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:22:22,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:22:22,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:22:22,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:22:22,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:22:22,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-23 06:22:22,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 06:22:22,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 06:22:22,944 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:22:22,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:22:22,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:22:22,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 06:22:22,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-23 06:22:23,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 06:22:23,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 06:22:23,167 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:22:23,169 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:23,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-07-23 06:22:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:22:23,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:22:23,276 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1120 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_102| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_102|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1120) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_102|)) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_102| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-23 06:22:23,301 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1120 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_102| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_102|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_102| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1120) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_102|)) 0))) is different from false [2022-07-23 06:22:23,309 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1120 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_102| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_102|)) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1120) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_102|)) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_102| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-23 06:22:23,322 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1120 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_102| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_102|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_102| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1118) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1120) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_102|)) 0))) is different from false [2022-07-23 06:22:23,524 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:22:23,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-23 06:22:23,674 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_105| Int) (v_ArrVal_1110 Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_33| Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_31| Int) (v_ArrVal_1120 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_102| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_33|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_102|)) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc3#1.base_31|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_102| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_105| v_ArrVal_1110)) |v_ULTIMATE.start_main_#t~malloc3#1.base_33| v_ArrVal_1118) |v_ULTIMATE.start_main_#t~malloc3#1.base_31| v_ArrVal_1120) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_102|)) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_105| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-23 06:22:23,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:22:23,684 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:23,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2022-07-23 06:22:23,688 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:22:23,692 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:23,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 36 [2022-07-23 06:22:23,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:22:23,754 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-23 06:22:23,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520457931] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:22:23,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:22:23,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 18] total 50 [2022-07-23 06:22:23,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785002879] [2022-07-23 06:22:23,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:22:23,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-23 06:22:23,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:22:23,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-23 06:22:23,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1741, Unknown=61, NotChecked=450, Total=2450 [2022-07-23 06:22:23,755 INFO L87 Difference]: Start difference. First operand 264 states and 306 transitions. Second operand has 50 states, 50 states have (on average 2.48) internal successors, (124), 50 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:22:25,119 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_ArrVal_1118 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_31| Int) (v_ArrVal_1120 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_102| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_102|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_102| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1118) |v_ULTIMATE.start_main_#t~malloc3#1.base_31| v_ArrVal_1120) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_102|)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_31|) 0)))) (forall ((v_ArrVal_1120 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_102| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_102|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_102| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1120) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_102|)) 0))) (not (= |c_ULTIMATE.start_main_#t~mem4#1.base| |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2022-07-23 06:22:25,179 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0) (not (= .cse1 |c_ULTIMATE.start_main_~x~0#1.base|)) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_1120 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_102| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_102|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1120) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_102|)) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_102| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0) (forall ((v_ArrVal_1118 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_31| Int) (v_ArrVal_1120 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_102| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_102|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1118) |v_ULTIMATE.start_main_#t~malloc3#1.base_31| v_ArrVal_1120) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_102|)) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_102| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_31|) 0)))) (not (= (select (select |c_#memory_int| .cse1) .cse0) 0)))) is different from false [2022-07-23 06:22:25,182 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_1120 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_102| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_102|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1120) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_102|)) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_102| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1118 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_31| Int) (v_ArrVal_1120 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_102| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_102|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1118) |v_ULTIMATE.start_main_#t~malloc3#1.base_31| v_ArrVal_1120) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_102|)) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_102| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_31|) 0))))) is different from false [2022-07-23 06:22:29,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:22:29,268 INFO L93 Difference]: Finished difference Result 614 states and 700 transitions. [2022-07-23 06:22:29,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-23 06:22:29,269 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.48) internal successors, (124), 50 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-23 06:22:29,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:22:29,271 INFO L225 Difference]: With dead ends: 614 [2022-07-23 06:22:29,271 INFO L226 Difference]: Without dead ends: 614 [2022-07-23 06:22:29,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 96 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2305 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1089, Invalid=6821, Unknown=132, NotChecked=1464, Total=9506 [2022-07-23 06:22:29,273 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 1035 mSDsluCounter, 2032 mSDsCounter, 0 mSdLazyCounter, 1534 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 4411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 1534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2692 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 06:22:29,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 2113 Invalid, 4411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 1534 Invalid, 0 Unknown, 2692 Unchecked, 0.7s Time] [2022-07-23 06:22:29,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-07-23 06:22:29,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 316. [2022-07-23 06:22:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 287 states have (on average 1.2926829268292683) internal successors, (371), 315 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:22:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 371 transitions. [2022-07-23 06:22:29,278 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 371 transitions. Word has length 43 [2022-07-23 06:22:29,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:22:29,278 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 371 transitions. [2022-07-23 06:22:29,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.48) internal successors, (124), 50 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:22:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 371 transitions. [2022-07-23 06:22:29,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-23 06:22:29,279 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:22:29,279 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:22:29,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-23 06:22:29,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:22:29,494 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:22:29,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:22:29,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1351162845, now seen corresponding path program 1 times [2022-07-23 06:22:29,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:22:29,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219439225] [2022-07-23 06:22:29,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:22:29,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:22:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:22:29,925 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:22:29,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:22:29,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219439225] [2022-07-23 06:22:29,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219439225] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:22:29,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301390406] [2022-07-23 06:22:29,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:22:29,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:22:29,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:22:29,927 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:22:29,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-23 06:22:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:22:30,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-23 06:22:30,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:22:30,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:22:30,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:22:30,121 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:22:30,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:22:30,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:22:30,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:22:30,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-23 06:22:30,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-23 06:22:30,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 06:22:30,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 06:22:30,287 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:22:30,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:22:30,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:22:30,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 06:22:30,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-23 06:22:30,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 06:22:30,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 06:22:30,528 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:22:30,530 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:30,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-07-23 06:22:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:22:30,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:22:30,638 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_107| Int) (v_ArrVal_1242 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_107|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_107| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1242) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_107|)) 0))) is different from false [2022-07-23 06:22:30,663 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_107| Int) (v_ArrVal_1242 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1242) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_107|)) 0) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_107|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_107| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-23 06:22:30,670 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_107| Int) (v_ArrVal_1242 (Array Int Int))) (or (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1242) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_107|)) 0) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_107|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_107| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-23 06:22:30,682 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_107| Int) (v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1238) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1242) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_107|)) 0) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_107|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_107| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-23 06:22:30,883 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:22:30,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-23 06:22:31,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_36| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_107| Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_38| Int) (v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1233 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_110| Int) (v_ArrVal_1242 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_110| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_38|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_107|)) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc3#1.base_36|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_107| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_110| v_ArrVal_1233)) |v_ULTIMATE.start_main_#t~malloc3#1.base_38| v_ArrVal_1238) |v_ULTIMATE.start_main_#t~malloc3#1.base_36| v_ArrVal_1242) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_107|)) 0))) is different from false [2022-07-23 06:22:31,041 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:22:31,045 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:31,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2022-07-23 06:22:31,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:22:31,053 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:31,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 36 [2022-07-23 06:22:31,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:22:31,110 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-23 06:22:31,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301390406] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:22:31,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:22:31,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 18] total 50 [2022-07-23 06:22:31,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22568401] [2022-07-23 06:22:31,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:22:31,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-23 06:22:31,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:22:31,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-23 06:22:31,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1746, Unknown=55, NotChecked=450, Total=2450 [2022-07-23 06:22:31,112 INFO L87 Difference]: Start difference. First operand 316 states and 371 transitions. Second operand has 50 states, 50 states have (on average 2.48) internal successors, (124), 50 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:22:34,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:22:34,123 INFO L93 Difference]: Finished difference Result 795 states and 906 transitions. [2022-07-23 06:22:34,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-07-23 06:22:34,123 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.48) internal successors, (124), 50 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-23 06:22:34,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:22:34,125 INFO L225 Difference]: With dead ends: 795 [2022-07-23 06:22:34,125 INFO L226 Difference]: Without dead ends: 795 [2022-07-23 06:22:34,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 72 SyntacticMatches, 7 SemanticMatches, 94 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2198 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1054, Invalid=7080, Unknown=76, NotChecked=910, Total=9120 [2022-07-23 06:22:34,130 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 1238 mSDsluCounter, 2568 mSDsCounter, 0 mSdLazyCounter, 2044 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 2667 SdHoareTripleChecker+Invalid, 4960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 2044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2733 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 06:22:34,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 2667 Invalid, 4960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 2044 Invalid, 0 Unknown, 2733 Unchecked, 0.8s Time] [2022-07-23 06:22:34,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-07-23 06:22:34,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 307. [2022-07-23 06:22:34,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 278 states have (on average 1.2985611510791366) internal successors, (361), 306 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:22:34,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 361 transitions. [2022-07-23 06:22:34,136 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 361 transitions. Word has length 43 [2022-07-23 06:22:34,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:22:34,136 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 361 transitions. [2022-07-23 06:22:34,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.48) internal successors, (124), 50 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:22:34,136 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 361 transitions. [2022-07-23 06:22:34,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-23 06:22:34,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:22:34,137 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:22:34,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-23 06:22:34,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-23 06:22:34,356 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-07-23 06:22:34,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:22:34,357 INFO L85 PathProgramCache]: Analyzing trace with hash -774106862, now seen corresponding path program 1 times [2022-07-23 06:22:34,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:22:34,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709318485] [2022-07-23 06:22:34,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:22:34,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:22:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:22:34,595 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:22:34,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:22:34,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709318485] [2022-07-23 06:22:34,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709318485] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:22:34,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464511763] [2022-07-23 06:22:34,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:22:34,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:22:34,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:22:34,597 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 06:22:34,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-23 06:22:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:22:34,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-23 06:22:34,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:22:34,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:22:34,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:22:34,761 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:22:34,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:22:34,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:22:34,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:22:34,889 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-23 06:22:34,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 27 [2022-07-23 06:22:34,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:22:34,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-23 06:22:34,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:22:34,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:22:34,969 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-23 06:22:34,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 75 [2022-07-23 06:22:34,977 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-23 06:22:34,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2022-07-23 06:22:35,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:22:35,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-23 06:22:35,429 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:22:35,430 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:22:35,430 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:22:35,436 INFO L356 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-07-23 06:22:35,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 69 treesize of output 42 [2022-07-23 06:22:35,440 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:22:35,443 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:22:35,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 22 [2022-07-23 06:22:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:22:35,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:22:57,178 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:22:57,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 57470 treesize of output 52059 [2022-07-23 06:22:59,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:22:59,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:23:01,475 INFO L356 Elim1Store]: treesize reduction 606, result has 56.1 percent of original size [2022-07-23 06:23:01,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 16 new quantified variables, introduced 106 case distinctions, treesize of input 325420 treesize of output 293116 [2022-07-23 06:23:20,422 WARN L233 SmtUtils]: Spent 18.94s on a formula simplification. DAG size of input: 1819 DAG size of output: 1795 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 06:23:24,860 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:23:24,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 335735 treesize of output 299239 [2022-07-23 06:23:27,027 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:23:27,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2022-07-23 06:23:31,840 INFO L356 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-07-23 06:23:31,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 59 [2022-07-23 06:23:33,796 INFO L356 Elim1Store]: treesize reduction 130, result has 0.8 percent of original size [2022-07-23 06:23:33,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 101 treesize of output 87 [2022-07-23 06:23:35,391 INFO L356 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-07-23 06:23:35,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 59 [2022-07-23 06:23:37,829 INFO L356 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-07-23 06:23:37,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 59 [2022-07-23 06:23:43,605 INFO L356 Elim1Store]: treesize reduction 62, result has 52.7 percent of original size [2022-07-23 06:23:43,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 101 treesize of output 155 [2022-07-23 06:23:49,472 INFO L356 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-07-23 06:23:49,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 59 [2022-07-23 06:23:51,234 INFO L356 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-07-23 06:23:51,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 59 [2022-07-23 06:23:57,635 INFO L356 Elim1Store]: treesize reduction 62, result has 52.7 percent of original size [2022-07-23 06:23:57,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 101 treesize of output 155 [2022-07-23 06:24:11,752 INFO L356 Elim1Store]: treesize reduction 62, result has 52.7 percent of original size [2022-07-23 06:24:11,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 101 treesize of output 155 [2022-07-23 06:24:20,217 INFO L356 Elim1Store]: treesize reduction 62, result has 52.7 percent of original size [2022-07-23 06:24:20,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 101 treesize of output 155 [2022-07-23 06:24:33,557 INFO L356 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-07-23 06:24:33,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 59 [2022-07-23 06:24:34,590 INFO L356 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-07-23 06:24:34,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 59 [2022-07-23 06:24:36,256 INFO L356 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-07-23 06:24:36,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 59 [2022-07-23 06:24:39,900 INFO L356 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-07-23 06:24:39,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 59 [2022-07-23 06:24:41,842 INFO L356 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-07-23 06:24:41,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 59 [2022-07-23 06:24:44,489 INFO L356 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-07-23 06:24:44,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 59 [2022-07-23 06:24:45,273 INFO L356 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-07-23 06:24:45,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 59 [2022-07-23 06:24:48,640 INFO L356 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-07-23 06:24:48,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 59