./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c -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 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:31:26,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:31:26,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:31:26,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:31:26,273 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:31:26,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:31:26,277 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:31:26,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:31:26,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:31:26,283 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:31:26,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:31:26,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:31:26,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:31:26,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:31:26,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:31:26,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:31:26,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:31:26,295 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:31:26,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:31:26,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:31:26,298 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:31:26,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:31:26,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:31:26,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:31:26,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:31:26,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:31:26,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:31:26,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:31:26,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:31:26,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:31:26,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:31:26,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:31:26,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:31:26,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:31:26,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:31:26,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:31:26,313 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:31:26,314 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:31:26,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:31:26,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:31:26,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:31:26,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:31:26,317 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 18:31:26,340 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:31:26,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:31:26,340 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:31:26,341 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:31:26,341 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:31:26,341 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:31:26,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:31:26,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:31:26,342 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:31:26,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:31:26,343 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:31:26,343 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:31:26,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:31:26,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:31:26,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:31:26,343 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:31:26,344 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:31:26,344 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:31:26,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:31:26,344 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:31:26,344 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:31:26,344 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:31:26,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:31:26,344 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:31:26,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:31:26,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:31:26,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:31:26,345 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:31:26,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:31:26,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:31:26,346 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 -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 [2022-07-12 18:31:26,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:31:26,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:31:26,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:31:26,568 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:31:26,568 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:31:26,569 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2022-07-12 18:31:26,608 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a018e3d/46b36b2fad71438eb555aa0160e4d292/FLAG3248e7d76 [2022-07-12 18:31:26,997 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:31:26,997 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2022-07-12 18:31:27,002 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a018e3d/46b36b2fad71438eb555aa0160e4d292/FLAG3248e7d76 [2022-07-12 18:31:27,013 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a018e3d/46b36b2fad71438eb555aa0160e4d292 [2022-07-12 18:31:27,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:31:27,016 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:31:27,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:31:27,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:31:27,020 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:31:27,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:31:27" (1/1) ... [2022-07-12 18:31:27,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58635c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:31:27, skipping insertion in model container [2022-07-12 18:31:27,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:31:27" (1/1) ... [2022-07-12 18:31:27,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:31:27,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:31:27,176 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/verifythis/elimination_max_rec_onepoint.c[502,515] [2022-07-12 18:31:27,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:31:27,210 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:31:27,219 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/verifythis/elimination_max_rec_onepoint.c[502,515] [2022-07-12 18:31:27,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:31:27,248 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:31:27,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:31:27 WrapperNode [2022-07-12 18:31:27,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:31:27,251 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:31:27,251 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:31:27,251 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:31:27,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:31:27" (1/1) ... [2022-07-12 18:31:27,268 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:31:27" (1/1) ... [2022-07-12 18:31:27,283 INFO L137 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2022-07-12 18:31:27,284 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:31:27,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:31:27,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:31:27,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:31:27,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:31:27" (1/1) ... [2022-07-12 18:31:27,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:31:27" (1/1) ... [2022-07-12 18:31:27,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:31:27" (1/1) ... [2022-07-12 18:31:27,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:31:27" (1/1) ... [2022-07-12 18:31:27,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:31:27" (1/1) ... [2022-07-12 18:31:27,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:31:27" (1/1) ... [2022-07-12 18:31:27,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:31:27" (1/1) ... [2022-07-12 18:31:27,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:31:27,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:31:27,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:31:27,319 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:31:27,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:31:27" (1/1) ... [2022-07-12 18:31:27,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:31:27,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:31:27,340 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 18:31:27,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 18:31:27,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:31:27,370 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 18:31:27,370 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 18:31:27,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 18:31:27,370 INFO L130 BoogieDeclarations]: Found specification of procedure check [2022-07-12 18:31:27,370 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2022-07-12 18:31:27,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:31:27,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:31:27,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:31:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 18:31:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 18:31:27,371 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 18:31:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:31:27,417 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:31:27,419 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:31:27,570 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:31:27,574 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:31:27,574 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 18:31:27,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:31:27 BoogieIcfgContainer [2022-07-12 18:31:27,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:31:27,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:31:27,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:31:27,579 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:31:27,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:31:27" (1/3) ... [2022-07-12 18:31:27,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9993c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:31:27, skipping insertion in model container [2022-07-12 18:31:27,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:31:27" (2/3) ... [2022-07-12 18:31:27,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9993c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:31:27, skipping insertion in model container [2022-07-12 18:31:27,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:31:27" (3/3) ... [2022-07-12 18:31:27,581 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2022-07-12 18:31:27,589 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:31:27,589 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-07-12 18:31:27,614 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:31:27,619 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@3ac060f5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@33c8f382 [2022-07-12 18:31:27,619 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-07-12 18:31:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 35 states have (on average 1.6) internal successors, (56), 52 states have internal predecessors, (56), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-12 18:31:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:31:27,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:31:27,627 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:31:27,627 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-12 18:31:27,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:31:27,633 INFO L85 PathProgramCache]: Analyzing trace with hash -724999257, now seen corresponding path program 1 times [2022-07-12 18:31:27,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:31:27,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70650019] [2022-07-12 18:31:27,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:27,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:31:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:27,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:31:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:27,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:31:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:27,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:31:27,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:31:27,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70650019] [2022-07-12 18:31:27,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70650019] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:31:27,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:31:27,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:31:27,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013860764] [2022-07-12 18:31:27,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:31:27,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 18:31:27,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:31:27,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 18:31:27,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 18:31:27,782 INFO L87 Difference]: Start difference. First operand has 64 states, 35 states have (on average 1.6) internal successors, (56), 52 states have internal predecessors, (56), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:31:27,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:31:27,799 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-07-12 18:31:27,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 18:31:27,801 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-07-12 18:31:27,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:31:27,806 INFO L225 Difference]: With dead ends: 64 [2022-07-12 18:31:27,807 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 18:31:27,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 18:31:27,812 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:31:27,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:31:27,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 18:31:27,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-12 18:31:27,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 50 states have internal predecessors, (52), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-12 18:31:27,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-07-12 18:31:27,849 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 22 [2022-07-12 18:31:27,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:31:27,850 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-07-12 18:31:27,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:31:27,850 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-07-12 18:31:27,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:31:27,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:31:27,852 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:31:27,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 18:31:27,852 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-12 18:31:27,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:31:27,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1833988771, now seen corresponding path program 1 times [2022-07-12 18:31:27,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:31:27,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202082703] [2022-07-12 18:31:27,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:27,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:31:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:28,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:31:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:28,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:31:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:28,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:31:28,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:31:28,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202082703] [2022-07-12 18:31:28,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202082703] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:31:28,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:31:28,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:31:28,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507866820] [2022-07-12 18:31:28,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:31:28,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:31:28,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:31:28,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:31:28,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:31:28,032 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 18:31:28,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:31:28,158 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2022-07-12 18:31:28,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:31:28,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-12 18:31:28,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:31:28,163 INFO L225 Difference]: With dead ends: 106 [2022-07-12 18:31:28,163 INFO L226 Difference]: Without dead ends: 106 [2022-07-12 18:31:28,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:31:28,167 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 47 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:31:28,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 318 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:31:28,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-12 18:31:28,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 85. [2022-07-12 18:31:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.56) internal successors, (78), 67 states have internal predecessors, (78), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-12 18:31:28,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2022-07-12 18:31:28,193 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 22 [2022-07-12 18:31:28,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:31:28,193 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2022-07-12 18:31:28,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 18:31:28,195 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2022-07-12 18:31:28,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:31:28,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:31:28,197 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:31:28,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 18:31:28,197 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-12 18:31:28,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:31:28,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1832511589, now seen corresponding path program 1 times [2022-07-12 18:31:28,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:31:28,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725568318] [2022-07-12 18:31:28,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:28,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:31:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:28,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:31:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:28,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:31:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:28,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 18:31:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:28,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:31:28,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:31:28,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725568318] [2022-07-12 18:31:28,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725568318] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:31:28,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:31:28,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:31:28,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963083449] [2022-07-12 18:31:28,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:31:28,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:31:28,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:31:28,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:31:28,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:31:28,279 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 18:31:28,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:31:28,326 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-07-12 18:31:28,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:31:28,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-07-12 18:31:28,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:31:28,329 INFO L225 Difference]: With dead ends: 82 [2022-07-12 18:31:28,329 INFO L226 Difference]: Without dead ends: 82 [2022-07-12 18:31:28,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:31:28,331 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 22 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:31:28,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 129 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:31:28,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-12 18:31:28,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-07-12 18:31:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.5) internal successors, (75), 64 states have internal predecessors, (75), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-12 18:31:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-07-12 18:31:28,341 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 22 [2022-07-12 18:31:28,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:31:28,342 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-07-12 18:31:28,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 18:31:28,342 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-07-12 18:31:28,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:31:28,343 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:31:28,343 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:31:28,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 18:31:28,343 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-12 18:31:28,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:31:28,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1832511590, now seen corresponding path program 1 times [2022-07-12 18:31:28,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:31:28,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598573198] [2022-07-12 18:31:28,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:28,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:31:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:28,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:31:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:28,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:31:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:28,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 18:31:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:31:28,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:31:28,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598573198] [2022-07-12 18:31:28,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598573198] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:31:28,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:31:28,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:31:28,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998248850] [2022-07-12 18:31:28,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:31:28,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:31:28,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:31:28,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:31:28,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:31:28,457 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 18:31:28,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:31:28,543 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2022-07-12 18:31:28,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:31:28,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-07-12 18:31:28,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:31:28,545 INFO L225 Difference]: With dead ends: 80 [2022-07-12 18:31:28,545 INFO L226 Difference]: Without dead ends: 80 [2022-07-12 18:31:28,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:31:28,546 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 37 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:31:28,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 237 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:31:28,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-12 18:31:28,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-12 18:31:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.46) internal successors, (73), 62 states have internal predecessors, (73), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-12 18:31:28,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2022-07-12 18:31:28,550 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 22 [2022-07-12 18:31:28,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:31:28,550 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2022-07-12 18:31:28,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 18:31:28,551 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-07-12 18:31:28,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 18:31:28,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:31:28,551 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:31:28,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 18:31:28,552 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-12 18:31:28,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:31:28,552 INFO L85 PathProgramCache]: Analyzing trace with hash 107045159, now seen corresponding path program 1 times [2022-07-12 18:31:28,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:31:28,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450207421] [2022-07-12 18:31:28,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:28,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:31:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:28,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:31:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:28,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:31:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:28,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 18:31:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:28,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:31:28,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:31:28,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450207421] [2022-07-12 18:31:28,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450207421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:31:28,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:31:28,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:31:28,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785713767] [2022-07-12 18:31:28,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:31:28,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:31:28,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:31:28,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:31:28,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:31:28,670 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 18:31:28,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:31:28,780 INFO L93 Difference]: Finished difference Result 119 states and 151 transitions. [2022-07-12 18:31:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:31:28,780 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-07-12 18:31:28,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:31:28,781 INFO L225 Difference]: With dead ends: 119 [2022-07-12 18:31:28,781 INFO L226 Difference]: Without dead ends: 119 [2022-07-12 18:31:28,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:31:28,782 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 79 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:31:28,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 257 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:31:28,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-12 18:31:28,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 86. [2022-07-12 18:31:28,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 67 states have internal predecessors, (78), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-07-12 18:31:28,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2022-07-12 18:31:28,787 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 106 transitions. Word has length 24 [2022-07-12 18:31:28,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:31:28,787 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 106 transitions. [2022-07-12 18:31:28,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 18:31:28,787 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2022-07-12 18:31:28,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 18:31:28,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:31:28,788 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 18:31:28,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 18:31:28,788 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-12 18:31:28,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:31:28,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1801661154, now seen corresponding path program 1 times [2022-07-12 18:31:28,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:31:28,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330474181] [2022-07-12 18:31:28,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:28,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:31:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:28,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:31:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:28,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:31:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:28,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 18:31:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:28,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:31:28,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:31:28,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330474181] [2022-07-12 18:31:28,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330474181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:31:28,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:31:28,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 18:31:28,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719068166] [2022-07-12 18:31:28,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:31:28,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:31:28,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:31:28,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:31:28,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:31:28,888 INFO L87 Difference]: Start difference. First operand 86 states and 106 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 18:31:29,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:31:29,023 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2022-07-12 18:31:29,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:31:29,024 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-07-12 18:31:29,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:31:29,024 INFO L225 Difference]: With dead ends: 90 [2022-07-12 18:31:29,024 INFO L226 Difference]: Without dead ends: 90 [2022-07-12 18:31:29,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:31:29,025 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 43 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:31:29,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 412 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:31:29,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-12 18:31:29,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-12 18:31:29,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.396551724137931) internal successors, (81), 70 states have internal predecessors, (81), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-07-12 18:31:29,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2022-07-12 18:31:29,029 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 29 [2022-07-12 18:31:29,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:31:29,029 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2022-07-12 18:31:29,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 18:31:29,029 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2022-07-12 18:31:29,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 18:31:29,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:31:29,030 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:31:29,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 18:31:29,030 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-12 18:31:29,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:31:29,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1023324068, now seen corresponding path program 1 times [2022-07-12 18:31:29,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:31:29,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625249454] [2022-07-12 18:31:29,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:29,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:31:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:31:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:31:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 18:31:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 18:31:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 18:31:29,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:31:29,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625249454] [2022-07-12 18:31:29,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625249454] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:31:29,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:31:29,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:31:29,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561974575] [2022-07-12 18:31:29,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:31:29,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:31:29,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:31:29,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:31:29,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:31:29,111 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 18:31:29,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:31:29,292 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2022-07-12 18:31:29,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:31:29,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-07-12 18:31:29,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:31:29,295 INFO L225 Difference]: With dead ends: 110 [2022-07-12 18:31:29,295 INFO L226 Difference]: Without dead ends: 110 [2022-07-12 18:31:29,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:31:29,297 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 79 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:31:29,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 197 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:31:29,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-12 18:31:29,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 90. [2022-07-12 18:31:29,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 70 states have internal predecessors, (80), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-07-12 18:31:29,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2022-07-12 18:31:29,306 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 30 [2022-07-12 18:31:29,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:31:29,306 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2022-07-12 18:31:29,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 18:31:29,306 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2022-07-12 18:31:29,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 18:31:29,307 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:31:29,307 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:31:29,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 18:31:29,308 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-12 18:31:29,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:31:29,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1023324067, now seen corresponding path program 1 times [2022-07-12 18:31:29,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:31:29,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438460879] [2022-07-12 18:31:29,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:29,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:31:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:31:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:31:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 18:31:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 18:31:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,339 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 18:31:29,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:31:29,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438460879] [2022-07-12 18:31:29,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438460879] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:31:29,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:31:29,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:31:29,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121041149] [2022-07-12 18:31:29,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:31:29,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:31:29,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:31:29,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:31:29,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:31:29,341 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 18:31:29,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:31:29,408 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2022-07-12 18:31:29,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:31:29,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-07-12 18:31:29,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:31:29,409 INFO L225 Difference]: With dead ends: 86 [2022-07-12 18:31:29,409 INFO L226 Difference]: Without dead ends: 86 [2022-07-12 18:31:29,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:31:29,410 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 54 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:31:29,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 121 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:31:29,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-12 18:31:29,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-07-12 18:31:29,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 66 states have internal predecessors, (72), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-07-12 18:31:29,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2022-07-12 18:31:29,413 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 30 [2022-07-12 18:31:29,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:31:29,414 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2022-07-12 18:31:29,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 18:31:29,414 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2022-07-12 18:31:29,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 18:31:29,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:31:29,415 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:31:29,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 18:31:29,415 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-12 18:31:29,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:31:29,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1658275025, now seen corresponding path program 1 times [2022-07-12 18:31:29,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:31:29,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317352700] [2022-07-12 18:31:29,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:29,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:31:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:31:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:31:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 18:31:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 18:31:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 18:31:29,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:31:29,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317352700] [2022-07-12 18:31:29,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317352700] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:31:29,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:31:29,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:31:29,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891122434] [2022-07-12 18:31:29,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:31:29,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:31:29,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:31:29,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:31:29,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:31:29,516 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 18:31:29,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:31:29,700 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2022-07-12 18:31:29,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:31:29,700 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-07-12 18:31:29,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:31:29,701 INFO L225 Difference]: With dead ends: 99 [2022-07-12 18:31:29,701 INFO L226 Difference]: Without dead ends: 99 [2022-07-12 18:31:29,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:31:29,702 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 74 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:31:29,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 188 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:31:29,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-12 18:31:29,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2022-07-12 18:31:29,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 66 states have internal predecessors, (71), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-07-12 18:31:29,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2022-07-12 18:31:29,706 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 31 [2022-07-12 18:31:29,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:31:29,706 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2022-07-12 18:31:29,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 18:31:29,707 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2022-07-12 18:31:29,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 18:31:29,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:31:29,707 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:31:29,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 18:31:29,708 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-12 18:31:29,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:31:29,708 INFO L85 PathProgramCache]: Analyzing trace with hash 922787578, now seen corresponding path program 1 times [2022-07-12 18:31:29,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:31:29,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391854090] [2022-07-12 18:31:29,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:29,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:31:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:31:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:31:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 18:31:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 18:31:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:31:29,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:31:29,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391854090] [2022-07-12 18:31:29,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391854090] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:31:29,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:31:29,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:31:29,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299538458] [2022-07-12 18:31:29,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:31:29,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:31:29,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:31:29,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:31:29,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:31:29,738 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 18:31:29,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:31:29,755 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2022-07-12 18:31:29,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:31:29,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-07-12 18:31:29,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:31:29,756 INFO L225 Difference]: With dead ends: 85 [2022-07-12 18:31:29,756 INFO L226 Difference]: Without dead ends: 85 [2022-07-12 18:31:29,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:31:29,757 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 15 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:31:29,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 132 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:31:29,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-12 18:31:29,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-07-12 18:31:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.206896551724138) internal successors, (70), 65 states have internal predecessors, (70), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2022-07-12 18:31:29,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2022-07-12 18:31:29,760 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 32 [2022-07-12 18:31:29,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:31:29,761 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2022-07-12 18:31:29,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 18:31:29,761 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2022-07-12 18:31:29,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 18:31:29,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:31:29,762 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 18:31:29,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 18:31:29,762 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-12 18:31:29,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:31:29,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2035601245, now seen corresponding path program 1 times [2022-07-12 18:31:29,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:31:29,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071508969] [2022-07-12 18:31:29,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:29,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:31:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:31:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:31:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 18:31:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 18:31:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:31:29,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:31:29,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071508969] [2022-07-12 18:31:29,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071508969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:31:29,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:31:29,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:31:29,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512701921] [2022-07-12 18:31:29,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:31:29,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:31:29,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:31:29,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:31:29,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:31:29,801 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 18:31:29,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:31:29,838 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2022-07-12 18:31:29,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:31:29,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-07-12 18:31:29,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:31:29,839 INFO L225 Difference]: With dead ends: 84 [2022-07-12 18:31:29,839 INFO L226 Difference]: Without dead ends: 70 [2022-07-12 18:31:29,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:31:29,840 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 10 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:31:29,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 149 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:31:29,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-12 18:31:29,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-07-12 18:31:29,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 53 states have internal predecessors, (57), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-07-12 18:31:29,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2022-07-12 18:31:29,842 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 34 [2022-07-12 18:31:29,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:31:29,843 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2022-07-12 18:31:29,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 18:31:29,843 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2022-07-12 18:31:29,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 18:31:29,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:31:29,843 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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-12 18:31:29,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 18:31:29,844 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-12 18:31:29,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:31:29,844 INFO L85 PathProgramCache]: Analyzing trace with hash 287149833, now seen corresponding path program 1 times [2022-07-12 18:31:29,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:31:29,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467571476] [2022-07-12 18:31:29,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:29,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:31:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:31:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:31:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 18:31:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 18:31:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,919 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 18:31:29,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:31:29,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467571476] [2022-07-12 18:31:29,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467571476] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:31:29,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784820066] [2022-07-12 18:31:29,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:29,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:31:29,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:31:29,924 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:31:29,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 18:31:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:29,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 18:31:29,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:31:30,128 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 18:31:30,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:31:30,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784820066] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:31:30,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 18:31:30,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2022-07-12 18:31:30,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643133201] [2022-07-12 18:31:30,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:31:30,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:31:30,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:31:30,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:31:30,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:31:30,130 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 18:31:30,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:31:30,290 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2022-07-12 18:31:30,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:31:30,291 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2022-07-12 18:31:30,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:31:30,291 INFO L225 Difference]: With dead ends: 87 [2022-07-12 18:31:30,291 INFO L226 Difference]: Without dead ends: 87 [2022-07-12 18:31:30,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-12 18:31:30,292 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 81 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:31:30,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 222 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:31:30,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-12 18:31:30,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2022-07-12 18:31:30,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 56 states have internal predecessors, (60), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-07-12 18:31:30,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2022-07-12 18:31:30,295 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 39 [2022-07-12 18:31:30,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:31:30,295 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2022-07-12 18:31:30,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 18:31:30,295 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2022-07-12 18:31:30,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 18:31:30,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:31:30,295 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-07-12 18:31:30,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 18:31:30,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 18:31:30,525 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-12 18:31:30,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:31:30,525 INFO L85 PathProgramCache]: Analyzing trace with hash 285681908, now seen corresponding path program 1 times [2022-07-12 18:31:30,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:31:30,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640791852] [2022-07-12 18:31:30,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:30,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:31:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:30,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:31:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:30,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:31:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:30,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 18:31:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:30,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 18:31:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:30,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 18:31:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:30,629 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 18:31:30,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:31:30,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640791852] [2022-07-12 18:31:30,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640791852] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:31:30,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785941499] [2022-07-12 18:31:30,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:30,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:31:30,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:31:30,632 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:31:30,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 18:31:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:30,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 18:31:30,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:31:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 18:31:30,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:31:31,036 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 30 treesize of output 26 [2022-07-12 18:31:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 18:31:31,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785941499] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:31:31,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:31:31,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 22 [2022-07-12 18:31:31,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922469837] [2022-07-12 18:31:31,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:31:31,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 18:31:31,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:31:31,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 18:31:31,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2022-07-12 18:31:31,257 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 23 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 10 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2022-07-12 18:31:31,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:31:31,692 INFO L93 Difference]: Finished difference Result 148 states and 179 transitions. [2022-07-12 18:31:31,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 18:31:31,694 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 10 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) Word has length 39 [2022-07-12 18:31:31,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:31:31,694 INFO L225 Difference]: With dead ends: 148 [2022-07-12 18:31:31,694 INFO L226 Difference]: Without dead ends: 146 [2022-07-12 18:31:31,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 18:31:31,695 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 119 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:31:31,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 467 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 409 Invalid, 0 Unknown, 37 Unchecked, 0.2s Time] [2022-07-12 18:31:31,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-12 18:31:31,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2022-07-12 18:31:31,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 92 states have internal predecessors, (102), 22 states have call successors, (22), 10 states have call predecessors, (22), 12 states have return successors, (27), 19 states have call predecessors, (27), 22 states have call successors, (27) [2022-07-12 18:31:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 151 transitions. [2022-07-12 18:31:31,700 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 151 transitions. Word has length 39 [2022-07-12 18:31:31,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:31:31,700 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 151 transitions. [2022-07-12 18:31:31,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 10 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2022-07-12 18:31:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 151 transitions. [2022-07-12 18:31:31,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 18:31:31,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:31:31,701 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:31:31,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 18:31:31,907 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,SelfDestructingSolverStorable12 [2022-07-12 18:31:31,908 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-12 18:31:31,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:31:31,908 INFO L85 PathProgramCache]: Analyzing trace with hash -337593259, now seen corresponding path program 1 times [2022-07-12 18:31:31,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:31:31,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492149287] [2022-07-12 18:31:31,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:31,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:31:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:32,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:31:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:32,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:31:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:32,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 18:31:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:32,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 18:31:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:32,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 18:31:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 18:31:32,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:31:32,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492149287] [2022-07-12 18:31:32,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492149287] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:31:32,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554226040] [2022-07-12 18:31:32,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:32,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:31:32,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:31:32,046 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:31:32,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 18:31:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:32,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 18:31:32,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:31:32,386 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 18:31:32,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:31:32,567 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 31 treesize of output 27 [2022-07-12 18:31:32,692 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 18:31:32,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554226040] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:31:32,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:31:32,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 35 [2022-07-12 18:31:32,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564410838] [2022-07-12 18:31:32,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:31:32,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-12 18:31:32,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:31:32,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-12 18:31:32,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1133, Unknown=0, NotChecked=0, Total=1260 [2022-07-12 18:31:32,695 INFO L87 Difference]: Start difference. First operand 122 states and 151 transitions. Second operand has 36 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 10 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2022-07-12 18:31:33,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:31:33,992 INFO L93 Difference]: Finished difference Result 278 states and 351 transitions. [2022-07-12 18:31:33,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-12 18:31:33,993 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 10 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Word has length 41 [2022-07-12 18:31:33,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:31:33,994 INFO L225 Difference]: With dead ends: 278 [2022-07-12 18:31:33,994 INFO L226 Difference]: Without dead ends: 278 [2022-07-12 18:31:33,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=477, Invalid=3555, Unknown=0, NotChecked=0, Total=4032 [2022-07-12 18:31:33,995 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 317 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 258 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:31:33,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 733 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1013 Invalid, 0 Unknown, 258 Unchecked, 0.5s Time] [2022-07-12 18:31:33,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-07-12 18:31:34,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 167. [2022-07-12 18:31:34,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 116 states have (on average 1.2413793103448276) internal successors, (144), 127 states have internal predecessors, (144), 29 states have call successors, (29), 11 states have call predecessors, (29), 16 states have return successors, (45), 28 states have call predecessors, (45), 29 states have call successors, (45) [2022-07-12 18:31:34,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 218 transitions. [2022-07-12 18:31:34,002 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 218 transitions. Word has length 41 [2022-07-12 18:31:34,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:31:34,003 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 218 transitions. [2022-07-12 18:31:34,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 10 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2022-07-12 18:31:34,003 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 218 transitions. [2022-07-12 18:31:34,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 18:31:34,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:31:34,004 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1] [2022-07-12 18:31:34,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 18:31:34,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:31:34,208 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-12 18:31:34,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:31:34,208 INFO L85 PathProgramCache]: Analyzing trace with hash -525112999, now seen corresponding path program 1 times [2022-07-12 18:31:34,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:31:34,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981405148] [2022-07-12 18:31:34,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:34,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:31:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:34,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:31:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:34,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:31:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:34,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 18:31:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:34,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 18:31:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:34,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 18:31:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:34,302 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 18:31:34,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:31:34,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981405148] [2022-07-12 18:31:34,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981405148] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:31:34,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647769723] [2022-07-12 18:31:34,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:34,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:31:34,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:31:34,304 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:31:34,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 18:31:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:34,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 18:31:34,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:31:34,366 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 7 treesize of output 6 [2022-07-12 18:31:36,391 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_5 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_5))) is different from true [2022-07-12 18:31:38,414 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_6 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_6))) is different from true [2022-07-12 18:31:40,438 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_7 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_7))) is different from true [2022-07-12 18:31:40,488 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 29 treesize of output 23 [2022-07-12 18:31:40,564 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2022-07-12 18:31:40,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:31:42,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647769723] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:31:42,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:31:42,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 22 [2022-07-12 18:31:42,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919041167] [2022-07-12 18:31:42,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:31:42,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 18:31:42,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:31:42,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 18:31:42,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=492, Unknown=3, NotChecked=138, Total=702 [2022-07-12 18:31:42,673 INFO L87 Difference]: Start difference. First operand 167 states and 218 transitions. Second operand has 22 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 5 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 18:31:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:31:42,877 INFO L93 Difference]: Finished difference Result 169 states and 219 transitions. [2022-07-12 18:31:42,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 18:31:42,877 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 5 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 46 [2022-07-12 18:31:42,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:31:42,879 INFO L225 Difference]: With dead ends: 169 [2022-07-12 18:31:42,879 INFO L226 Difference]: Without dead ends: 169 [2022-07-12 18:31:42,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=125, Invalid=814, Unknown=3, NotChecked=180, Total=1122 [2022-07-12 18:31:42,880 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 49 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 282 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:31:42,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 308 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 253 Invalid, 0 Unknown, 282 Unchecked, 0.1s Time] [2022-07-12 18:31:42,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-12 18:31:42,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-07-12 18:31:42,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 118 states have (on average 1.228813559322034) internal successors, (145), 128 states have internal predecessors, (145), 29 states have call successors, (29), 12 states have call predecessors, (29), 17 states have return successors, (45), 28 states have call predecessors, (45), 29 states have call successors, (45) [2022-07-12 18:31:42,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 219 transitions. [2022-07-12 18:31:42,885 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 219 transitions. Word has length 46 [2022-07-12 18:31:42,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:31:42,885 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 219 transitions. [2022-07-12 18:31:42,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 5 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 18:31:42,886 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 219 transitions. [2022-07-12 18:31:42,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-12 18:31:42,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:31:42,886 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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-12 18:31:42,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 18:31:43,099 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,SelfDestructingSolverStorable14 [2022-07-12 18:31:43,099 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-12 18:31:43,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:31:43,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1395918346, now seen corresponding path program 1 times [2022-07-12 18:31:43,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:31:43,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720240235] [2022-07-12 18:31:43,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:43,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:31:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:43,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:31:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:43,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:31:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:43,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 18:31:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:43,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 18:31:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:43,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 18:31:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:43,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 18:31:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:43,228 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-12 18:31:43,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:31:43,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720240235] [2022-07-12 18:31:43,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720240235] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:31:43,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008795233] [2022-07-12 18:31:43,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:43,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:31:43,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:31:43,230 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:31:43,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 18:31:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:43,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 18:31:43,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:31:43,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:31:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 18:31:43,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:31:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-12 18:31:43,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008795233] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:31:43,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:31:43,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2022-07-12 18:31:43,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132211555] [2022-07-12 18:31:43,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:31:43,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 18:31:43,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:31:43,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 18:31:43,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-07-12 18:31:43,840 INFO L87 Difference]: Start difference. First operand 169 states and 219 transitions. Second operand has 22 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 11 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-12 18:31:44,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:31:44,279 INFO L93 Difference]: Finished difference Result 244 states and 312 transitions. [2022-07-12 18:31:44,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:31:44,279 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 11 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 47 [2022-07-12 18:31:44,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:31:44,280 INFO L225 Difference]: With dead ends: 244 [2022-07-12 18:31:44,280 INFO L226 Difference]: Without dead ends: 244 [2022-07-12 18:31:44,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 86 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=707, Unknown=0, NotChecked=0, Total=870 [2022-07-12 18:31:44,281 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 218 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:31:44,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 352 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 476 Invalid, 0 Unknown, 58 Unchecked, 0.3s Time] [2022-07-12 18:31:44,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-12 18:31:44,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 172. [2022-07-12 18:31:44,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 121 states have (on average 1.1983471074380165) internal successors, (145), 130 states have internal predecessors, (145), 29 states have call successors, (29), 13 states have call predecessors, (29), 18 states have return successors, (45), 28 states have call predecessors, (45), 29 states have call successors, (45) [2022-07-12 18:31:44,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 219 transitions. [2022-07-12 18:31:44,287 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 219 transitions. Word has length 47 [2022-07-12 18:31:44,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:31:44,287 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 219 transitions. [2022-07-12 18:31:44,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 11 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-12 18:31:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 219 transitions. [2022-07-12 18:31:44,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 18:31:44,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:31:44,288 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:31:44,304 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-12 18:31:44,495 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,SelfDestructingSolverStorable15 [2022-07-12 18:31:44,495 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-12 18:31:44,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:31:44,496 INFO L85 PathProgramCache]: Analyzing trace with hash 323795755, now seen corresponding path program 1 times [2022-07-12 18:31:44,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:31:44,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846464181] [2022-07-12 18:31:44,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:44,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:31:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:44,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:31:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:44,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:31:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:44,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 18:31:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:44,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 18:31:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:44,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 18:31:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:44,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 18:31:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:44,610 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-12 18:31:44,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:31:44,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846464181] [2022-07-12 18:31:44,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846464181] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:31:44,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528941673] [2022-07-12 18:31:44,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:44,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:31:44,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:31:44,612 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-12 18:31:44,613 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-12 18:31:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:44,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-12 18:31:44,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:31:44,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:31:44,893 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 18:31:44,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:31:45,229 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-12 18:31:45,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528941673] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:31:45,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:31:45,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-07-12 18:31:45,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692972750] [2022-07-12 18:31:45,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:31:45,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 18:31:45,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:31:45,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 18:31:45,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-07-12 18:31:45,231 INFO L87 Difference]: Start difference. First operand 172 states and 219 transitions. Second operand has 23 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-12 18:31:45,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:31:45,866 INFO L93 Difference]: Finished difference Result 273 states and 335 transitions. [2022-07-12 18:31:45,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 18:31:45,867 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 48 [2022-07-12 18:31:45,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:31:45,868 INFO L225 Difference]: With dead ends: 273 [2022-07-12 18:31:45,868 INFO L226 Difference]: Without dead ends: 273 [2022-07-12 18:31:45,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 89 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2022-07-12 18:31:45,868 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 294 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:31:45,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 484 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 641 Invalid, 0 Unknown, 72 Unchecked, 0.4s Time] [2022-07-12 18:31:45,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-07-12 18:31:45,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 178. [2022-07-12 18:31:45,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 128 states have (on average 1.171875) internal successors, (150), 134 states have internal predecessors, (150), 28 states have call successors, (28), 15 states have call predecessors, (28), 19 states have return successors, (38), 28 states have call predecessors, (38), 28 states have call successors, (38) [2022-07-12 18:31:45,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 216 transitions. [2022-07-12 18:31:45,874 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 216 transitions. Word has length 48 [2022-07-12 18:31:45,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:31:45,874 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 216 transitions. [2022-07-12 18:31:45,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (19), 7 states have call predecessors, (19), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-12 18:31:45,874 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 216 transitions. [2022-07-12 18:31:45,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-12 18:31:45,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:31:45,875 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1] [2022-07-12 18:31:45,894 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-12 18:31:46,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 18:31:46,087 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-12 18:31:46,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:31:46,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2076994669, now seen corresponding path program 1 times [2022-07-12 18:31:46,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:31:46,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89446138] [2022-07-12 18:31:46,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:46,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:31:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:46,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:31:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:46,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:31:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:46,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 18:31:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:46,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:31:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:46,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 18:31:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:46,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 18:31:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:46,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 18:31:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-12 18:31:46,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:31:46,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89446138] [2022-07-12 18:31:46,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89446138] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:31:46,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435498985] [2022-07-12 18:31:46,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:46,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:31:46,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:31:46,278 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-12 18:31:46,279 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-12 18:31:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:46,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-12 18:31:46,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:31:46,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:31:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-12 18:31:46,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:31:46,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435498985] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:31:46,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:31:46,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2022-07-12 18:31:46,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620934428] [2022-07-12 18:31:46,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:31:46,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 18:31:46,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:31:46,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 18:31:46,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2022-07-12 18:31:46,915 INFO L87 Difference]: Start difference. First operand 178 states and 216 transitions. Second operand has 20 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 8 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2022-07-12 18:31:47,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:31:47,626 INFO L93 Difference]: Finished difference Result 369 states and 470 transitions. [2022-07-12 18:31:47,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 18:31:47,627 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 8 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 54 [2022-07-12 18:31:47,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:31:47,628 INFO L225 Difference]: With dead ends: 369 [2022-07-12 18:31:47,628 INFO L226 Difference]: Without dead ends: 346 [2022-07-12 18:31:47,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=1591, Unknown=0, NotChecked=0, Total=1806 [2022-07-12 18:31:47,629 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 127 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:31:47,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 769 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:31:47,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-07-12 18:31:47,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 234. [2022-07-12 18:31:47,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 176 states have (on average 1.1818181818181819) internal successors, (208), 177 states have internal predecessors, (208), 32 states have call successors, (32), 15 states have call predecessors, (32), 23 states have return successors, (51), 41 states have call predecessors, (51), 32 states have call successors, (51) [2022-07-12 18:31:47,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 291 transitions. [2022-07-12 18:31:47,635 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 291 transitions. Word has length 54 [2022-07-12 18:31:47,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:31:47,636 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 291 transitions. [2022-07-12 18:31:47,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 8 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2022-07-12 18:31:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 291 transitions. [2022-07-12 18:31:47,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-12 18:31:47,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:31:47,636 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1] [2022-07-12 18:31:47,655 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-12 18:31:47,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:31:47,837 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-12 18:31:47,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:31:47,837 INFO L85 PathProgramCache]: Analyzing trace with hash 412534293, now seen corresponding path program 1 times [2022-07-12 18:31:47,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:31:47,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081559891] [2022-07-12 18:31:47,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:47,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:31:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:47,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:31:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:47,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:31:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:47,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 18:31:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:48,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:31:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:48,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 18:31:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:48,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 18:31:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:48,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 18:31:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:48,029 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-12 18:31:48,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:31:48,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081559891] [2022-07-12 18:31:48,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081559891] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:31:48,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333445371] [2022-07-12 18:31:48,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:31:48,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:31:48,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:31:48,031 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-12 18:31:48,032 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-12 18:31:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:31:48,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:31:48,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:31:48,081 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 7 treesize of output 6 [2022-07-12 18:31:50,089 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6| Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_6|))) is different from true [2022-07-12 18:32:48,507 WARN L233 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:33:04,605 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:33:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2022-07-12 18:33:04,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:33:06,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333445371] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:33:06,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:33:06,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 18 [2022-07-12 18:33:06,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993460143] [2022-07-12 18:33:06,690 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:33:06,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 18:33:06,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:06,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 18:33:06,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=236, Unknown=26, NotChecked=32, Total=342 [2022-07-12 18:33:06,691 INFO L87 Difference]: Start difference. First operand 234 states and 291 transitions. Second operand has 18 states, 16 states have (on average 3.5) internal successors, (56), 18 states have internal predecessors, (56), 8 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2022-07-12 18:33:16,783 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 43 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:33:36,888 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification. DAG size of input: 32 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:33:57,006 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification. DAG size of input: 38 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:33:57,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:57,065 INFO L93 Difference]: Finished difference Result 345 states and 437 transitions. [2022-07-12 18:33:57,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 18:33:57,065 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.5) internal successors, (56), 18 states have internal predecessors, (56), 8 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 54 [2022-07-12 18:33:57,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:57,066 INFO L225 Difference]: With dead ends: 345 [2022-07-12 18:33:57,066 INFO L226 Difference]: Without dead ends: 329 [2022-07-12 18:33:57,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 128.8s TimeCoverageRelationStatistics Valid=85, Invalid=481, Unknown=38, NotChecked=46, Total=650 [2022-07-12 18:33:57,067 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 40 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 264 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:57,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 326 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 264 Unchecked, 0.1s Time] [2022-07-12 18:33:57,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-07-12 18:33:57,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 232. [2022-07-12 18:33:57,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 174 states have (on average 1.1781609195402298) internal successors, (205), 175 states have internal predecessors, (205), 32 states have call successors, (32), 16 states have call predecessors, (32), 23 states have return successors, (50), 40 states have call predecessors, (50), 32 states have call successors, (50) [2022-07-12 18:33:57,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 287 transitions. [2022-07-12 18:33:57,079 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 287 transitions. Word has length 54 [2022-07-12 18:33:57,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:57,079 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 287 transitions. [2022-07-12 18:33:57,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.5) internal successors, (56), 18 states have internal predecessors, (56), 8 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2022-07-12 18:33:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 287 transitions. [2022-07-12 18:33:57,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-12 18:33:57,080 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:57,080 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:57,115 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-12 18:33:57,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:33:57,281 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-12 18:33:57,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:57,281 INFO L85 PathProgramCache]: Analyzing trace with hash 806764368, now seen corresponding path program 1 times [2022-07-12 18:33:57,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:57,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585195319] [2022-07-12 18:33:57,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:57,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:57,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:33:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:57,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:33:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:57,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 18:33:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:57,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 18:33:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:57,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 18:33:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:57,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 18:33:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:57,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 18:33:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:57,356 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-12 18:33:57,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:57,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585195319] [2022-07-12 18:33:57,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585195319] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:33:57,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562953521] [2022-07-12 18:33:57,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:57,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:33:57,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:33:57,358 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-12 18:33:57,359 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-12 18:33:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:57,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:33:57,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:57,415 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 7 treesize of output 6 [2022-07-12 18:33:59,429 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_28 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_28))) is different from true [2022-07-12 18:34:01,447 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_29 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_29))) is different from true [2022-07-12 18:34:01,474 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 29 treesize of output 23 [2022-07-12 18:34:01,486 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 18:34:01,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:34:01,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562953521] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:34:01,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 18:34:01,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 13 [2022-07-12 18:34:01,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837408383] [2022-07-12 18:34:01,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:34:01,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:34:01,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:01,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:34:01,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=89, Unknown=2, NotChecked=38, Total=156 [2022-07-12 18:34:01,488 INFO L87 Difference]: Start difference. First operand 232 states and 287 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-12 18:34:01,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:01,525 INFO L93 Difference]: Finished difference Result 187 states and 225 transitions. [2022-07-12 18:34:01,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:34:01,526 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 56 [2022-07-12 18:34:01,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:01,526 INFO L225 Difference]: With dead ends: 187 [2022-07-12 18:34:01,526 INFO L226 Difference]: Without dead ends: 187 [2022-07-12 18:34:01,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=36, Invalid=126, Unknown=2, NotChecked=46, Total=210 [2022-07-12 18:34:01,527 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 12 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:01,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 204 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 155 Unchecked, 0.0s Time] [2022-07-12 18:34:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-12 18:34:01,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-12 18:34:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 140 states have (on average 1.1571428571428573) internal successors, (162), 141 states have internal predecessors, (162), 25 states have call successors, (25), 13 states have call predecessors, (25), 19 states have return successors, (38), 32 states have call predecessors, (38), 25 states have call successors, (38) [2022-07-12 18:34:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 225 transitions. [2022-07-12 18:34:01,531 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 225 transitions. Word has length 56 [2022-07-12 18:34:01,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:01,532 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 225 transitions. [2022-07-12 18:34:01,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-12 18:34:01,532 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 225 transitions. [2022-07-12 18:34:01,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 18:34:01,532 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:01,533 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:34:01,548 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-12 18:34:01,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:34:01,749 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-12 18:34:01,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:01,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1896699969, now seen corresponding path program 1 times [2022-07-12 18:34:01,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:01,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879381042] [2022-07-12 18:34:01,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:01,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:01,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:34:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:01,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:34:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:01,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 18:34:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:01,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 18:34:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:01,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 18:34:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:01,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:34:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:01,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 18:34:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:01,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 18:34:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:01,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 18:34:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:01,978 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-12 18:34:01,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:01,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879381042] [2022-07-12 18:34:01,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879381042] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:34:01,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896373258] [2022-07-12 18:34:01,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:01,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:34:01,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:34:01,984 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-12 18:34:01,987 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-12 18:34:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:02,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-12 18:34:02,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:34:02,346 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 18:34:02,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:34:02,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896373258] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:34:02,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:34:02,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2022-07-12 18:34:02,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128955798] [2022-07-12 18:34:02,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:34:02,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 18:34:02,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:02,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 18:34:02,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2022-07-12 18:34:02,791 INFO L87 Difference]: Start difference. First operand 187 states and 225 transitions. Second operand has 30 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 25 states have internal predecessors, (57), 12 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (15), 9 states have call predecessors, (15), 10 states have call successors, (15) [2022-07-12 18:34:04,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:04,230 INFO L93 Difference]: Finished difference Result 263 states and 321 transitions. [2022-07-12 18:34:04,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-12 18:34:04,230 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 25 states have internal predecessors, (57), 12 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (15), 9 states have call predecessors, (15), 10 states have call successors, (15) Word has length 71 [2022-07-12 18:34:04,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:04,231 INFO L225 Difference]: With dead ends: 263 [2022-07-12 18:34:04,231 INFO L226 Difference]: Without dead ends: 234 [2022-07-12 18:34:04,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=441, Invalid=2981, Unknown=0, NotChecked=0, Total=3422 [2022-07-12 18:34:04,233 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 308 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:04,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 736 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:34:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-12 18:34:04,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 170. [2022-07-12 18:34:04,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 127 states have (on average 1.1574803149606299) internal successors, (147), 127 states have internal predecessors, (147), 24 states have call successors, (24), 13 states have call predecessors, (24), 16 states have return successors, (32), 29 states have call predecessors, (32), 24 states have call successors, (32) [2022-07-12 18:34:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2022-07-12 18:34:04,239 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 71 [2022-07-12 18:34:04,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:04,239 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2022-07-12 18:34:04,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 25 states have internal predecessors, (57), 12 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (15), 9 states have call predecessors, (15), 10 states have call successors, (15) [2022-07-12 18:34:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2022-07-12 18:34:04,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 18:34:04,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:04,241 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:34:04,259 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-12 18:34:04,447 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,SelfDestructingSolverStorable20 [2022-07-12 18:34:04,447 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-12 18:34:04,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:04,448 INFO L85 PathProgramCache]: Analyzing trace with hash 91261635, now seen corresponding path program 1 times [2022-07-12 18:34:04,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:04,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241844327] [2022-07-12 18:34:04,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:04,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:04,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:34:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:04,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:34:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:04,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 18:34:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:04,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 18:34:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:04,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 18:34:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:04,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:34:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:04,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 18:34:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:04,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 18:34:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:04,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 18:34:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:04,675 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 18:34:04,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:04,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241844327] [2022-07-12 18:34:04,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241844327] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:34:04,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70367136] [2022-07-12 18:34:04,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:04,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:34:04,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:34:04,684 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-12 18:34:04,692 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-12 18:34:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:04,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 18:34:04,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:34:05,021 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 18:34:05,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:34:05,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70367136] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:34:05,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:34:05,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 27 [2022-07-12 18:34:05,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340899491] [2022-07-12 18:34:05,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:34:05,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-12 18:34:05,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:05,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-12 18:34:05,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=959, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 18:34:05,472 INFO L87 Difference]: Start difference. First operand 170 states and 203 transitions. Second operand has 28 states, 22 states have (on average 2.5) internal successors, (55), 23 states have internal predecessors, (55), 11 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-07-12 18:34:06,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:06,551 INFO L93 Difference]: Finished difference Result 232 states and 281 transitions. [2022-07-12 18:34:06,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 18:34:06,551 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 22 states have (on average 2.5) internal successors, (55), 23 states have internal predecessors, (55), 11 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) Word has length 71 [2022-07-12 18:34:06,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:06,552 INFO L225 Difference]: With dead ends: 232 [2022-07-12 18:34:06,552 INFO L226 Difference]: Without dead ends: 232 [2022-07-12 18:34:06,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=381, Invalid=2481, Unknown=0, NotChecked=0, Total=2862 [2022-07-12 18:34:06,554 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 239 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:06,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 550 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 18:34:06,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-12 18:34:06,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 170. [2022-07-12 18:34:06,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 127 states have (on average 1.1496062992125984) internal successors, (146), 127 states have internal predecessors, (146), 24 states have call successors, (24), 13 states have call predecessors, (24), 16 states have return successors, (32), 29 states have call predecessors, (32), 24 states have call successors, (32) [2022-07-12 18:34:06,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 202 transitions. [2022-07-12 18:34:06,559 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 202 transitions. Word has length 71 [2022-07-12 18:34:06,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:06,560 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 202 transitions. [2022-07-12 18:34:06,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 22 states have (on average 2.5) internal successors, (55), 23 states have internal predecessors, (55), 11 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-07-12 18:34:06,560 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 202 transitions. [2022-07-12 18:34:06,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-12 18:34:06,562 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:34:06,562 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:34:06,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 18:34:06,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-12 18:34:06,782 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-07-12 18:34:06,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:34:06,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1341702710, now seen corresponding path program 2 times [2022-07-12 18:34:06,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:34:06,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497495809] [2022-07-12 18:34:06,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:34:06,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:34:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:06,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 18:34:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:06,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 18:34:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:06,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 18:34:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:06,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 18:34:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:06,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 18:34:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:06,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 18:34:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:06,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 18:34:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:06,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 18:34:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:06,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 18:34:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:34:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-12 18:34:06,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:34:06,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497495809] [2022-07-12 18:34:06,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497495809] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:34:06,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718807891] [2022-07-12 18:34:06,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:34:06,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:34:06,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:34:06,853 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:34:06,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 18:34:06,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:34:06,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:34:06,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 18:34:06,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:34:06,918 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 7 treesize of output 6 [2022-07-12 18:34:08,937 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_34 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_34))) is different from true [2022-07-12 18:34:10,951 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_35 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_35))) is different from true [2022-07-12 18:34:12,972 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_37 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_37))) is different from true [2022-07-12 18:34:14,987 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_38 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_38))) is different from true [2022-07-12 18:34:15,013 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 29 treesize of output 23 [2022-07-12 18:34:15,028 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 63 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 8 not checked. [2022-07-12 18:34:15,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:34:17,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718807891] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:34:17,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:34:17,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 15 [2022-07-12 18:34:17,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650461624] [2022-07-12 18:34:17,083 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:34:17,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 18:34:17,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:34:17,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 18:34:17,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=152, Unknown=4, NotChecked=108, Total=306 [2022-07-12 18:34:17,084 INFO L87 Difference]: Start difference. First operand 170 states and 202 transitions. Second operand has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 5 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-12 18:34:19,111 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_check_~a.base_BEFORE_CALL_37 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_37))) (exists ((v_check_~a.base_BEFORE_CALL_34 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_34)))) is different from true [2022-07-12 18:34:21,116 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_check_~a.base_BEFORE_CALL_38 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_38))) (exists ((v_check_~a.base_BEFORE_CALL_35 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_35)))) is different from true [2022-07-12 18:34:21,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:34:21,147 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2022-07-12 18:34:21,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:34:21,148 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 5 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 73 [2022-07-12 18:34:21,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:34:21,148 INFO L225 Difference]: With dead ends: 46 [2022-07-12 18:34:21,148 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 18:34:21,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 111 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=76, Invalid=248, Unknown=6, NotChecked=222, Total=552 [2022-07-12 18:34:21,149 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:34:21,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 121 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 152 Unchecked, 0.0s Time] [2022-07-12 18:34:21,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 18:34:21,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 18:34:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:34:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 18:34:21,151 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2022-07-12 18:34:21,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:34:21,151 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 18:34:21,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 5 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-12 18:34:21,151 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 18:34:21,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 18:34:21,153 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining) [2022-07-12 18:34:21,154 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2022-07-12 18:34:21,154 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2022-07-12 18:34:21,154 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2022-07-12 18:34:21,154 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (12 of 17 remaining) [2022-07-12 18:34:21,154 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (11 of 17 remaining) [2022-07-12 18:34:21,154 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (10 of 17 remaining) [2022-07-12 18:34:21,154 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (9 of 17 remaining) [2022-07-12 18:34:21,154 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2022-07-12 18:34:21,155 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2022-07-12 18:34:21,155 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2022-07-12 18:34:21,155 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2022-07-12 18:34:21,155 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 17 remaining) [2022-07-12 18:34:21,155 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2022-07-12 18:34:21,155 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2022-07-12 18:34:21,155 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2022-07-12 18:34:21,156 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2022-07-12 18:34:21,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 18:34:21,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-12 18:34:21,374 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:34:21,376 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 18:34:21,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:34:21 BoogieIcfgContainer [2022-07-12 18:34:21,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 18:34:21,378 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 18:34:21,378 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 18:34:21,378 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 18:34:21,379 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:31:27" (3/4) ... [2022-07-12 18:34:21,381 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 18:34:21,385 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-12 18:34:21,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2022-07-12 18:34:21,386 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-12 18:34:21,389 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2022-07-12 18:34:21,389 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-07-12 18:34:21,390 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-12 18:34:21,390 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 18:34:21,420 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 18:34:21,420 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 18:34:21,423 INFO L158 Benchmark]: Toolchain (without parser) took 174404.32ms. Allocated memory was 94.4MB in the beginning and 174.1MB in the end (delta: 79.7MB). Free memory was 64.8MB in the beginning and 88.5MB in the end (delta: -23.7MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. [2022-07-12 18:34:21,423 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 94.4MB. Free memory was 50.3MB in the beginning and 50.3MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:34:21,425 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.85ms. Allocated memory was 94.4MB in the beginning and 119.5MB in the end (delta: 25.2MB). Free memory was 64.6MB in the beginning and 94.4MB in the end (delta: -29.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 18:34:21,425 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.54ms. Allocated memory is still 119.5MB. Free memory was 94.4MB in the beginning and 92.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:34:21,427 INFO L158 Benchmark]: Boogie Preprocessor took 32.73ms. Allocated memory is still 119.5MB. Free memory was 92.7MB in the beginning and 91.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:34:21,427 INFO L158 Benchmark]: RCFGBuilder took 257.46ms. Allocated memory is still 119.5MB. Free memory was 91.3MB in the beginning and 78.1MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 18:34:21,427 INFO L158 Benchmark]: TraceAbstraction took 173801.37ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 77.6MB in the beginning and 91.7MB in the end (delta: -14.1MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2022-07-12 18:34:21,428 INFO L158 Benchmark]: Witness Printer took 41.81ms. Allocated memory is still 174.1MB. Free memory was 91.7MB in the beginning and 88.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 18:34:21,428 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 94.4MB. Free memory was 50.3MB in the beginning and 50.3MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.85ms. Allocated memory was 94.4MB in the beginning and 119.5MB in the end (delta: 25.2MB). Free memory was 64.6MB in the beginning and 94.4MB in the end (delta: -29.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.54ms. Allocated memory is still 119.5MB. Free memory was 94.4MB in the beginning and 92.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.73ms. Allocated memory is still 119.5MB. Free memory was 92.7MB in the beginning and 91.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 257.46ms. Allocated memory is still 119.5MB. Free memory was 91.3MB in the beginning and 78.1MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 173801.37ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 77.6MB in the beginning and 91.7MB in the end (delta: -14.1MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. * Witness Printer took 41.81ms. Allocated memory is still 174.1MB. Free memory was 91.7MB in the beginning and 88.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 40]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 64 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 173.8s, OverallIterations: 23, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 62.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2287 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2270 mSDsluCounter, 7482 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1278 IncrementalHoareTripleChecker+Unchecked, 6305 mSDsCounter, 931 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6866 IncrementalHoareTripleChecker+Invalid, 9075 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 931 mSolverCounterUnsat, 1177 mSDtfsCounter, 6866 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1493 GetRequests, 968 SyntacticMatches, 39 SemanticMatches, 486 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 2945 ImplicationChecksByTransitivity, 161.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=18, InterpolantAutomatonStates: 304, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 737 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 107.9s InterpolantComputationTime, 1576 NumberOfCodeBlocks, 1576 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1712 ConstructedInterpolants, 105 QuantifiedInterpolants, 10108 SizeOfPredicates, 110 NumberOfNonLiveVariables, 2699 ConjunctsInSsa, 280 ConjunctsInUnsatCore, 39 InterpolantComputations, 13 PerfectInterpolantSequences, 804/977 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-07-12 18:34:21,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE