./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/dll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/bin/uautomizer-j4sWxH34Be/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-01-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/bin/uautomizer-j4sWxH34Be/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/bin/uautomizer-j4sWxH34Be --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd9f812dd0592e9d2894b2831060b27794691dcfdafe5c5494c28350656b71ee ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 19:06:04,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 19:06:04,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 19:06:04,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 19:06:04,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 19:06:04,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 19:06:04,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 19:06:04,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 19:06:04,343 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 19:06:04,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 19:06:04,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 19:06:04,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 19:06:04,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 19:06:04,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 19:06:04,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 19:06:04,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 19:06:04,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 19:06:04,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 19:06:04,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 19:06:04,360 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 19:06:04,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 19:06:04,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 19:06:04,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 19:06:04,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 19:06:04,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 19:06:04,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 19:06:04,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 19:06:04,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 19:06:04,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 19:06:04,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 19:06:04,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 19:06:04,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 19:06:04,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 19:06:04,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 19:06:04,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 19:06:04,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 19:06:04,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 19:06:04,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 19:06:04,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 19:06:04,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 19:06:04,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 19:06:04,389 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/bin/uautomizer-j4sWxH34Be/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-10-21 19:06:04,434 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 19:06:04,434 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 19:06:04,434 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 19:06:04,435 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 19:06:04,436 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 19:06:04,436 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 19:06:04,437 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 19:06:04,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 19:06:04,437 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 19:06:04,438 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-21 19:06:04,438 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 19:06:04,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 19:06:04,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 19:06:04,439 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-21 19:06:04,439 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-21 19:06:04,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 19:06:04,440 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-21 19:06:04,440 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 19:06:04,440 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 19:06:04,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 19:06:04,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 19:06:04,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 19:06:04,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:06:04,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 19:06:04,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 19:06:04,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 19:06:04,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-21 19:06:04,442 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 19:06:04,442 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/bin/uautomizer-j4sWxH34Be/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/bin/uautomizer-j4sWxH34Be Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dd9f812dd0592e9d2894b2831060b27794691dcfdafe5c5494c28350656b71ee [2021-10-21 19:06:04,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 19:06:04,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 19:06:04,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 19:06:04,722 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 19:06:04,722 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 19:06:04,723 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/forester-heap/dll-01-1.i [2021-10-21 19:06:04,781 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/bin/uautomizer-j4sWxH34Be/data/cb2453528/b389454ceb794923a1068857d7311dbe/FLAG36224f033 [2021-10-21 19:06:05,271 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 19:06:05,272 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i [2021-10-21 19:06:05,305 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/bin/uautomizer-j4sWxH34Be/data/cb2453528/b389454ceb794923a1068857d7311dbe/FLAG36224f033 [2021-10-21 19:06:05,608 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/bin/uautomizer-j4sWxH34Be/data/cb2453528/b389454ceb794923a1068857d7311dbe [2021-10-21 19:06:05,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 19:06:05,611 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-21 19:06:05,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 19:06:05,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 19:06:05,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 19:06:05,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:06:05" (1/1) ... [2021-10-21 19:06:05,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@274e9253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:06:05, skipping insertion in model container [2021-10-21 19:06:05,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:06:05" (1/1) ... [2021-10-21 19:06:05,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 19:06:05,675 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 19:06:06,066 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[22080,22093] [2021-10-21 19:06:06,084 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[22353,22366] [2021-10-21 19:06:06,087 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[22587,22600] [2021-10-21 19:06:06,088 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[22657,22670] [2021-10-21 19:06:06,092 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[22924,22937] [2021-10-21 19:06:06,093 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[23032,23045] [2021-10-21 19:06:06,099 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[23263,23276] [2021-10-21 19:06:06,101 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[23343,23356] [2021-10-21 19:06:06,103 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[23422,23435] [2021-10-21 19:06:06,105 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[23512,23525] [2021-10-21 19:06:06,107 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[23690,23703] [2021-10-21 19:06:06,108 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[23768,23781] [2021-10-21 19:06:06,111 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[23845,23858] [2021-10-21 19:06:06,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:06:06,134 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 19:06:06,188 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[22080,22093] [2021-10-21 19:06:06,195 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[22353,22366] [2021-10-21 19:06:06,197 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[22587,22600] [2021-10-21 19:06:06,199 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[22657,22670] [2021-10-21 19:06:06,202 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[22924,22937] [2021-10-21 19:06:06,204 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[23032,23045] [2021-10-21 19:06:06,207 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[23263,23276] [2021-10-21 19:06:06,209 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[23343,23356] [2021-10-21 19:06:06,210 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[23422,23435] [2021-10-21 19:06:06,213 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[23512,23525] [2021-10-21 19:06:06,215 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[23690,23703] [2021-10-21 19:06:06,217 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[23768,23781] [2021-10-21 19:06:06,218 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/sv-benchmarks/c/forester-heap/dll-01-1.i[23845,23858] [2021-10-21 19:06:06,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:06:06,266 INFO L208 MainTranslator]: Completed translation [2021-10-21 19:06:06,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:06:06 WrapperNode [2021-10-21 19:06:06,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 19:06:06,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 19:06:06,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 19:06:06,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 19:06:06,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:06:06" (1/1) ... [2021-10-21 19:06:06,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:06:06" (1/1) ... [2021-10-21 19:06:06,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:06:06" (1/1) ... [2021-10-21 19:06:06,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:06:06" (1/1) ... [2021-10-21 19:06:06,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:06:06" (1/1) ... [2021-10-21 19:06:06,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:06:06" (1/1) ... [2021-10-21 19:06:06,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:06:06" (1/1) ... [2021-10-21 19:06:06,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 19:06:06,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 19:06:06,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 19:06:06,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 19:06:06,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:06:06" (1/1) ... [2021-10-21 19:06:06,356 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:06:06,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:06:06,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 19:06:06,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 19:06:06,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-10-21 19:06:06,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 19:06:06,410 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-10-21 19:06:06,410 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-10-21 19:06:06,410 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-10-21 19:06:06,410 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-10-21 19:06:06,410 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-10-21 19:06:06,410 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-10-21 19:06:06,411 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-10-21 19:06:06,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-10-21 19:06:06,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-10-21 19:06:06,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-10-21 19:06:06,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-10-21 19:06:06,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-10-21 19:06:06,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-10-21 19:06:06,412 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-10-21 19:06:06,412 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-10-21 19:06:06,412 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-10-21 19:06:06,412 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-10-21 19:06:06,412 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-10-21 19:06:06,412 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-10-21 19:06:06,412 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-10-21 19:06:06,412 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-10-21 19:06:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-10-21 19:06:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-10-21 19:06:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-10-21 19:06:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-10-21 19:06:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-10-21 19:06:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-10-21 19:06:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-10-21 19:06:06,414 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-10-21 19:06:06,414 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-10-21 19:06:06,414 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-10-21 19:06:06,414 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-10-21 19:06:06,414 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-10-21 19:06:06,414 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-10-21 19:06:06,414 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-10-21 19:06:06,414 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-10-21 19:06:06,415 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-10-21 19:06:06,415 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-10-21 19:06:06,415 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-10-21 19:06:06,415 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-10-21 19:06:06,415 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-10-21 19:06:06,415 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-10-21 19:06:06,415 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-10-21 19:06:06,415 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-10-21 19:06:06,416 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-10-21 19:06:06,416 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-10-21 19:06:06,416 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-10-21 19:06:06,416 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-10-21 19:06:06,416 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-10-21 19:06:06,416 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-10-21 19:06:06,416 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-10-21 19:06:06,417 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-10-21 19:06:06,417 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-10-21 19:06:06,417 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-10-21 19:06:06,417 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-10-21 19:06:06,417 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-10-21 19:06:06,417 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-10-21 19:06:06,417 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-10-21 19:06:06,417 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-10-21 19:06:06,418 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-10-21 19:06:06,418 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-10-21 19:06:06,418 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-10-21 19:06:06,418 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-10-21 19:06:06,418 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-10-21 19:06:06,418 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-10-21 19:06:06,418 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-10-21 19:06:06,419 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-10-21 19:06:06,419 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-10-21 19:06:06,419 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-10-21 19:06:06,419 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-10-21 19:06:06,419 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-10-21 19:06:06,419 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-10-21 19:06:06,419 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-10-21 19:06:06,419 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-10-21 19:06:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-10-21 19:06:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-10-21 19:06:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-10-21 19:06:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-10-21 19:06:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-10-21 19:06:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-10-21 19:06:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-10-21 19:06:06,420 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-10-21 19:06:06,421 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-10-21 19:06:06,421 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-10-21 19:06:06,421 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-10-21 19:06:06,421 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-10-21 19:06:06,421 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-10-21 19:06:06,421 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-10-21 19:06:06,421 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-10-21 19:06:06,422 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-10-21 19:06:06,422 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-10-21 19:06:06,422 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-10-21 19:06:06,422 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-10-21 19:06:06,422 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-10-21 19:06:06,422 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-10-21 19:06:06,422 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-10-21 19:06:06,422 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-10-21 19:06:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-10-21 19:06:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-10-21 19:06:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-10-21 19:06:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-10-21 19:06:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-10-21 19:06:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-10-21 19:06:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-10-21 19:06:06,424 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-10-21 19:06:06,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-10-21 19:06:06,424 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-10-21 19:06:06,424 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-10-21 19:06:06,424 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-10-21 19:06:06,424 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-10-21 19:06:06,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 19:06:06,424 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-10-21 19:06:06,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-21 19:06:06,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-21 19:06:06,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-21 19:06:06,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-21 19:06:06,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-10-21 19:06:06,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 19:06:06,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 19:06:06,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-21 19:06:06,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-21 19:06:07,301 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 19:06:07,301 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-10-21 19:06:07,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:06:07 BoogieIcfgContainer [2021-10-21 19:06:07,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 19:06:07,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 19:06:07,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 19:06:07,311 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 19:06:07,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 07:06:05" (1/3) ... [2021-10-21 19:06:07,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4715dfd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:06:07, skipping insertion in model container [2021-10-21 19:06:07,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:06:06" (2/3) ... [2021-10-21 19:06:07,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4715dfd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:06:07, skipping insertion in model container [2021-10-21 19:06:07,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:06:07" (3/3) ... [2021-10-21 19:06:07,315 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2021-10-21 19:06:07,322 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 19:06:07,323 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 84 error locations. [2021-10-21 19:06:07,369 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 19:06:07,374 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-10-21 19:06:07,375 INFO L340 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2021-10-21 19:06:07,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 116 states have (on average 2.1810344827586206) internal successors, (253), 200 states have internal predecessors, (253), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-10-21 19:06:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-21 19:06:07,403 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:07,403 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:07,404 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:07,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:07,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1164341321, now seen corresponding path program 1 times [2021-10-21 19:06:07,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:07,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083048067] [2021-10-21 19:06:07,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:07,420 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:07,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:07,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:07,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:07,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083048067] [2021-10-21 19:06:07,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083048067] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:07,631 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:07,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:06:07,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948932672] [2021-10-21 19:06:07,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:06:07,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:07,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:06:07,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:06:07,656 INFO L87 Difference]: Start difference. First operand has 205 states, 116 states have (on average 2.1810344827586206) internal successors, (253), 200 states have internal predecessors, (253), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:08,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:08,135 INFO L93 Difference]: Finished difference Result 205 states and 215 transitions. [2021-10-21 19:06:08,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:06:08,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-10-21 19:06:08,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:08,150 INFO L225 Difference]: With dead ends: 205 [2021-10-21 19:06:08,150 INFO L226 Difference]: Without dead ends: 201 [2021-10-21 19:06:08,151 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.5ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:06:08,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-10-21 19:06:08,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 196. [2021-10-21 19:06:08,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 118 states have (on average 1.7372881355932204) internal successors, (205), 192 states have internal predecessors, (205), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:08,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 208 transitions. [2021-10-21 19:06:08,219 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 208 transitions. Word has length 7 [2021-10-21 19:06:08,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:08,220 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 208 transitions. [2021-10-21 19:06:08,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:08,220 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 208 transitions. [2021-10-21 19:06:08,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-21 19:06:08,221 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:08,221 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:08,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-21 19:06:08,222 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:08,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:08,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1164341322, now seen corresponding path program 1 times [2021-10-21 19:06:08,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:08,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543836415] [2021-10-21 19:06:08,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:08,223 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:08,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:08,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:08,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:08,305 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543836415] [2021-10-21 19:06:08,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543836415] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:08,306 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:08,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:06:08,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977689115] [2021-10-21 19:06:08,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:06:08,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:08,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:06:08,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:06:08,309 INFO L87 Difference]: Start difference. First operand 196 states and 208 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:08,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:08,637 INFO L93 Difference]: Finished difference Result 225 states and 236 transitions. [2021-10-21 19:06:08,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:06:08,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-10-21 19:06:08,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:08,639 INFO L225 Difference]: With dead ends: 225 [2021-10-21 19:06:08,639 INFO L226 Difference]: Without dead ends: 225 [2021-10-21 19:06:08,640 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.7ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:06:08,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-10-21 19:06:08,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 205. [2021-10-21 19:06:08,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 135 states have (on average 1.6666666666666667) internal successors, (225), 201 states have internal predecessors, (225), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 228 transitions. [2021-10-21 19:06:08,654 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 228 transitions. Word has length 7 [2021-10-21 19:06:08,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:08,655 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 228 transitions. [2021-10-21 19:06:08,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:08,655 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 228 transitions. [2021-10-21 19:06:08,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-21 19:06:08,656 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:08,656 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:08,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-21 19:06:08,656 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr4ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:08,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:08,657 INFO L82 PathProgramCache]: Analyzing trace with hash 736394790, now seen corresponding path program 1 times [2021-10-21 19:06:08,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:08,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765423325] [2021-10-21 19:06:08,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:08,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:08,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:08,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:08,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:08,773 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765423325] [2021-10-21 19:06:08,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765423325] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:08,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:08,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:06:08,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078261645] [2021-10-21 19:06:08,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:06:08,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:08,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:06:08,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:06:08,776 INFO L87 Difference]: Start difference. First operand 205 states and 228 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:09,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:09,032 INFO L93 Difference]: Finished difference Result 220 states and 231 transitions. [2021-10-21 19:06:09,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:06:09,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-10-21 19:06:09,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:09,035 INFO L225 Difference]: With dead ends: 220 [2021-10-21 19:06:09,035 INFO L226 Difference]: Without dead ends: 220 [2021-10-21 19:06:09,035 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:06:09,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-10-21 19:06:09,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 203. [2021-10-21 19:06:09,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 134 states have (on average 1.6567164179104477) internal successors, (222), 199 states have internal predecessors, (222), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:09,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 225 transitions. [2021-10-21 19:06:09,059 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 225 transitions. Word has length 10 [2021-10-21 19:06:09,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:09,059 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 225 transitions. [2021-10-21 19:06:09,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:09,060 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 225 transitions. [2021-10-21 19:06:09,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-21 19:06:09,060 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:09,060 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:09,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-21 19:06:09,060 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr11REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:09,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:09,061 INFO L82 PathProgramCache]: Analyzing trace with hash 712243896, now seen corresponding path program 1 times [2021-10-21 19:06:09,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:09,061 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679748408] [2021-10-21 19:06:09,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:09,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:09,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:09,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:09,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:09,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679748408] [2021-10-21 19:06:09,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679748408] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:09,166 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:09,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:06:09,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349627739] [2021-10-21 19:06:09,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:06:09,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:09,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:06:09,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:06:09,168 INFO L87 Difference]: Start difference. First operand 203 states and 225 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:09,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:09,499 INFO L93 Difference]: Finished difference Result 202 states and 224 transitions. [2021-10-21 19:06:09,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:06:09,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-10-21 19:06:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:09,501 INFO L225 Difference]: With dead ends: 202 [2021-10-21 19:06:09,502 INFO L226 Difference]: Without dead ends: 202 [2021-10-21 19:06:09,502 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 36.6ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:06:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-21 19:06:09,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2021-10-21 19:06:09,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 134 states have (on average 1.6492537313432836) internal successors, (221), 198 states have internal predecessors, (221), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 224 transitions. [2021-10-21 19:06:09,511 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 224 transitions. Word has length 16 [2021-10-21 19:06:09,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:09,511 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 224 transitions. [2021-10-21 19:06:09,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:09,512 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2021-10-21 19:06:09,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-21 19:06:09,512 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:09,512 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:09,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-21 19:06:09,513 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr12REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:09,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:09,513 INFO L82 PathProgramCache]: Analyzing trace with hash 712243897, now seen corresponding path program 1 times [2021-10-21 19:06:09,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:09,514 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332031877] [2021-10-21 19:06:09,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:09,514 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:09,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:09,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:09,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:09,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332031877] [2021-10-21 19:06:09,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332031877] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:09,630 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:09,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:06:09,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797478159] [2021-10-21 19:06:09,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:06:09,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:09,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:06:09,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:06:09,632 INFO L87 Difference]: Start difference. First operand 202 states and 224 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:09,983 INFO L93 Difference]: Finished difference Result 201 states and 223 transitions. [2021-10-21 19:06:09,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:06:09,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-10-21 19:06:09,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:09,985 INFO L225 Difference]: With dead ends: 201 [2021-10-21 19:06:09,986 INFO L226 Difference]: Without dead ends: 201 [2021-10-21 19:06:09,986 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 60.5ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:06:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-10-21 19:06:09,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2021-10-21 19:06:09,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 197 states have internal predecessors, (220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:09,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 223 transitions. [2021-10-21 19:06:09,994 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 223 transitions. Word has length 16 [2021-10-21 19:06:09,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:09,994 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 223 transitions. [2021-10-21 19:06:09,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:09,995 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 223 transitions. [2021-10-21 19:06:09,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-21 19:06:09,996 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:09,996 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:09,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-21 19:06:09,996 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr21ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:09,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:09,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1298127146, now seen corresponding path program 1 times [2021-10-21 19:06:09,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:09,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542840653] [2021-10-21 19:06:09,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:09,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:10,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:10,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:10,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:10,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542840653] [2021-10-21 19:06:10,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542840653] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:10,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:10,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:06:10,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064770450] [2021-10-21 19:06:10,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:06:10,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:10,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:06:10,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:06:10,055 INFO L87 Difference]: Start difference. First operand 201 states and 223 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:10,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:10,272 INFO L93 Difference]: Finished difference Result 202 states and 224 transitions. [2021-10-21 19:06:10,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:06:10,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-10-21 19:06:10,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:10,274 INFO L225 Difference]: With dead ends: 202 [2021-10-21 19:06:10,274 INFO L226 Difference]: Without dead ends: 202 [2021-10-21 19:06:10,275 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:06:10,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-21 19:06:10,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2021-10-21 19:06:10,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 135 states have (on average 1.637037037037037) internal successors, (221), 198 states have internal predecessors, (221), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 224 transitions. [2021-10-21 19:06:10,281 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 224 transitions. Word has length 18 [2021-10-21 19:06:10,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:10,282 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 224 transitions. [2021-10-21 19:06:10,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:10,282 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2021-10-21 19:06:10,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-21 19:06:10,283 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:10,283 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:10,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-21 19:06:10,284 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr15REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:10,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:10,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1319486370, now seen corresponding path program 1 times [2021-10-21 19:06:10,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:10,285 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557795] [2021-10-21 19:06:10,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:10,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:10,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:10,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:10,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557795] [2021-10-21 19:06:10,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557795] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:10,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:10,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:06:10,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966454108] [2021-10-21 19:06:10,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 19:06:10,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:10,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 19:06:10,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:06:10,423 INFO L87 Difference]: Start difference. First operand 202 states and 224 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:10,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:10,859 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions. [2021-10-21 19:06:10,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:06:10,859 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-10-21 19:06:10,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:10,861 INFO L225 Difference]: With dead ends: 202 [2021-10-21 19:06:10,861 INFO L226 Difference]: Without dead ends: 202 [2021-10-21 19:06:10,861 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 108.9ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:06:10,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-21 19:06:10,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2021-10-21 19:06:10,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 135 states have (on average 1.6296296296296295) internal successors, (220), 197 states have internal predecessors, (220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 223 transitions. [2021-10-21 19:06:10,867 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 223 transitions. Word has length 19 [2021-10-21 19:06:10,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:10,868 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 223 transitions. [2021-10-21 19:06:10,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:10,868 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 223 transitions. [2021-10-21 19:06:10,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-21 19:06:10,869 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:10,869 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:10,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-21 19:06:10,869 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr16REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:10,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:10,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1319486371, now seen corresponding path program 1 times [2021-10-21 19:06:10,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:10,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875442873] [2021-10-21 19:06:10,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:10,871 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:11,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:11,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:11,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:11,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875442873] [2021-10-21 19:06:11,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875442873] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:11,019 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:11,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:06:11,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19035222] [2021-10-21 19:06:11,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 19:06:11,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:11,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 19:06:11,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:06:11,021 INFO L87 Difference]: Start difference. First operand 201 states and 223 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:11,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:11,583 INFO L93 Difference]: Finished difference Result 201 states and 222 transitions. [2021-10-21 19:06:11,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:06:11,583 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-10-21 19:06:11,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:11,585 INFO L225 Difference]: With dead ends: 201 [2021-10-21 19:06:11,585 INFO L226 Difference]: Without dead ends: 201 [2021-10-21 19:06:11,585 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 153.0ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:06:11,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-10-21 19:06:11,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2021-10-21 19:06:11,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 135 states have (on average 1.6222222222222222) internal successors, (219), 196 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2021-10-21 19:06:11,591 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 19 [2021-10-21 19:06:11,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:11,591 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2021-10-21 19:06:11,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2021-10-21 19:06:11,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-21 19:06:11,592 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:11,592 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:11,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-21 19:06:11,593 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr21ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:11,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:11,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1961307727, now seen corresponding path program 1 times [2021-10-21 19:06:11,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:11,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146434565] [2021-10-21 19:06:11,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:11,594 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:11,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:11,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:11,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:11,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146434565] [2021-10-21 19:06:11,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146434565] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:11,710 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:11,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:06:11,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351112629] [2021-10-21 19:06:11,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:06:11,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:11,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:06:11,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:06:11,713 INFO L87 Difference]: Start difference. First operand 200 states and 222 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:12,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:12,114 INFO L93 Difference]: Finished difference Result 287 states and 315 transitions. [2021-10-21 19:06:12,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-21 19:06:12,115 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-10-21 19:06:12,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:12,117 INFO L225 Difference]: With dead ends: 287 [2021-10-21 19:06:12,117 INFO L226 Difference]: Without dead ends: 287 [2021-10-21 19:06:12,117 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 123.6ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:06:12,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-10-21 19:06:12,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 197. [2021-10-21 19:06:12,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 193 states have internal predecessors, (216), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:12,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 219 transitions. [2021-10-21 19:06:12,123 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 219 transitions. Word has length 20 [2021-10-21 19:06:12,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:12,124 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 219 transitions. [2021-10-21 19:06:12,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:12,124 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 219 transitions. [2021-10-21 19:06:12,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-21 19:06:12,128 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:12,128 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:12,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-21 19:06:12,128 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr22REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:12,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:12,129 INFO L82 PathProgramCache]: Analyzing trace with hash -2122514828, now seen corresponding path program 1 times [2021-10-21 19:06:12,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:12,133 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313420078] [2021-10-21 19:06:12,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:12,134 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:12,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:12,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:12,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313420078] [2021-10-21 19:06:12,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313420078] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:12,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:12,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:06:12,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117804115] [2021-10-21 19:06:12,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:06:12,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:12,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:06:12,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:06:12,227 INFO L87 Difference]: Start difference. First operand 197 states and 219 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:12,540 INFO L93 Difference]: Finished difference Result 288 states and 315 transitions. [2021-10-21 19:06:12,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:06:12,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-10-21 19:06:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:12,543 INFO L225 Difference]: With dead ends: 288 [2021-10-21 19:06:12,543 INFO L226 Difference]: Without dead ends: 288 [2021-10-21 19:06:12,543 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.4ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:06:12,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-10-21 19:06:12,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 200. [2021-10-21 19:06:12,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 136 states have (on average 1.6102941176470589) internal successors, (219), 196 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:12,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2021-10-21 19:06:12,550 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 22 [2021-10-21 19:06:12,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:12,550 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2021-10-21 19:06:12,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:12,550 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2021-10-21 19:06:12,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-21 19:06:12,551 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:12,551 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:12,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-21 19:06:12,552 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr22REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:12,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:12,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1029388569, now seen corresponding path program 1 times [2021-10-21 19:06:12,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:12,553 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916854605] [2021-10-21 19:06:12,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:12,553 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:12,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:12,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:12,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:12,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916854605] [2021-10-21 19:06:12,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916854605] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:12,618 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:12,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:06:12,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618771102] [2021-10-21 19:06:12,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:06:12,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:12,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:06:12,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:06:12,620 INFO L87 Difference]: Start difference. First operand 200 states and 222 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:12,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:12,907 INFO L93 Difference]: Finished difference Result 195 states and 215 transitions. [2021-10-21 19:06:12,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:06:12,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-10-21 19:06:12,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:12,909 INFO L225 Difference]: With dead ends: 195 [2021-10-21 19:06:12,909 INFO L226 Difference]: Without dead ends: 195 [2021-10-21 19:06:12,909 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.2ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:06:12,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-10-21 19:06:12,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 190. [2021-10-21 19:06:12,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 138 states have (on average 1.5144927536231885) internal successors, (209), 186 states have internal predecessors, (209), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:12,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2021-10-21 19:06:12,914 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 24 [2021-10-21 19:06:12,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:12,915 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2021-10-21 19:06:12,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:12,915 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2021-10-21 19:06:12,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-21 19:06:12,916 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:12,916 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:12,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-21 19:06:12,916 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr23REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:12,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:12,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1029388570, now seen corresponding path program 1 times [2021-10-21 19:06:12,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:12,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957830551] [2021-10-21 19:06:12,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:12,918 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:13,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:13,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:13,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957830551] [2021-10-21 19:06:13,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957830551] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:13,011 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:13,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:06:13,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696477090] [2021-10-21 19:06:13,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:06:13,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:13,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:06:13,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:06:13,013 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:13,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:13,328 INFO L93 Difference]: Finished difference Result 251 states and 266 transitions. [2021-10-21 19:06:13,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:06:13,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-10-21 19:06:13,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:13,331 INFO L225 Difference]: With dead ends: 251 [2021-10-21 19:06:13,331 INFO L226 Difference]: Without dead ends: 251 [2021-10-21 19:06:13,331 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:06:13,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-10-21 19:06:13,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 214. [2021-10-21 19:06:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 162 states have (on average 1.5246913580246915) internal successors, (247), 210 states have internal predecessors, (247), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 250 transitions. [2021-10-21 19:06:13,337 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 250 transitions. Word has length 24 [2021-10-21 19:06:13,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:13,338 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 250 transitions. [2021-10-21 19:06:13,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 250 transitions. [2021-10-21 19:06:13,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-21 19:06:13,339 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:13,339 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:13,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-21 19:06:13,339 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr51ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:13,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:13,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1399993902, now seen corresponding path program 1 times [2021-10-21 19:06:13,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:13,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759031389] [2021-10-21 19:06:13,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:13,340 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:13,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:13,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:13,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759031389] [2021-10-21 19:06:13,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759031389] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:13,391 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:13,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:06:13,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889724040] [2021-10-21 19:06:13,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:06:13,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:13,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:06:13,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:06:13,393 INFO L87 Difference]: Start difference. First operand 214 states and 250 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:13,653 INFO L93 Difference]: Finished difference Result 246 states and 260 transitions. [2021-10-21 19:06:13,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:06:13,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-10-21 19:06:13,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:13,655 INFO L225 Difference]: With dead ends: 246 [2021-10-21 19:06:13,655 INFO L226 Difference]: Without dead ends: 246 [2021-10-21 19:06:13,655 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.2ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:06:13,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-10-21 19:06:13,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 212. [2021-10-21 19:06:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 161 states have (on average 1.515527950310559) internal successors, (244), 208 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:13,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 247 transitions. [2021-10-21 19:06:13,662 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 247 transitions. Word has length 26 [2021-10-21 19:06:13,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:13,662 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 247 transitions. [2021-10-21 19:06:13,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:13,662 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 247 transitions. [2021-10-21 19:06:13,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-21 19:06:13,663 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:13,663 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:13,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-21 19:06:13,663 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr26REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:13,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:13,664 INFO L82 PathProgramCache]: Analyzing trace with hash 448442135, now seen corresponding path program 1 times [2021-10-21 19:06:13,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:13,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952236417] [2021-10-21 19:06:13,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:13,664 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:13,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:13,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:13,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952236417] [2021-10-21 19:06:13,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952236417] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:13,739 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:13,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:06:13,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999465293] [2021-10-21 19:06:13,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:06:13,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:13,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:06:13,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:06:13,741 INFO L87 Difference]: Start difference. First operand 212 states and 247 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:14,041 INFO L93 Difference]: Finished difference Result 211 states and 245 transitions. [2021-10-21 19:06:14,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:06:14,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-10-21 19:06:14,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:14,044 INFO L225 Difference]: With dead ends: 211 [2021-10-21 19:06:14,045 INFO L226 Difference]: Without dead ends: 211 [2021-10-21 19:06:14,046 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 32.8ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:06:14,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-10-21 19:06:14,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2021-10-21 19:06:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 161 states have (on average 1.5031055900621118) internal successors, (242), 207 states have internal predecessors, (242), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 245 transitions. [2021-10-21 19:06:14,052 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 245 transitions. Word has length 27 [2021-10-21 19:06:14,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:14,053 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 245 transitions. [2021-10-21 19:06:14,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:14,053 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 245 transitions. [2021-10-21 19:06:14,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-21 19:06:14,057 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:14,057 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:14,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-21 19:06:14,058 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr27REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:14,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:14,058 INFO L82 PathProgramCache]: Analyzing trace with hash 448442136, now seen corresponding path program 1 times [2021-10-21 19:06:14,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:14,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671776282] [2021-10-21 19:06:14,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:14,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:14,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:14,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:14,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:14,160 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671776282] [2021-10-21 19:06:14,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671776282] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:14,160 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:14,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:06:14,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86692834] [2021-10-21 19:06:14,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:06:14,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:14,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:06:14,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:06:14,164 INFO L87 Difference]: Start difference. First operand 211 states and 245 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:14,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:14,461 INFO L93 Difference]: Finished difference Result 210 states and 243 transitions. [2021-10-21 19:06:14,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:06:14,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-10-21 19:06:14,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:14,463 INFO L225 Difference]: With dead ends: 210 [2021-10-21 19:06:14,463 INFO L226 Difference]: Without dead ends: 210 [2021-10-21 19:06:14,463 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 46.6ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:06:14,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-10-21 19:06:14,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2021-10-21 19:06:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 206 states have internal predecessors, (240), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:14,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 243 transitions. [2021-10-21 19:06:14,469 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 243 transitions. Word has length 27 [2021-10-21 19:06:14,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:14,469 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 243 transitions. [2021-10-21 19:06:14,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 243 transitions. [2021-10-21 19:06:14,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-21 19:06:14,471 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:14,471 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:14,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-21 19:06:14,471 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr30REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:14,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:14,472 INFO L82 PathProgramCache]: Analyzing trace with hash -784939815, now seen corresponding path program 1 times [2021-10-21 19:06:14,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:14,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242544687] [2021-10-21 19:06:14,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:14,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:14,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:14,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:14,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:14,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242544687] [2021-10-21 19:06:14,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242544687] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:14,584 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:14,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-21 19:06:14,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4859530] [2021-10-21 19:06:14,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 19:06:14,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:14,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 19:06:14,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:06:14,586 INFO L87 Difference]: Start difference. First operand 210 states and 243 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:15,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:15,092 INFO L93 Difference]: Finished difference Result 210 states and 242 transitions. [2021-10-21 19:06:15,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:06:15,093 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-10-21 19:06:15,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:15,094 INFO L225 Difference]: With dead ends: 210 [2021-10-21 19:06:15,094 INFO L226 Difference]: Without dead ends: 210 [2021-10-21 19:06:15,095 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 127.5ms TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-10-21 19:06:15,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-10-21 19:06:15,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2021-10-21 19:06:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 161 states have (on average 1.484472049689441) internal successors, (239), 205 states have internal predecessors, (239), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:15,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 242 transitions. [2021-10-21 19:06:15,101 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 242 transitions. Word has length 31 [2021-10-21 19:06:15,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:15,101 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 242 transitions. [2021-10-21 19:06:15,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:15,102 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 242 transitions. [2021-10-21 19:06:15,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-21 19:06:15,102 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:15,102 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:15,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-21 19:06:15,103 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr31REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:15,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:15,103 INFO L82 PathProgramCache]: Analyzing trace with hash -784939814, now seen corresponding path program 1 times [2021-10-21 19:06:15,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:15,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280915236] [2021-10-21 19:06:15,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:15,104 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:15,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:15,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:15,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:15,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280915236] [2021-10-21 19:06:15,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280915236] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:15,278 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:15,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 19:06:15,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113053438] [2021-10-21 19:06:15,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-21 19:06:15,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:15,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-21 19:06:15,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:06:15,280 INFO L87 Difference]: Start difference. First operand 209 states and 242 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:16,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:16,063 INFO L93 Difference]: Finished difference Result 202 states and 234 transitions. [2021-10-21 19:06:16,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-21 19:06:16,064 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-10-21 19:06:16,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:16,065 INFO L225 Difference]: With dead ends: 202 [2021-10-21 19:06:16,065 INFO L226 Difference]: Without dead ends: 202 [2021-10-21 19:06:16,066 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 318.1ms TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2021-10-21 19:06:16,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-21 19:06:16,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 191. [2021-10-21 19:06:16,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 153 states have (on average 1.4379084967320261) internal successors, (220), 187 states have internal predecessors, (220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:16,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 223 transitions. [2021-10-21 19:06:16,071 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 223 transitions. Word has length 31 [2021-10-21 19:06:16,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:16,071 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 223 transitions. [2021-10-21 19:06:16,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:16,072 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 223 transitions. [2021-10-21 19:06:16,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-21 19:06:16,072 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:16,073 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:16,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-21 19:06:16,073 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr63ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:16,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:16,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1236512538, now seen corresponding path program 1 times [2021-10-21 19:06:16,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:16,074 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940716304] [2021-10-21 19:06:16,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:16,074 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:16,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:16,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:16,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:16,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940716304] [2021-10-21 19:06:16,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940716304] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:16,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:16,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:06:16,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501174526] [2021-10-21 19:06:16,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:06:16,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:16,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:06:16,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:06:16,131 INFO L87 Difference]: Start difference. First operand 191 states and 223 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:16,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:16,310 INFO L93 Difference]: Finished difference Result 264 states and 311 transitions. [2021-10-21 19:06:16,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:06:16,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-10-21 19:06:16,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:16,312 INFO L225 Difference]: With dead ends: 264 [2021-10-21 19:06:16,312 INFO L226 Difference]: Without dead ends: 264 [2021-10-21 19:06:16,313 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:06:16,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-10-21 19:06:16,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 197. [2021-10-21 19:06:16,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 159 states have (on average 1.4339622641509433) internal successors, (228), 193 states have internal predecessors, (228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 231 transitions. [2021-10-21 19:06:16,320 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 231 transitions. Word has length 32 [2021-10-21 19:06:16,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:16,320 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 231 transitions. [2021-10-21 19:06:16,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:16,320 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 231 transitions. [2021-10-21 19:06:16,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-21 19:06:16,321 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:16,322 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:16,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-21 19:06:16,322 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr54ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:16,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:16,323 INFO L82 PathProgramCache]: Analyzing trace with hash -322828341, now seen corresponding path program 1 times [2021-10-21 19:06:16,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:16,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690752948] [2021-10-21 19:06:16,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:16,323 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:16,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:16,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:16,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690752948] [2021-10-21 19:06:16,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690752948] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:16,370 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:16,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:06:16,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665408467] [2021-10-21 19:06:16,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:06:16,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:16,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:06:16,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:06:16,374 INFO L87 Difference]: Start difference. First operand 197 states and 231 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:16,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:16,555 INFO L93 Difference]: Finished difference Result 195 states and 228 transitions. [2021-10-21 19:06:16,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:06:16,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-10-21 19:06:16,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:16,557 INFO L225 Difference]: With dead ends: 195 [2021-10-21 19:06:16,557 INFO L226 Difference]: Without dead ends: 195 [2021-10-21 19:06:16,557 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:06:16,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-10-21 19:06:16,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-10-21 19:06:16,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 158 states have (on average 1.4240506329113924) internal successors, (225), 191 states have internal predecessors, (225), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:16,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 228 transitions. [2021-10-21 19:06:16,562 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 228 transitions. Word has length 33 [2021-10-21 19:06:16,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:16,563 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 228 transitions. [2021-10-21 19:06:16,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 228 transitions. [2021-10-21 19:06:16,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-21 19:06:16,563 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:16,563 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:16,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-21 19:06:16,564 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr32ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:16,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:16,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1587084985, now seen corresponding path program 1 times [2021-10-21 19:06:16,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:16,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044966058] [2021-10-21 19:06:16,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:16,565 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:16,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:16,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:16,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:16,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044966058] [2021-10-21 19:06:16,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044966058] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:16,724 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:16,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-21 19:06:16,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118573993] [2021-10-21 19:06:16,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-21 19:06:16,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:16,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-21 19:06:16,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:06:16,726 INFO L87 Difference]: Start difference. First operand 195 states and 228 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:17,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:17,320 INFO L93 Difference]: Finished difference Result 202 states and 235 transitions. [2021-10-21 19:06:17,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-21 19:06:17,321 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-10-21 19:06:17,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:17,322 INFO L225 Difference]: With dead ends: 202 [2021-10-21 19:06:17,322 INFO L226 Difference]: Without dead ends: 202 [2021-10-21 19:06:17,323 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 221.3ms TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2021-10-21 19:06:17,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-21 19:06:17,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 191. [2021-10-21 19:06:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 156 states have (on average 1.4166666666666667) internal successors, (221), 187 states have internal predecessors, (221), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 224 transitions. [2021-10-21 19:06:17,328 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 224 transitions. Word has length 33 [2021-10-21 19:06:17,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:17,329 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 224 transitions. [2021-10-21 19:06:17,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:17,329 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 224 transitions. [2021-10-21 19:06:17,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-21 19:06:17,330 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:17,330 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:17,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-21 19:06:17,330 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr55REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:17,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:17,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1417739633, now seen corresponding path program 1 times [2021-10-21 19:06:17,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:17,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888810213] [2021-10-21 19:06:17,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:17,331 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:17,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:17,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:17,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888810213] [2021-10-21 19:06:17,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888810213] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:17,442 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:17,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-21 19:06:17,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303362670] [2021-10-21 19:06:17,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 19:06:17,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:17,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 19:06:17,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:06:17,444 INFO L87 Difference]: Start difference. First operand 191 states and 224 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:17,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:17,864 INFO L93 Difference]: Finished difference Result 295 states and 336 transitions. [2021-10-21 19:06:17,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:06:17,864 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2021-10-21 19:06:17,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:17,866 INFO L225 Difference]: With dead ends: 295 [2021-10-21 19:06:17,866 INFO L226 Difference]: Without dead ends: 295 [2021-10-21 19:06:17,867 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 119.0ms TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:06:17,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-10-21 19:06:17,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 203. [2021-10-21 19:06:17,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 168 states have (on average 1.3928571428571428) internal successors, (234), 199 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:17,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 237 transitions. [2021-10-21 19:06:17,874 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 237 transitions. Word has length 34 [2021-10-21 19:06:17,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:17,875 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 237 transitions. [2021-10-21 19:06:17,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:17,876 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 237 transitions. [2021-10-21 19:06:17,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-21 19:06:17,876 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:17,876 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:17,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-21 19:06:17,877 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr52REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:17,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:17,877 INFO L82 PathProgramCache]: Analyzing trace with hash -477422014, now seen corresponding path program 1 times [2021-10-21 19:06:17,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:17,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57042378] [2021-10-21 19:06:17,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:17,878 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:17,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:18,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:18,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57042378] [2021-10-21 19:06:18,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57042378] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:06:18,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839429252] [2021-10-21 19:06:18,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:18,003 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:06:18,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:06:18,010 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:06:18,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-21 19:06:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:18,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 21 conjunts are in the unsatisfiable core [2021-10-21 19:06:18,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:06:18,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-21 19:06:18,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-21 19:06:18,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-21 19:06:18,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-21 19:06:18,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-21 19:06:18,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-21 19:06:18,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-21 19:06:18,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-21 19:06:18,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-21 19:06:18,463 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-21 19:06:18,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2021-10-21 19:06:18,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-21 19:06:18,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-21 19:06:18,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-21 19:06:18,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-10-21 19:06:19,059 INFO L354 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-10-21 19:06:19,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 50 [2021-10-21 19:06:19,080 INFO L354 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2021-10-21 19:06:19,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 25 [2021-10-21 19:06:19,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:19,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839429252] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:06:19,104 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:06:19,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2021-10-21 19:06:19,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715918130] [2021-10-21 19:06:19,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 19:06:19,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:19,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:06:19,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:06:19,106 INFO L87 Difference]: Start difference. First operand 203 states and 237 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:19,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:19,811 INFO L93 Difference]: Finished difference Result 344 states and 376 transitions. [2021-10-21 19:06:19,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-21 19:06:19,812 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-10-21 19:06:19,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:19,814 INFO L225 Difference]: With dead ends: 344 [2021-10-21 19:06:19,814 INFO L226 Difference]: Without dead ends: 344 [2021-10-21 19:06:19,814 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 286.7ms TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2021-10-21 19:06:19,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-10-21 19:06:19,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 231. [2021-10-21 19:06:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 196 states have (on average 1.403061224489796) internal successors, (275), 227 states have internal predecessors, (275), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 278 transitions. [2021-10-21 19:06:19,822 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 278 transitions. Word has length 36 [2021-10-21 19:06:19,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:19,822 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 278 transitions. [2021-10-21 19:06:19,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 278 transitions. [2021-10-21 19:06:19,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-21 19:06:19,823 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:19,823 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:19,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-21 19:06:20,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:06:20,024 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr55REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:20,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:20,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1233959113, now seen corresponding path program 1 times [2021-10-21 19:06:20,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:20,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667830842] [2021-10-21 19:06:20,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:20,025 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:20,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:20,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:20,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667830842] [2021-10-21 19:06:20,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667830842] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:20,166 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:20,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-21 19:06:20,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573250291] [2021-10-21 19:06:20,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 19:06:20,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:20,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:06:20,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:06:20,168 INFO L87 Difference]: Start difference. First operand 231 states and 278 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:20,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:20,927 INFO L93 Difference]: Finished difference Result 338 states and 376 transitions. [2021-10-21 19:06:20,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-21 19:06:20,927 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-10-21 19:06:20,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:20,929 INFO L225 Difference]: With dead ends: 338 [2021-10-21 19:06:20,929 INFO L226 Difference]: Without dead ends: 338 [2021-10-21 19:06:20,930 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 189.8ms TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-10-21 19:06:20,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-10-21 19:06:20,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 232. [2021-10-21 19:06:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 199 states have (on average 1.3718592964824121) internal successors, (273), 228 states have internal predecessors, (273), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 276 transitions. [2021-10-21 19:06:20,937 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 276 transitions. Word has length 39 [2021-10-21 19:06:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:20,937 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 276 transitions. [2021-10-21 19:06:20,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 276 transitions. [2021-10-21 19:06:20,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-21 19:06:20,938 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:20,939 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:20,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-21 19:06:20,939 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr56REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:20,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:20,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1233959114, now seen corresponding path program 1 times [2021-10-21 19:06:20,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:20,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793469546] [2021-10-21 19:06:20,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:20,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:21,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:21,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:21,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:21,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793469546] [2021-10-21 19:06:21,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793469546] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:21,219 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:21,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-21 19:06:21,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225981630] [2021-10-21 19:06:21,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-21 19:06:21,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:21,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-21 19:06:21,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:06:21,221 INFO L87 Difference]: Start difference. First operand 232 states and 276 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:22,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:22,258 INFO L93 Difference]: Finished difference Result 404 states and 436 transitions. [2021-10-21 19:06:22,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-21 19:06:22,259 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-10-21 19:06:22,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:22,261 INFO L225 Difference]: With dead ends: 404 [2021-10-21 19:06:22,261 INFO L226 Difference]: Without dead ends: 404 [2021-10-21 19:06:22,262 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 387.0ms TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2021-10-21 19:06:22,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-10-21 19:06:22,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 238. [2021-10-21 19:06:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 205 states have (on average 1.3658536585365855) internal successors, (280), 234 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 283 transitions. [2021-10-21 19:06:22,269 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 283 transitions. Word has length 39 [2021-10-21 19:06:22,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:22,270 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 283 transitions. [2021-10-21 19:06:22,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:22,270 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 283 transitions. [2021-10-21 19:06:22,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-21 19:06:22,271 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:22,271 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:22,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-21 19:06:22,271 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr68ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:22,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:22,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1461137672, now seen corresponding path program 1 times [2021-10-21 19:06:22,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:22,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263676189] [2021-10-21 19:06:22,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:22,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:22,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:22,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-21 19:06:22,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:22,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263676189] [2021-10-21 19:06:22,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263676189] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:22,399 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:22,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:06:22,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790255983] [2021-10-21 19:06:22,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:06:22,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:22,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:06:22,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:06:22,401 INFO L87 Difference]: Start difference. First operand 238 states and 283 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:22,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:22,746 INFO L93 Difference]: Finished difference Result 254 states and 299 transitions. [2021-10-21 19:06:22,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:06:22,747 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-10-21 19:06:22,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:22,750 INFO L225 Difference]: With dead ends: 254 [2021-10-21 19:06:22,750 INFO L226 Difference]: Without dead ends: 254 [2021-10-21 19:06:22,750 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 93.3ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:06:22,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-10-21 19:06:22,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 247. [2021-10-21 19:06:22,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 214 states have (on average 1.3504672897196262) internal successors, (289), 243 states have internal predecessors, (289), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:22,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 292 transitions. [2021-10-21 19:06:22,765 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 292 transitions. Word has length 41 [2021-10-21 19:06:22,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:22,765 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 292 transitions. [2021-10-21 19:06:22,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:22,766 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 292 transitions. [2021-10-21 19:06:22,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-21 19:06:22,767 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:22,767 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:22,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-21 19:06:22,767 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr40REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:22,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:22,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1117706321, now seen corresponding path program 1 times [2021-10-21 19:06:22,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:22,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970055214] [2021-10-21 19:06:22,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:22,769 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:22,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:22,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:22,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:22,829 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970055214] [2021-10-21 19:06:22,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970055214] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:22,830 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:22,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:06:22,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981073034] [2021-10-21 19:06:22,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:06:22,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:22,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:06:22,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:06:22,833 INFO L87 Difference]: Start difference. First operand 247 states and 292 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:23,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:23,093 INFO L93 Difference]: Finished difference Result 246 states and 291 transitions. [2021-10-21 19:06:23,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:06:23,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-10-21 19:06:23,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:23,095 INFO L225 Difference]: With dead ends: 246 [2021-10-21 19:06:23,095 INFO L226 Difference]: Without dead ends: 246 [2021-10-21 19:06:23,095 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 33.7ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:06:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-10-21 19:06:23,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2021-10-21 19:06:23,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 214 states have (on average 1.3457943925233644) internal successors, (288), 242 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:23,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 291 transitions. [2021-10-21 19:06:23,101 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 291 transitions. Word has length 41 [2021-10-21 19:06:23,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:23,102 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 291 transitions. [2021-10-21 19:06:23,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:23,102 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 291 transitions. [2021-10-21 19:06:23,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-21 19:06:23,103 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:23,103 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:23,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-21 19:06:23,103 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr41REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:23,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:23,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1117706320, now seen corresponding path program 1 times [2021-10-21 19:06:23,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:23,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924641831] [2021-10-21 19:06:23,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:23,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:23,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:23,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:23,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:23,189 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924641831] [2021-10-21 19:06:23,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924641831] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:23,189 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:23,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:06:23,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381847885] [2021-10-21 19:06:23,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:06:23,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:23,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:06:23,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:06:23,192 INFO L87 Difference]: Start difference. First operand 246 states and 291 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:23,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:23,456 INFO L93 Difference]: Finished difference Result 245 states and 290 transitions. [2021-10-21 19:06:23,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:06:23,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-10-21 19:06:23,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:23,458 INFO L225 Difference]: With dead ends: 245 [2021-10-21 19:06:23,458 INFO L226 Difference]: Without dead ends: 245 [2021-10-21 19:06:23,458 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 48.1ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:06:23,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-10-21 19:06:23,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2021-10-21 19:06:23,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 214 states have (on average 1.341121495327103) internal successors, (287), 241 states have internal predecessors, (287), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:23,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 290 transitions. [2021-10-21 19:06:23,465 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 290 transitions. Word has length 41 [2021-10-21 19:06:23,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:23,465 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 290 transitions. [2021-10-21 19:06:23,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:23,465 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 290 transitions. [2021-10-21 19:06:23,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-21 19:06:23,466 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:23,466 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:23,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-21 19:06:23,466 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr57ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:23,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:23,467 INFO L82 PathProgramCache]: Analyzing trace with hash 423742185, now seen corresponding path program 1 times [2021-10-21 19:06:23,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:23,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656535734] [2021-10-21 19:06:23,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:23,467 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:23,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:23,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:23,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656535734] [2021-10-21 19:06:23,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656535734] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:23,802 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:23,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-21 19:06:23,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110629099] [2021-10-21 19:06:23,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-21 19:06:23,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:23,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-21 19:06:23,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:06:23,804 INFO L87 Difference]: Start difference. First operand 245 states and 290 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:24,921 INFO L93 Difference]: Finished difference Result 413 states and 445 transitions. [2021-10-21 19:06:24,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-21 19:06:24,921 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-10-21 19:06:24,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:24,923 INFO L225 Difference]: With dead ends: 413 [2021-10-21 19:06:24,924 INFO L226 Difference]: Without dead ends: 413 [2021-10-21 19:06:24,924 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 518.1ms TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2021-10-21 19:06:24,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-10-21 19:06:24,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 245. [2021-10-21 19:06:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 214 states have (on average 1.3364485981308412) internal successors, (286), 241 states have internal predecessors, (286), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 289 transitions. [2021-10-21 19:06:24,932 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 289 transitions. Word has length 41 [2021-10-21 19:06:24,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:24,933 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 289 transitions. [2021-10-21 19:06:24,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:24,933 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 289 transitions. [2021-10-21 19:06:24,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-21 19:06:24,934 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:24,934 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:24,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-21 19:06:24,934 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr81ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:24,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:24,935 INFO L82 PathProgramCache]: Analyzing trace with hash 363878013, now seen corresponding path program 1 times [2021-10-21 19:06:24,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:24,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464782138] [2021-10-21 19:06:24,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:24,935 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:24,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:24,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-21 19:06:24,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:24,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464782138] [2021-10-21 19:06:24,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464782138] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:24,978 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:24,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:06:24,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900434805] [2021-10-21 19:06:24,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:06:24,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:24,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:06:24,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:06:24,979 INFO L87 Difference]: Start difference. First operand 245 states and 289 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:25,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:25,149 INFO L93 Difference]: Finished difference Result 258 states and 293 transitions. [2021-10-21 19:06:25,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:06:25,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2021-10-21 19:06:25,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:25,151 INFO L225 Difference]: With dead ends: 258 [2021-10-21 19:06:25,151 INFO L226 Difference]: Without dead ends: 258 [2021-10-21 19:06:25,151 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:06:25,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-10-21 19:06:25,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 246. [2021-10-21 19:06:25,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 215 states have (on average 1.3348837209302327) internal successors, (287), 242 states have internal predecessors, (287), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 290 transitions. [2021-10-21 19:06:25,158 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 290 transitions. Word has length 43 [2021-10-21 19:06:25,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:25,159 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 290 transitions. [2021-10-21 19:06:25,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 290 transitions. [2021-10-21 19:06:25,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-21 19:06:25,160 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:25,160 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:25,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-21 19:06:25,160 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr50ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:25,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:25,161 INFO L82 PathProgramCache]: Analyzing trace with hash -642403391, now seen corresponding path program 1 times [2021-10-21 19:06:25,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:25,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913339596] [2021-10-21 19:06:25,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:25,161 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:25,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:25,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:25,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913339596] [2021-10-21 19:06:25,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913339596] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:25,203 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:25,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:06:25,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174263280] [2021-10-21 19:06:25,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:06:25,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:25,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:06:25,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:06:25,205 INFO L87 Difference]: Start difference. First operand 246 states and 290 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:25,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:25,353 INFO L93 Difference]: Finished difference Result 247 states and 291 transitions. [2021-10-21 19:06:25,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:06:25,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2021-10-21 19:06:25,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:25,355 INFO L225 Difference]: With dead ends: 247 [2021-10-21 19:06:25,355 INFO L226 Difference]: Without dead ends: 247 [2021-10-21 19:06:25,356 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:06:25,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-10-21 19:06:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2021-10-21 19:06:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 216 states have (on average 1.3333333333333333) internal successors, (288), 243 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:25,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 291 transitions. [2021-10-21 19:06:25,362 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 291 transitions. Word has length 43 [2021-10-21 19:06:25,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:25,363 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 291 transitions. [2021-10-21 19:06:25,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:25,363 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 291 transitions. [2021-10-21 19:06:25,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-21 19:06:25,364 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:25,364 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:25,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-21 19:06:25,364 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr44REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:25,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:25,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1292581990, now seen corresponding path program 1 times [2021-10-21 19:06:25,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:25,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779748128] [2021-10-21 19:06:25,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:25,365 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:25,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:25,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:25,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:25,463 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779748128] [2021-10-21 19:06:25,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779748128] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:25,463 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:25,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:06:25,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203064309] [2021-10-21 19:06:25,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 19:06:25,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:25,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 19:06:25,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:06:25,465 INFO L87 Difference]: Start difference. First operand 247 states and 291 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:25,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:25,849 INFO L93 Difference]: Finished difference Result 247 states and 291 transitions. [2021-10-21 19:06:25,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:06:25,850 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-10-21 19:06:25,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:25,851 INFO L225 Difference]: With dead ends: 247 [2021-10-21 19:06:25,851 INFO L226 Difference]: Without dead ends: 247 [2021-10-21 19:06:25,852 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 106.1ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:06:25,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-10-21 19:06:25,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 246. [2021-10-21 19:06:25,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 216 states have (on average 1.3287037037037037) internal successors, (287), 242 states have internal predecessors, (287), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:25,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 290 transitions. [2021-10-21 19:06:25,858 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 290 transitions. Word has length 44 [2021-10-21 19:06:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:25,858 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 290 transitions. [2021-10-21 19:06:25,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:25,858 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 290 transitions. [2021-10-21 19:06:25,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-21 19:06:25,859 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:25,859 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:25,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-21 19:06:25,860 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr45REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:25,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:25,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1292581991, now seen corresponding path program 1 times [2021-10-21 19:06:25,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:25,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577459371] [2021-10-21 19:06:25,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:25,861 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:25,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:06:25,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:06:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:06:25,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:06:25,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577459371] [2021-10-21 19:06:25,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577459371] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:06:25,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:06:25,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:06:25,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509067793] [2021-10-21 19:06:25,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 19:06:25,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:06:25,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 19:06:25,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:06:25,997 INFO L87 Difference]: Start difference. First operand 246 states and 290 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:26,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:06:26,474 INFO L93 Difference]: Finished difference Result 246 states and 290 transitions. [2021-10-21 19:06:26,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:06:26,475 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-10-21 19:06:26,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:06:26,476 INFO L225 Difference]: With dead ends: 246 [2021-10-21 19:06:26,476 INFO L226 Difference]: Without dead ends: 246 [2021-10-21 19:06:26,477 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 152.2ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:06:26,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-10-21 19:06:26,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2021-10-21 19:06:26,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 216 states have (on average 1.3240740740740742) internal successors, (286), 241 states have internal predecessors, (286), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:26,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 289 transitions. [2021-10-21 19:06:26,491 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 289 transitions. Word has length 44 [2021-10-21 19:06:26,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:06:26,492 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 289 transitions. [2021-10-21 19:06:26,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-21 19:06:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 289 transitions. [2021-10-21 19:06:26,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-21 19:06:26,493 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:06:26,493 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:06:26,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-21 19:06:26,493 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr60ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_LEAK (and 79 more)] === [2021-10-21 19:06:26,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:06:26,494 INFO L82 PathProgramCache]: Analyzing trace with hash 798755045, now seen corresponding path program 1 times [2021-10-21 19:06:26,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:06:26,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278482389] [2021-10-21 19:06:26,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:06:26,495 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:06:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:06:26,517 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:06:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:06:26,579 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:06:26,579 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-21 19:06:26,582 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr60ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:06:26,584 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-10-21 19:06:26,584 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-10-21 19:06:26,584 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-10-21 19:06:26,584 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-10-21 19:06:26,585 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:06:26,585 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-10-21 19:06:26,585 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-10-21 19:06:26,585 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-10-21 19:06:26,585 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-10-21 19:06:26,585 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-10-21 19:06:26,586 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-10-21 19:06:26,586 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-10-21 19:06:26,586 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-10-21 19:06:26,586 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-10-21 19:06:26,586 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-10-21 19:06:26,587 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-10-21 19:06:26,587 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-10-21 19:06:26,587 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-10-21 19:06:26,587 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-10-21 19:06:26,587 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-10-21 19:06:26,587 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-10-21 19:06:26,588 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:06:26,588 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-10-21 19:06:26,588 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-10-21 19:06:26,588 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-10-21 19:06:26,588 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-10-21 19:06:26,588 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-10-21 19:06:26,589 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-10-21 19:06:26,589 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-10-21 19:06:26,589 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-10-21 19:06:26,589 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-10-21 19:06:26,589 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-10-21 19:06:26,590 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:06:26,590 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:06:26,590 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-10-21 19:06:26,590 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-10-21 19:06:26,590 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-10-21 19:06:26,591 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-10-21 19:06:26,591 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-10-21 19:06:26,591 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-10-21 19:06:26,591 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-10-21 19:06:26,591 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-10-21 19:06:26,591 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-10-21 19:06:26,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION [2021-10-21 19:06:26,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44REQUIRES_VIOLATION [2021-10-21 19:06:26,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45REQUIRES_VIOLATION [2021-10-21 19:06:26,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-10-21 19:06:26,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION [2021-10-21 19:06:26,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48REQUIRES_VIOLATION [2021-10-21 19:06:26,593 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-10-21 19:06:26,593 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:06:26,593 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:06:26,593 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION [2021-10-21 19:06:26,593 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53REQUIRES_VIOLATION [2021-10-21 19:06:26,594 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:06:26,594 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION [2021-10-21 19:06:26,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56REQUIRES_VIOLATION [2021-10-21 19:06:26,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr57ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:06:26,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58REQUIRES_VIOLATION [2021-10-21 19:06:26,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59REQUIRES_VIOLATION [2021-10-21 19:06:26,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61REQUIRES_VIOLATION [2021-10-21 19:06:26,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62REQUIRES_VIOLATION [2021-10-21 19:06:26,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:06:26,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64REQUIRES_VIOLATION [2021-10-21 19:06:26,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr65REQUIRES_VIOLATION [2021-10-21 19:06:26,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr66REQUIRES_VIOLATION [2021-10-21 19:06:26,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr67REQUIRES_VIOLATION [2021-10-21 19:06:26,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr68ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:06:26,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr69REQUIRES_VIOLATION [2021-10-21 19:06:26,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr70REQUIRES_VIOLATION [2021-10-21 19:06:26,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr71ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:06:26,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr72REQUIRES_VIOLATION [2021-10-21 19:06:26,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr73REQUIRES_VIOLATION [2021-10-21 19:06:26,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr74ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:06:26,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr75ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:06:26,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr76ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:06:26,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr77ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:06:26,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr78REQUIRES_VIOLATION [2021-10-21 19:06:26,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr79REQUIRES_VIOLATION [2021-10-21 19:06:26,599 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr80ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:06:26,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr81ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:06:26,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr82ASSERT_VIOLATIONMEMORY_FREE [2021-10-21 19:06:26,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr83ENSURES_VIOLATIONMEMORY_LEAK [2021-10-21 19:06:26,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-21 19:06:26,608 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 19:06:26,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 07:06:26 BoogieIcfgContainer [2021-10-21 19:06:26,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 19:06:26,674 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 19:06:26,674 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 19:06:26,675 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 19:06:26,675 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:06:07" (3/4) ... [2021-10-21 19:06:26,677 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-21 19:06:26,714 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 19:06:26,715 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 19:06:26,716 INFO L168 Benchmark]: Toolchain (without parser) took 21103.77 ms. Allocated memory was 119.5 MB in the beginning and 197.1 MB in the end (delta: 77.6 MB). Free memory was 79.5 MB in the beginning and 69.0 MB in the end (delta: 10.4 MB). Peak memory consumption was 86.3 MB. Max. memory is 16.1 GB. [2021-10-21 19:06:26,716 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 119.5 MB. Free memory is still 97.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:06:26,716 INFO L168 Benchmark]: CACSL2BoogieTranslator took 648.78 ms. Allocated memory is still 119.5 MB. Free memory was 79.3 MB in the beginning and 82.8 MB in the end (delta: -3.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-21 19:06:26,717 INFO L168 Benchmark]: Boogie Preprocessor took 76.74 ms. Allocated memory is still 119.5 MB. Free memory was 82.8 MB in the beginning and 79.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-21 19:06:26,717 INFO L168 Benchmark]: RCFGBuilder took 958.95 ms. Allocated memory was 119.5 MB in the beginning and 163.6 MB in the end (delta: 44.0 MB). Free memory was 79.6 MB in the beginning and 134.1 MB in the end (delta: -54.4 MB). Peak memory consumption was 37.3 MB. Max. memory is 16.1 GB. [2021-10-21 19:06:26,718 INFO L168 Benchmark]: TraceAbstraction took 19367.82 ms. Allocated memory was 163.6 MB in the beginning and 197.1 MB in the end (delta: 33.6 MB). Free memory was 134.1 MB in the beginning and 72.2 MB in the end (delta: 61.9 MB). Peak memory consumption was 95.5 MB. Max. memory is 16.1 GB. [2021-10-21 19:06:26,718 INFO L168 Benchmark]: Witness Printer took 40.54 ms. Allocated memory is still 197.1 MB. Free memory was 72.2 MB in the beginning and 69.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:06:26,720 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.22 ms. Allocated memory is still 119.5 MB. Free memory is still 97.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 648.78 ms. Allocated memory is still 119.5 MB. Free memory was 79.3 MB in the beginning and 82.8 MB in the end (delta: -3.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 76.74 ms. Allocated memory is still 119.5 MB. Free memory was 82.8 MB in the beginning and 79.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 958.95 ms. Allocated memory was 119.5 MB in the beginning and 163.6 MB in the end (delta: 44.0 MB). Free memory was 79.6 MB in the beginning and 134.1 MB in the end (delta: -54.4 MB). Peak memory consumption was 37.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 19367.82 ms. Allocated memory was 163.6 MB in the beginning and 197.1 MB in the end (delta: 33.6 MB). Free memory was 134.1 MB in the beginning and 72.2 MB in the end (delta: 61.9 MB). Peak memory consumption was 95.5 MB. Max. memory is 16.1 GB. * Witness Printer took 40.54 ms. Allocated memory is still 197.1 MB. Free memory was 72.2 MB in the beginning and 69.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1040]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1003] SLL* list = malloc(sizeof(SLL)); [L1004] list->next = ((void*)0) VAL [list={-1:0}] [L1005] list->prev = ((void*)0) VAL [list={-1:0}] [L1006] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1006] list->inner = malloc(sizeof(SLL)) VAL [list={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1006] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1006] list->inner->next = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1006] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1006] list->inner->inner = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1006] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1006] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1] [L1006] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1008] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1022] end = ((void*)0) [L1023] end = list VAL [end={-1:0}, list={-1:0}] [L1026] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1028] COND TRUE ((void*)0) != end [L1030] int len = 0; VAL [end={-1:0}, len=0, list={-1:0}] [L1031] EXPR end->inner VAL [end={-1:0}, end->inner={-2:0}, len=0, list={-1:0}] [L1031] SLL* inner = end->inner; [L1032] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1034] COND TRUE len == 0 [L1035] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1038] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1039] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1039] COND FALSE !(!(((void*)0) == inner->inner)) [L1040] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}] [L1040] COND TRUE !(((void*)0) != inner->next) [L1040] reach_error() VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 84 error locations. Started 1 CEGAR loops. OverallTime: 19237.3ms, OverallIterations: 33, TraceHistogramMax: 2, EmptinessCheckTime: 37.8ms, AutomataDifference: 13613.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 4372 SDtfs, 5643 SDslu, 11318 SDs, 0 SdLazy, 13858 SolverSat, 405 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8748.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 424 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 3401.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=25, InterpolantAutomatonStates: 293, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 287.9ms AutomataMinimizationTime, 32 MinimizatonAttempts, 1054 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 75.8ms SsaConstructionTime, 413.2ms SatisfiabilityAnalysisTime, 3975.5ms InterpolantComputationTime, 1008 NumberOfCodeBlocks, 1008 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 7749 SizeOfPredicates, 6 NumberOfNonLiveVariables, 173 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 33 InterpolantComputations, 31 PerfectInterpolantSequences, 4/6 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 RESULT: Ultimate proved your program to be incorrect! [2021-10-21 19:06:26,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc109347-47eb-4bbc-a34d-c13287294d7a/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...