./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 63182f13 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a61d6c3-4be3-473c-bb99-276f902a0a6c/bin/uautomizer-YU5uOKAj3y/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a61d6c3-4be3-473c-bb99-276f902a0a6c/bin/uautomizer-YU5uOKAj3y/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a61d6c3-4be3-473c-bb99-276f902a0a6c/bin/uautomizer-YU5uOKAj3y/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a61d6c3-4be3-473c-bb99-276f902a0a6c/bin/uautomizer-YU5uOKAj3y/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a61d6c3-4be3-473c-bb99-276f902a0a6c/bin/uautomizer-YU5uOKAj3y/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a61d6c3-4be3-473c-bb99-276f902a0a6c/bin/uautomizer-YU5uOKAj3y --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 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-13 17:31:14,402 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-13 17:31:14,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-13 17:31:14,437 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-13 17:31:14,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-13 17:31:14,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-13 17:31:14,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-13 17:31:14,444 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-13 17:31:14,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-13 17:31:14,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-13 17:31:14,450 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-13 17:31:14,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-13 17:31:14,452 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-13 17:31:14,454 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-13 17:31:14,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-13 17:31:14,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-13 17:31:14,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-13 17:31:14,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-13 17:31:14,463 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-13 17:31:14,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-13 17:31:14,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-13 17:31:14,471 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-13 17:31:14,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-13 17:31:14,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-13 17:31:14,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-13 17:31:14,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-13 17:31:14,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-13 17:31:14,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-13 17:31:14,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-13 17:31:14,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-13 17:31:14,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-13 17:31:14,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-13 17:31:14,486 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-13 17:31:14,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-13 17:31:14,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-13 17:31:14,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-13 17:31:14,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-13 17:31:14,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-13 17:31:14,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-13 17:31:14,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-13 17:31:14,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-13 17:31:14,494 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a61d6c3-4be3-473c-bb99-276f902a0a6c/bin/uautomizer-YU5uOKAj3y/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-11-13 17:31:14,518 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-13 17:31:14,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-13 17:31:14,519 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-13 17:31:14,520 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-13 17:31:14,521 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-13 17:31:14,521 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-13 17:31:14,522 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-13 17:31:14,523 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-13 17:31:14,523 INFO L138 SettingsManager]: * Use SBE=true [2021-11-13 17:31:14,524 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-13 17:31:14,524 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-13 17:31:14,524 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-13 17:31:14,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-13 17:31:14,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-13 17:31:14,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-13 17:31:14,526 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-13 17:31:14,526 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-13 17:31:14,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-13 17:31:14,527 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-13 17:31:14,528 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-13 17:31:14,528 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-13 17:31:14,528 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-13 17:31:14,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-13 17:31:14,529 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-13 17:31:14,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 17:31:14,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-13 17:31:14,531 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-13 17:31:14,531 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-13 17:31:14,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-13 17:31:14,532 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-13 17:31:14,532 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_5a61d6c3-4be3-473c-bb99-276f902a0a6c/bin/uautomizer-YU5uOKAj3y/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_5a61d6c3-4be3-473c-bb99-276f902a0a6c/bin/uautomizer-YU5uOKAj3y 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 -> 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf [2021-11-13 17:31:14,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-13 17:31:14,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-13 17:31:14,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-13 17:31:14,846 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-13 17:31:14,847 INFO L275 PluginConnector]: CDTParser initialized [2021-11-13 17:31:14,848 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a61d6c3-4be3-473c-bb99-276f902a0a6c/bin/uautomizer-YU5uOKAj3y/../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2021-11-13 17:31:14,927 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a61d6c3-4be3-473c-bb99-276f902a0a6c/bin/uautomizer-YU5uOKAj3y/data/fd02c238b/fa6156f204ce4985ab7de6f7e635629b/FLAG9ed49d1e8 [2021-11-13 17:31:15,544 INFO L306 CDTParser]: Found 1 translation units. [2021-11-13 17:31:15,545 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a61d6c3-4be3-473c-bb99-276f902a0a6c/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2021-11-13 17:31:15,579 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a61d6c3-4be3-473c-bb99-276f902a0a6c/bin/uautomizer-YU5uOKAj3y/data/fd02c238b/fa6156f204ce4985ab7de6f7e635629b/FLAG9ed49d1e8 [2021-11-13 17:31:15,779 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a61d6c3-4be3-473c-bb99-276f902a0a6c/bin/uautomizer-YU5uOKAj3y/data/fd02c238b/fa6156f204ce4985ab7de6f7e635629b [2021-11-13 17:31:15,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-13 17:31:15,784 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-11-13 17:31:15,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-13 17:31:15,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-13 17:31:15,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-13 17:31:15,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 05:31:15" (1/1) ... [2021-11-13 17:31:15,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15be15b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:15, skipping insertion in model container [2021-11-13 17:31:15,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 05:31:15" (1/1) ... [2021-11-13 17:31:15,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-13 17:31:15,856 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-13 17:31:16,176 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_5a61d6c3-4be3-473c-bb99-276f902a0a6c/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2021-11-13 17:31:16,216 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 17:31:16,232 INFO L203 MainTranslator]: Completed pre-run [2021-11-13 17:31:16,303 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_5a61d6c3-4be3-473c-bb99-276f902a0a6c/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2021-11-13 17:31:16,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 17:31:16,363 INFO L208 MainTranslator]: Completed translation [2021-11-13 17:31:16,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:16 WrapperNode [2021-11-13 17:31:16,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-13 17:31:16,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-13 17:31:16,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-13 17:31:16,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-13 17:31:16,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:16" (1/1) ... [2021-11-13 17:31:16,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:16" (1/1) ... [2021-11-13 17:31:16,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:16" (1/1) ... [2021-11-13 17:31:16,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:16" (1/1) ... [2021-11-13 17:31:16,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:16" (1/1) ... [2021-11-13 17:31:16,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:16" (1/1) ... [2021-11-13 17:31:16,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:16" (1/1) ... [2021-11-13 17:31:16,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-13 17:31:16,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-13 17:31:16,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-13 17:31:16,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-13 17:31:16,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:16" (1/1) ... [2021-11-13 17:31:16,464 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 17:31:16,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a61d6c3-4be3-473c-bb99-276f902a0a6c/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:31:16,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a61d6c3-4be3-473c-bb99-276f902a0a6c/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-13 17:31:16,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a61d6c3-4be3-473c-bb99-276f902a0a6c/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-13 17:31:16,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-11-13 17:31:16,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-13 17:31:16,524 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-11-13 17:31:16,524 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-11-13 17:31:16,524 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-11-13 17:31:16,524 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2021-11-13 17:31:16,524 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2021-11-13 17:31:16,525 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2021-11-13 17:31:16,525 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2021-11-13 17:31:16,525 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2021-11-13 17:31:16,525 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2021-11-13 17:31:16,525 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-11-13 17:31:16,526 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-11-13 17:31:16,526 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-11-13 17:31:16,526 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-11-13 17:31:16,526 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-11-13 17:31:16,526 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-11-13 17:31:16,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-13 17:31:16,527 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-11-13 17:31:16,527 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-11-13 17:31:16,527 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-11-13 17:31:16,527 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-11-13 17:31:16,527 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-11-13 17:31:16,527 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-11-13 17:31:16,528 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-11-13 17:31:16,528 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-11-13 17:31:16,528 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-11-13 17:31:16,528 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-11-13 17:31:16,528 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-11-13 17:31:16,528 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-11-13 17:31:16,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-11-13 17:31:16,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-11-13 17:31:16,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-11-13 17:31:16,529 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-11-13 17:31:16,529 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-11-13 17:31:16,529 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-11-13 17:31:16,530 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-11-13 17:31:16,530 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-11-13 17:31:16,530 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-11-13 17:31:16,530 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-11-13 17:31:16,530 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-11-13 17:31:16,530 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-11-13 17:31:16,531 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-11-13 17:31:16,531 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-11-13 17:31:16,531 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-11-13 17:31:16,531 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-11-13 17:31:16,531 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-11-13 17:31:16,531 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-11-13 17:31:16,532 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-11-13 17:31:16,532 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-11-13 17:31:16,532 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-11-13 17:31:16,532 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-11-13 17:31:16,532 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-11-13 17:31:16,532 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-11-13 17:31:16,533 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-11-13 17:31:16,533 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-11-13 17:31:16,533 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-11-13 17:31:16,533 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-11-13 17:31:16,533 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-11-13 17:31:16,533 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-11-13 17:31:16,534 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-11-13 17:31:16,534 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-11-13 17:31:16,534 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-11-13 17:31:16,534 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-11-13 17:31:16,534 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-11-13 17:31:16,534 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-11-13 17:31:16,535 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-11-13 17:31:16,535 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-11-13 17:31:16,535 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-11-13 17:31:16,535 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-11-13 17:31:16,535 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-11-13 17:31:16,535 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-11-13 17:31:16,536 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-11-13 17:31:16,536 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-11-13 17:31:16,536 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-11-13 17:31:16,536 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-11-13 17:31:16,536 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-11-13 17:31:16,536 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-11-13 17:31:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-11-13 17:31:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-11-13 17:31:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-11-13 17:31:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-11-13 17:31:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-11-13 17:31:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-11-13 17:31:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-11-13 17:31:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-11-13 17:31:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-11-13 17:31:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-11-13 17:31:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-11-13 17:31:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-11-13 17:31:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-11-13 17:31:16,539 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-11-13 17:31:16,539 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-11-13 17:31:16,539 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-11-13 17:31:16,539 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-11-13 17:31:16,539 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-11-13 17:31:16,539 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-11-13 17:31:16,540 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-11-13 17:31:16,540 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-11-13 17:31:16,540 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-11-13 17:31:16,540 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-11-13 17:31:16,540 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-11-13 17:31:16,540 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-11-13 17:31:16,541 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-11-13 17:31:16,541 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-11-13 17:31:16,541 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-11-13 17:31:16,541 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-11-13 17:31:16,541 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-11-13 17:31:16,541 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-11-13 17:31:16,542 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-11-13 17:31:16,542 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-11-13 17:31:16,542 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-11-13 17:31:16,542 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-11-13 17:31:16,542 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-11-13 17:31:16,542 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-11-13 17:31:16,543 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-11-13 17:31:16,543 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-11-13 17:31:16,543 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-11-13 17:31:16,543 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-11-13 17:31:16,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-11-13 17:31:16,543 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2021-11-13 17:31:16,544 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2021-11-13 17:31:16,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-13 17:31:16,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-13 17:31:16,544 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2021-11-13 17:31:16,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-13 17:31:16,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-13 17:31:16,545 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2021-11-13 17:31:16,545 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2021-11-13 17:31:16,545 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2021-11-13 17:31:16,545 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-11-13 17:31:16,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-13 17:31:16,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-13 17:31:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-11-13 17:31:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-13 17:31:16,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-13 17:31:17,651 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-13 17:31:17,651 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2021-11-13 17:31:17,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:31:17 BoogieIcfgContainer [2021-11-13 17:31:17,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-13 17:31:17,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-13 17:31:17,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-13 17:31:17,662 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-13 17:31:17,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 05:31:15" (1/3) ... [2021-11-13 17:31:17,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452aa75a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 05:31:17, skipping insertion in model container [2021-11-13 17:31:17,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:16" (2/3) ... [2021-11-13 17:31:17,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452aa75a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 05:31:17, skipping insertion in model container [2021-11-13 17:31:17,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:31:17" (3/3) ... [2021-11-13 17:31:17,666 INFO L111 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2021-11-13 17:31:17,672 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-13 17:31:17,673 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 105 error locations. [2021-11-13 17:31:17,720 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-13 17:31:17,728 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-11-13 17:31:17,728 INFO L340 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2021-11-13 17:31:17,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 279 states, 144 states have (on average 2.1527777777777777) internal successors, (310), 265 states have internal predecessors, (310), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2021-11-13 17:31:17,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-13 17:31:17,761 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:17,762 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:31:17,763 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr20ENSURES_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-11-13 17:31:17,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:17,769 INFO L85 PathProgramCache]: Analyzing trace with hash -774541734, now seen corresponding path program 1 times [2021-11-13 17:31:17,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:17,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140785660] [2021-11-13 17:31:17,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:17,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:17,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:18,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:18,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:18,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140785660] [2021-11-13 17:31:18,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140785660] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:18,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:18,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 17:31:18,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286040068] [2021-11-13 17:31:18,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:18,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 17:31:18,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:18,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 17:31:18,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 17:31:18,052 INFO L87 Difference]: Start difference. First operand has 279 states, 144 states have (on average 2.1527777777777777) internal successors, (310), 265 states have internal predecessors, (310), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-11-13 17:31:18,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:18,681 INFO L93 Difference]: Finished difference Result 320 states and 355 transitions. [2021-11-13 17:31:18,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:31:18,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 9 [2021-11-13 17:31:18,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:18,698 INFO L225 Difference]: With dead ends: 320 [2021-11-13 17:31:18,698 INFO L226 Difference]: Without dead ends: 315 [2021-11-13 17:31:18,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 17:31:18,704 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 168 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 410.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.30ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 507.47ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:18,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 214 Invalid, 273 Unknown, 0 Unchecked, 19.30ms Time], IncrementalHoareTripleChecker [26 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 507.47ms Time] [2021-11-13 17:31:18,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-11-13 17:31:18,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 277. [2021-11-13 17:31:18,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 145 states have (on average 1.896551724137931) internal successors, (275), 264 states have internal predecessors, (275), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-13 17:31:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 303 transitions. [2021-11-13 17:31:18,771 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 303 transitions. Word has length 9 [2021-11-13 17:31:18,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:18,771 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 303 transitions. [2021-11-13 17:31:18,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-11-13 17:31:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 303 transitions. [2021-11-13 17:31:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-13 17:31:18,773 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:18,773 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:31:18,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-13 17:31:18,773 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-11-13 17:31:18,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:18,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1757963271, now seen corresponding path program 1 times [2021-11-13 17:31:18,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:18,775 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34417391] [2021-11-13 17:31:18,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:18,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:18,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:18,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:18,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34417391] [2021-11-13 17:31:18,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34417391] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:18,895 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:18,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 17:31:18,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535837623] [2021-11-13 17:31:18,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:18,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:31:18,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:18,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:31:18,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:31:18,900 INFO L87 Difference]: Start difference. First operand 277 states and 303 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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-11-13 17:31:19,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:19,551 INFO L93 Difference]: Finished difference Result 332 states and 369 transitions. [2021-11-13 17:31:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:31:19,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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-11-13 17:31:19,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:19,555 INFO L225 Difference]: With dead ends: 332 [2021-11-13 17:31:19,555 INFO L226 Difference]: Without dead ends: 332 [2021-11-13 17:31:19,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:31:19,557 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 199 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 485.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.07ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 594.49ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:19,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 267 Invalid, 544 Unknown, 0 Unchecked, 18.07ms Time], IncrementalHoareTripleChecker [28 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 594.49ms Time] [2021-11-13 17:31:19,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-11-13 17:31:19,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 275. [2021-11-13 17:31:19,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 145 states have (on average 1.8827586206896552) internal successors, (273), 262 states have internal predecessors, (273), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-13 17:31:19,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 301 transitions. [2021-11-13 17:31:19,581 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 301 transitions. Word has length 10 [2021-11-13 17:31:19,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:19,581 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 301 transitions. [2021-11-13 17:31:19,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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-11-13 17:31:19,582 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 301 transitions. [2021-11-13 17:31:19,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-13 17:31:19,582 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:19,582 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:31:19,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-13 17:31:19,583 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-11-13 17:31:19,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:19,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1757963272, now seen corresponding path program 1 times [2021-11-13 17:31:19,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:19,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807778006] [2021-11-13 17:31:19,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:19,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:19,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:19,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:19,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:19,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807778006] [2021-11-13 17:31:19,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807778006] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:19,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:19,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 17:31:19,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787965138] [2021-11-13 17:31:19,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:19,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:31:19,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:19,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:31:19,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:31:19,715 INFO L87 Difference]: Start difference. First operand 275 states and 301 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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-11-13 17:31:20,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:20,349 INFO L93 Difference]: Finished difference Result 342 states and 380 transitions. [2021-11-13 17:31:20,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:31:20,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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-11-13 17:31:20,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:20,353 INFO L225 Difference]: With dead ends: 342 [2021-11-13 17:31:20,353 INFO L226 Difference]: Without dead ends: 342 [2021-11-13 17:31:20,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:31:20,355 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 211 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 486.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.10ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 593.59ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:20,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 287 Invalid, 545 Unknown, 0 Unchecked, 11.10ms Time], IncrementalHoareTripleChecker [28 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 593.59ms Time] [2021-11-13 17:31:20,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-11-13 17:31:20,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 273. [2021-11-13 17:31:20,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 145 states have (on average 1.8689655172413793) internal successors, (271), 260 states have internal predecessors, (271), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-13 17:31:20,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 299 transitions. [2021-11-13 17:31:20,393 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 299 transitions. Word has length 10 [2021-11-13 17:31:20,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:20,394 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 299 transitions. [2021-11-13 17:31:20,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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-11-13 17:31:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 299 transitions. [2021-11-13 17:31:20,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-13 17:31:20,397 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:20,397 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:31:20,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-13 17:31:20,397 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-11-13 17:31:20,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:20,400 INFO L85 PathProgramCache]: Analyzing trace with hash 389021379, now seen corresponding path program 1 times [2021-11-13 17:31:20,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:20,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581756965] [2021-11-13 17:31:20,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:20,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:20,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:20,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:20,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:20,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581756965] [2021-11-13 17:31:20,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581756965] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:20,518 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:20,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 17:31:20,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851713352] [2021-11-13 17:31:20,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:20,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:31:20,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:20,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:31:20,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:31:20,522 INFO L87 Difference]: Start difference. First operand 273 states and 299 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:21,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:21,057 INFO L93 Difference]: Finished difference Result 308 states and 335 transitions. [2021-11-13 17:31:21,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 17:31:21,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-11-13 17:31:21,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:21,061 INFO L225 Difference]: With dead ends: 308 [2021-11-13 17:31:21,061 INFO L226 Difference]: Without dead ends: 307 [2021-11-13 17:31:21,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-13 17:31:21,063 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 163 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 404.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.92ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 484.04ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:21,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 343 Invalid, 417 Unknown, 0 Unchecked, 9.92ms Time], IncrementalHoareTripleChecker [23 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 484.04ms Time] [2021-11-13 17:31:21,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-11-13 17:31:21,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 272. [2021-11-13 17:31:21,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 144 states have (on average 1.8680555555555556) internal successors, (269), 259 states have internal predecessors, (269), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-13 17:31:21,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 297 transitions. [2021-11-13 17:31:21,075 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 297 transitions. Word has length 14 [2021-11-13 17:31:21,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:21,075 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 297 transitions. [2021-11-13 17:31:21,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:21,076 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 297 transitions. [2021-11-13 17:31:21,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-13 17:31:21,077 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:21,077 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:31:21,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-13 17:31:21,077 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-11-13 17:31:21,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:21,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1684555217, now seen corresponding path program 1 times [2021-11-13 17:31:21,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:21,078 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511434600] [2021-11-13 17:31:21,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:21,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:21,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:21,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:21,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511434600] [2021-11-13 17:31:21,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511434600] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:21,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:21,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 17:31:21,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441441533] [2021-11-13 17:31:21,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:21,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:31:21,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:21,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:31:21,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:31:21,140 INFO L87 Difference]: Start difference. First operand 272 states and 297 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-13 17:31:21,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:21,693 INFO L93 Difference]: Finished difference Result 314 states and 345 transitions. [2021-11-13 17:31:21,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:31:21,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 15 [2021-11-13 17:31:21,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:21,696 INFO L225 Difference]: With dead ends: 314 [2021-11-13 17:31:21,696 INFO L226 Difference]: Without dead ends: 314 [2021-11-13 17:31:21,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:31:21,698 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 178 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 432.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.43ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 518.76ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:21,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 268 Invalid, 498 Unknown, 0 Unchecked, 9.43ms Time], IncrementalHoareTripleChecker [26 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 518.76ms Time] [2021-11-13 17:31:21,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-11-13 17:31:21,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 270. [2021-11-13 17:31:21,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 144 states have (on average 1.8541666666666667) internal successors, (267), 257 states have internal predecessors, (267), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-13 17:31:21,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 295 transitions. [2021-11-13 17:31:21,709 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 295 transitions. Word has length 15 [2021-11-13 17:31:21,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:21,710 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 295 transitions. [2021-11-13 17:31:21,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-13 17:31:21,710 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 295 transitions. [2021-11-13 17:31:21,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-13 17:31:21,711 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:21,711 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:31:21,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-13 17:31:21,712 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr5REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-11-13 17:31:21,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:21,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1684555216, now seen corresponding path program 1 times [2021-11-13 17:31:21,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:21,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828242440] [2021-11-13 17:31:21,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:21,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:21,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:21,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:21,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:21,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828242440] [2021-11-13 17:31:21,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828242440] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:21,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:21,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 17:31:21,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663575156] [2021-11-13 17:31:21,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:21,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:31:21,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:21,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:31:21,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:31:21,780 INFO L87 Difference]: Start difference. First operand 270 states and 295 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-13 17:31:22,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:22,306 INFO L93 Difference]: Finished difference Result 324 states and 356 transitions. [2021-11-13 17:31:22,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:31:22,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 15 [2021-11-13 17:31:22,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:22,309 INFO L225 Difference]: With dead ends: 324 [2021-11-13 17:31:22,309 INFO L226 Difference]: Without dead ends: 324 [2021-11-13 17:31:22,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:31:22,310 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 190 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 406.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.66ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 495.93ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:22,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 277 Invalid, 485 Unknown, 0 Unchecked, 8.66ms Time], IncrementalHoareTripleChecker [26 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 495.93ms Time] [2021-11-13 17:31:22,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-11-13 17:31:22,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 268. [2021-11-13 17:31:22,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 144 states have (on average 1.8402777777777777) internal successors, (265), 255 states have internal predecessors, (265), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-13 17:31:22,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 293 transitions. [2021-11-13 17:31:22,326 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 293 transitions. Word has length 15 [2021-11-13 17:31:22,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:22,327 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 293 transitions. [2021-11-13 17:31:22,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-13 17:31:22,327 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 293 transitions. [2021-11-13 17:31:22,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-13 17:31:22,328 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:22,328 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:31:22,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-13 17:31:22,329 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr20ENSURES_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-11-13 17:31:22,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:22,329 INFO L85 PathProgramCache]: Analyzing trace with hash 663488011, now seen corresponding path program 1 times [2021-11-13 17:31:22,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:22,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985609523] [2021-11-13 17:31:22,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:22,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:22,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:22,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:22,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:22,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985609523] [2021-11-13 17:31:22,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985609523] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:22,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:22,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 17:31:22,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495811897] [2021-11-13 17:31:22,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:22,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 17:31:22,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:22,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 17:31:22,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-13 17:31:22,441 INFO L87 Difference]: Start difference. First operand 268 states and 293 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-11-13 17:31:23,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:23,024 INFO L93 Difference]: Finished difference Result 327 states and 359 transitions. [2021-11-13 17:31:23,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 17:31:23,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 21 [2021-11-13 17:31:23,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:23,028 INFO L225 Difference]: With dead ends: 327 [2021-11-13 17:31:23,028 INFO L226 Difference]: Without dead ends: 327 [2021-11-13 17:31:23,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-13 17:31:23,029 INFO L933 BasicCegarLoop]: 201 mSDtfsCounter, 257 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 443.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.21ms SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 544.72ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:23,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 424 Invalid, 603 Unknown, 0 Unchecked, 10.21ms Time], IncrementalHoareTripleChecker [32 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 544.72ms Time] [2021-11-13 17:31:23,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-11-13 17:31:23,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2021-11-13 17:31:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 144 states have (on average 1.8333333333333333) internal successors, (264), 255 states have internal predecessors, (264), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-13 17:31:23,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 292 transitions. [2021-11-13 17:31:23,040 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 292 transitions. Word has length 21 [2021-11-13 17:31:23,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:23,040 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 292 transitions. [2021-11-13 17:31:23,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-11-13 17:31:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 292 transitions. [2021-11-13 17:31:23,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-13 17:31:23,042 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:23,042 INFO L514 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] [2021-11-13 17:31:23,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-13 17:31:23,042 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-11-13 17:31:23,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:23,043 INFO L85 PathProgramCache]: Analyzing trace with hash -584553579, now seen corresponding path program 1 times [2021-11-13 17:31:23,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:23,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626921077] [2021-11-13 17:31:23,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:23,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:23,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:23,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:23,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:23,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626921077] [2021-11-13 17:31:23,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626921077] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:23,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:23,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 17:31:23,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443028260] [2021-11-13 17:31:23,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:23,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 17:31:23,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:23,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 17:31:23,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:31:23,125 INFO L87 Difference]: Start difference. First operand 268 states and 292 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:23,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:23,920 INFO L93 Difference]: Finished difference Result 382 states and 420 transitions. [2021-11-13 17:31:23,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 17:31:23,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-11-13 17:31:23,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:23,923 INFO L225 Difference]: With dead ends: 382 [2021-11-13 17:31:23,923 INFO L226 Difference]: Without dead ends: 382 [2021-11-13 17:31:23,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-13 17:31:23,925 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 485 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 570.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.73ms SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 700.44ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:23,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [488 Valid, 676 Invalid, 893 Unknown, 0 Unchecked, 13.73ms Time], IncrementalHoareTripleChecker [41 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 700.44ms Time] [2021-11-13 17:31:23,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-11-13 17:31:23,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 271. [2021-11-13 17:31:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 148 states have (on average 1.8243243243243243) internal successors, (270), 258 states have internal predecessors, (270), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-13 17:31:23,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 297 transitions. [2021-11-13 17:31:23,935 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 297 transitions. Word has length 25 [2021-11-13 17:31:23,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:23,936 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 297 transitions. [2021-11-13 17:31:23,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:23,941 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 297 transitions. [2021-11-13 17:31:23,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-13 17:31:23,942 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:23,943 INFO L514 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] [2021-11-13 17:31:23,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-13 17:31:23,943 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting inspect_beforeErr0REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-11-13 17:31:23,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:23,944 INFO L85 PathProgramCache]: Analyzing trace with hash -584567887, now seen corresponding path program 1 times [2021-11-13 17:31:23,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:23,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318177100] [2021-11-13 17:31:23,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:23,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:24,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:24,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:24,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:24,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318177100] [2021-11-13 17:31:24,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318177100] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:24,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:24,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-13 17:31:24,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994491318] [2021-11-13 17:31:24,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:24,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 17:31:24,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:24,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 17:31:24,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:31:24,061 INFO L87 Difference]: Start difference. First operand 271 states and 297 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:24,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:24,866 INFO L93 Difference]: Finished difference Result 310 states and 341 transitions. [2021-11-13 17:31:24,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-13 17:31:24,867 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 3 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 25 [2021-11-13 17:31:24,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:24,872 INFO L225 Difference]: With dead ends: 310 [2021-11-13 17:31:24,872 INFO L226 Difference]: Without dead ends: 310 [2021-11-13 17:31:24,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-13 17:31:24,876 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 299 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 584.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.42ms SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 708.62ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:24,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 439 Invalid, 1074 Unknown, 0 Unchecked, 9.42ms Time], IncrementalHoareTripleChecker [48 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 708.62ms Time] [2021-11-13 17:31:24,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-11-13 17:31:24,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 263. [2021-11-13 17:31:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 149 states have (on average 1.7583892617449663) internal successors, (262), 249 states have internal predecessors, (262), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-13 17:31:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 289 transitions. [2021-11-13 17:31:24,893 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 289 transitions. Word has length 25 [2021-11-13 17:31:24,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:24,896 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 289 transitions. [2021-11-13 17:31:24,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:24,896 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 289 transitions. [2021-11-13 17:31:24,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-13 17:31:24,898 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:24,898 INFO L514 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] [2021-11-13 17:31:24,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-13 17:31:24,898 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting inspect_beforeErr1REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-11-13 17:31:24,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:24,899 INFO L85 PathProgramCache]: Analyzing trace with hash -584567886, now seen corresponding path program 1 times [2021-11-13 17:31:24,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:24,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556569329] [2021-11-13 17:31:24,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:24,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:25,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:25,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:25,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556569329] [2021-11-13 17:31:25,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556569329] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:25,031 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:25,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-13 17:31:25,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262189116] [2021-11-13 17:31:25,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:25,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 17:31:25,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:25,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 17:31:25,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:31:25,032 INFO L87 Difference]: Start difference. First operand 263 states and 289 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:25,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:25,922 INFO L93 Difference]: Finished difference Result 381 states and 422 transitions. [2021-11-13 17:31:25,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 17:31:25,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 3 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 25 [2021-11-13 17:31:25,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:25,926 INFO L225 Difference]: With dead ends: 381 [2021-11-13 17:31:25,926 INFO L226 Difference]: Without dead ends: 381 [2021-11-13 17:31:25,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-13 17:31:25,927 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 404 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 639.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.25ms SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 790.05ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:25,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [405 Valid, 470 Invalid, 1116 Unknown, 0 Unchecked, 9.25ms Time], IncrementalHoareTripleChecker [52 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 790.05ms Time] [2021-11-13 17:31:25,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-13 17:31:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 288. [2021-11-13 17:31:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 173 states have (on average 1.6878612716763006) internal successors, (292), 273 states have internal predecessors, (292), 21 states have call successors, (21), 8 states have call predecessors, (21), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-13 17:31:25,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 321 transitions. [2021-11-13 17:31:25,937 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 321 transitions. Word has length 25 [2021-11-13 17:31:25,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:25,938 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 321 transitions. [2021-11-13 17:31:25,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:25,938 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 321 transitions. [2021-11-13 17:31:25,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-13 17:31:25,939 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:25,939 INFO L514 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] [2021-11-13 17:31:25,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-13 17:31:25,940 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-11-13 17:31:25,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:25,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1204412220, now seen corresponding path program 1 times [2021-11-13 17:31:25,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:25,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336758255] [2021-11-13 17:31:25,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:25,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:26,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-13 17:31:26,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:26,028 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336758255] [2021-11-13 17:31:26,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336758255] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:26,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:26,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-13 17:31:26,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716336354] [2021-11-13 17:31:26,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:26,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 17:31:26,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:26,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 17:31:26,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-13 17:31:26,030 INFO L87 Difference]: Start difference. First operand 288 states and 321 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:26,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:26,635 INFO L93 Difference]: Finished difference Result 307 states and 341 transitions. [2021-11-13 17:31:26,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-13 17:31:26,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-11-13 17:31:26,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:26,638 INFO L225 Difference]: With dead ends: 307 [2021-11-13 17:31:26,638 INFO L226 Difference]: Without dead ends: 307 [2021-11-13 17:31:26,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-13 17:31:26,639 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 155 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 443.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.08ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 533.60ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:26,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 560 Invalid, 691 Unknown, 0 Unchecked, 5.08ms Time], IncrementalHoareTripleChecker [23 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 533.60ms Time] [2021-11-13 17:31:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-11-13 17:31:26,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 287. [2021-11-13 17:31:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 173 states have (on average 1.676300578034682) internal successors, (290), 272 states have internal predecessors, (290), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-13 17:31:26,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 318 transitions. [2021-11-13 17:31:26,649 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 318 transitions. Word has length 32 [2021-11-13 17:31:26,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:26,649 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 318 transitions. [2021-11-13 17:31:26,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:26,649 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 318 transitions. [2021-11-13 17:31:26,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-13 17:31:26,651 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:26,651 INFO L514 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] [2021-11-13 17:31:26,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-13 17:31:26,651 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-11-13 17:31:26,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:26,652 INFO L85 PathProgramCache]: Analyzing trace with hash 523995142, now seen corresponding path program 1 times [2021-11-13 17:31:26,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:26,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779045743] [2021-11-13 17:31:26,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:26,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:26,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:26,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-13 17:31:26,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:26,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779045743] [2021-11-13 17:31:26,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779045743] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:26,752 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:26,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-13 17:31:26,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667690610] [2021-11-13 17:31:26,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:26,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 17:31:26,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:26,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 17:31:26,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-13 17:31:26,754 INFO L87 Difference]: Start difference. First operand 287 states and 318 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:27,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:27,359 INFO L93 Difference]: Finished difference Result 306 states and 338 transitions. [2021-11-13 17:31:27,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-13 17:31:27,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-11-13 17:31:27,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:27,364 INFO L225 Difference]: With dead ends: 306 [2021-11-13 17:31:27,364 INFO L226 Difference]: Without dead ends: 306 [2021-11-13 17:31:27,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-13 17:31:27,365 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 155 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 421.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.03ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 522.03ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:27,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 557 Invalid, 684 Unknown, 0 Unchecked, 5.03ms Time], IncrementalHoareTripleChecker [22 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 522.03ms Time] [2021-11-13 17:31:27,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-11-13 17:31:27,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 286. [2021-11-13 17:31:27,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 173 states have (on average 1.6647398843930636) internal successors, (288), 271 states have internal predecessors, (288), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-13 17:31:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 315 transitions. [2021-11-13 17:31:27,374 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 315 transitions. Word has length 32 [2021-11-13 17:31:27,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:27,375 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 315 transitions. [2021-11-13 17:31:27,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:27,375 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 315 transitions. [2021-11-13 17:31:27,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-13 17:31:27,377 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:27,377 INFO L514 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] [2021-11-13 17:31:27,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-13 17:31:27,377 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-11-13 17:31:27,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:27,378 INFO L85 PathProgramCache]: Analyzing trace with hash 173443807, now seen corresponding path program 1 times [2021-11-13 17:31:27,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:27,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020773584] [2021-11-13 17:31:27,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:27,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:27,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:27,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:27,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:27,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020773584] [2021-11-13 17:31:27,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020773584] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:27,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:27,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-13 17:31:27,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161519330] [2021-11-13 17:31:27,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:27,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-13 17:31:27,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:27,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-13 17:31:27,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-13 17:31:27,505 INFO L87 Difference]: Start difference. First operand 286 states and 315 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:28,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:28,433 INFO L93 Difference]: Finished difference Result 341 states and 373 transitions. [2021-11-13 17:31:28,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:31:28,434 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-11-13 17:31:28,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:28,436 INFO L225 Difference]: With dead ends: 341 [2021-11-13 17:31:28,437 INFO L226 Difference]: Without dead ends: 341 [2021-11-13 17:31:28,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-11-13 17:31:28,438 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 401 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 683.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.47ms SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 816.73ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:28,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 795 Invalid, 1253 Unknown, 0 Unchecked, 9.47ms Time], IncrementalHoareTripleChecker [42 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 816.73ms Time] [2021-11-13 17:31:28,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-11-13 17:31:28,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 286. [2021-11-13 17:31:28,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 173 states have (on average 1.6589595375722543) internal successors, (287), 271 states have internal predecessors, (287), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-13 17:31:28,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 314 transitions. [2021-11-13 17:31:28,449 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 314 transitions. Word has length 35 [2021-11-13 17:31:28,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:28,449 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 314 transitions. [2021-11-13 17:31:28,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:28,450 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 314 transitions. [2021-11-13 17:31:28,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-13 17:31:28,451 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:28,451 INFO L514 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] [2021-11-13 17:31:28,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-13 17:31:28,451 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-11-13 17:31:28,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:28,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2042093490, now seen corresponding path program 1 times [2021-11-13 17:31:28,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:28,452 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203533509] [2021-11-13 17:31:28,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:28,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:28,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:28,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:28,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:28,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203533509] [2021-11-13 17:31:28,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203533509] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:28,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:28,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-13 17:31:28,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352725371] [2021-11-13 17:31:28,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:28,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-13 17:31:28,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:28,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-13 17:31:28,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-13 17:31:28,551 INFO L87 Difference]: Start difference. First operand 286 states and 314 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:29,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:29,395 INFO L93 Difference]: Finished difference Result 340 states and 371 transitions. [2021-11-13 17:31:29,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:31:29,395 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-11-13 17:31:29,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:29,398 INFO L225 Difference]: With dead ends: 340 [2021-11-13 17:31:29,398 INFO L226 Difference]: Without dead ends: 340 [2021-11-13 17:31:29,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-11-13 17:31:29,399 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 398 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 593.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.20ms SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 739.40ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:29,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [401 Valid, 795 Invalid, 1252 Unknown, 0 Unchecked, 7.20ms Time], IncrementalHoareTripleChecker [41 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 739.40ms Time] [2021-11-13 17:31:29,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-11-13 17:31:29,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 286. [2021-11-13 17:31:29,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 173 states have (on average 1.653179190751445) internal successors, (286), 271 states have internal predecessors, (286), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-13 17:31:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 313 transitions. [2021-11-13 17:31:29,410 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 313 transitions. Word has length 35 [2021-11-13 17:31:29,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:29,411 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 313 transitions. [2021-11-13 17:31:29,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:29,411 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 313 transitions. [2021-11-13 17:31:29,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-13 17:31:29,412 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:29,412 INFO L514 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-11-13 17:31:29,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-13 17:31:29,413 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting inspect_beforeErr18REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-11-13 17:31:29,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:29,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1081480683, now seen corresponding path program 1 times [2021-11-13 17:31:29,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:29,413 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416767292] [2021-11-13 17:31:29,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:29,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:29,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:29,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:29,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416767292] [2021-11-13 17:31:29,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416767292] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:29,622 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:29,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-13 17:31:29,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083537909] [2021-11-13 17:31:29,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:29,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-13 17:31:29,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:29,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-13 17:31:29,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-13 17:31:29,626 INFO L87 Difference]: Start difference. First operand 286 states and 313 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:30,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:30,941 INFO L93 Difference]: Finished difference Result 354 states and 389 transitions. [2021-11-13 17:31:30,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-13 17:31:30,942 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 3 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-11-13 17:31:30,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:30,945 INFO L225 Difference]: With dead ends: 354 [2021-11-13 17:31:30,945 INFO L226 Difference]: Without dead ends: 354 [2021-11-13 17:31:30,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-11-13 17:31:30,946 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 412 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 882.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.50ms SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1073.06ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:30,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 572 Invalid, 1562 Unknown, 0 Unchecked, 10.50ms Time], IncrementalHoareTripleChecker [55 Valid, 1507 Invalid, 0 Unknown, 0 Unchecked, 1073.06ms Time] [2021-11-13 17:31:30,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-11-13 17:31:30,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 287. [2021-11-13 17:31:30,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 174 states have (on average 1.6551724137931034) internal successors, (288), 272 states have internal predecessors, (288), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-13 17:31:30,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 315 transitions. [2021-11-13 17:31:30,957 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 315 transitions. Word has length 36 [2021-11-13 17:31:30,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:30,958 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 315 transitions. [2021-11-13 17:31:30,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:30,958 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 315 transitions. [2021-11-13 17:31:30,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-13 17:31:30,959 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:30,960 INFO L514 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-11-13 17:31:30,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-13 17:31:30,960 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting inspect_beforeErr19REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-11-13 17:31:30,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:30,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1081480684, now seen corresponding path program 1 times [2021-11-13 17:31:30,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:30,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7355525] [2021-11-13 17:31:30,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:30,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:31,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:31,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:31,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:31,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7355525] [2021-11-13 17:31:31,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7355525] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:31,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:31,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-13 17:31:31,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514097657] [2021-11-13 17:31:31,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:31,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-13 17:31:31,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:31,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-13 17:31:31,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-13 17:31:31,136 INFO L87 Difference]: Start difference. First operand 287 states and 315 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:32,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:32,190 INFO L93 Difference]: Finished difference Result 367 states and 402 transitions. [2021-11-13 17:31:32,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:31:32,191 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 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-11-13 17:31:32,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:32,193 INFO L225 Difference]: With dead ends: 367 [2021-11-13 17:31:32,193 INFO L226 Difference]: Without dead ends: 367 [2021-11-13 17:31:32,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-11-13 17:31:32,194 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 391 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 744.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.66ms SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 898.15ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:32,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 593 Invalid, 1501 Unknown, 0 Unchecked, 8.66ms Time], IncrementalHoareTripleChecker [42 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 898.15ms Time] [2021-11-13 17:31:32,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-11-13 17:31:32,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 287. [2021-11-13 17:31:32,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 174 states have (on average 1.6494252873563218) internal successors, (287), 272 states have internal predecessors, (287), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-13 17:31:32,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 314 transitions. [2021-11-13 17:31:32,204 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 314 transitions. Word has length 36 [2021-11-13 17:31:32,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:32,204 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 314 transitions. [2021-11-13 17:31:32,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:32,204 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 314 transitions. [2021-11-13 17:31:32,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-13 17:31:32,206 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:32,206 INFO L514 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-11-13 17:31:32,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-13 17:31:32,206 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting inspect_beforeErr8REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-11-13 17:31:32,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:32,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1119996019, now seen corresponding path program 1 times [2021-11-13 17:31:32,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:32,207 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030596593] [2021-11-13 17:31:32,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:32,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:32,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:32,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:32,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:32,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030596593] [2021-11-13 17:31:32,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030596593] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:32,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:32,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-13 17:31:32,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66062772] [2021-11-13 17:31:32,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:32,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-13 17:31:32,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:32,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-13 17:31:32,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-13 17:31:32,384 INFO L87 Difference]: Start difference. First operand 287 states and 314 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:33,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:33,657 INFO L93 Difference]: Finished difference Result 352 states and 387 transitions. [2021-11-13 17:31:33,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-13 17:31:33,658 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 3 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-11-13 17:31:33,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:33,660 INFO L225 Difference]: With dead ends: 352 [2021-11-13 17:31:33,660 INFO L226 Difference]: Without dead ends: 352 [2021-11-13 17:31:33,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-11-13 17:31:33,662 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 357 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 898.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.97ms SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1077.76ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:33,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 690 Invalid, 1959 Unknown, 0 Unchecked, 9.97ms Time], IncrementalHoareTripleChecker [47 Valid, 1912 Invalid, 0 Unknown, 0 Unchecked, 1077.76ms Time] [2021-11-13 17:31:33,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-11-13 17:31:33,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 287. [2021-11-13 17:31:33,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 174 states have (on average 1.6436781609195403) internal successors, (286), 272 states have internal predecessors, (286), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-13 17:31:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 313 transitions. [2021-11-13 17:31:33,672 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 313 transitions. Word has length 36 [2021-11-13 17:31:33,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:33,672 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 313 transitions. [2021-11-13 17:31:33,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:33,673 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 313 transitions. [2021-11-13 17:31:33,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-13 17:31:33,673 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:33,674 INFO L514 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-11-13 17:31:33,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-13 17:31:33,674 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting inspect_beforeErr9REQUIRES_VIOLATION === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-11-13 17:31:33,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:33,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1119996018, now seen corresponding path program 1 times [2021-11-13 17:31:33,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:33,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833117940] [2021-11-13 17:31:33,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:33,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:33,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:33,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:33,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:33,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833117940] [2021-11-13 17:31:33,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833117940] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:33,839 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:33,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-13 17:31:33,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050132280] [2021-11-13 17:31:33,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:33,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-13 17:31:33,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:33,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-13 17:31:33,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-13 17:31:33,841 INFO L87 Difference]: Start difference. First operand 287 states and 313 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:34,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:34,948 INFO L93 Difference]: Finished difference Result 365 states and 400 transitions. [2021-11-13 17:31:34,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:31:34,949 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 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-11-13 17:31:34,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:34,951 INFO L225 Difference]: With dead ends: 365 [2021-11-13 17:31:34,951 INFO L226 Difference]: Without dead ends: 365 [2021-11-13 17:31:34,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-11-13 17:31:34,953 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 385 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 790.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.53ms SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 973.39ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:34,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [386 Valid, 593 Invalid, 1501 Unknown, 0 Unchecked, 8.53ms Time], IncrementalHoareTripleChecker [42 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 973.39ms Time] [2021-11-13 17:31:34,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-11-13 17:31:34,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 287. [2021-11-13 17:31:34,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 174 states have (on average 1.6379310344827587) internal successors, (285), 272 states have internal predecessors, (285), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-13 17:31:34,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 312 transitions. [2021-11-13 17:31:34,964 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 312 transitions. Word has length 36 [2021-11-13 17:31:34,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:34,964 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 312 transitions. [2021-11-13 17:31:34,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-13 17:31:34,965 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 312 transitions. [2021-11-13 17:31:34,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-13 17:31:34,965 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:34,965 INFO L514 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, 1, 1, 1] [2021-11-13 17:31:34,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-13 17:31:34,966 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION (and 101 more)] === [2021-11-13 17:31:34,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:34,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1841504364, now seen corresponding path program 1 times [2021-11-13 17:31:34,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:34,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536883123] [2021-11-13 17:31:34,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:34,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:31:34,985 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 17:31:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 17:31:35,033 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 17:31:35,033 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-13 17:31:35,034 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONMEMORY_LEAK (104 of 105 remaining) [2021-11-13 17:31:35,036 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr0REQUIRES_VIOLATION (103 of 105 remaining) [2021-11-13 17:31:35,038 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr1REQUIRES_VIOLATION (102 of 105 remaining) [2021-11-13 17:31:35,038 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr2REQUIRES_VIOLATION (101 of 105 remaining) [2021-11-13 17:31:35,038 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr3REQUIRES_VIOLATION (100 of 105 remaining) [2021-11-13 17:31:35,038 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr4REQUIRES_VIOLATION (99 of 105 remaining) [2021-11-13 17:31:35,038 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr5REQUIRES_VIOLATION (98 of 105 remaining) [2021-11-13 17:31:35,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr6REQUIRES_VIOLATION (97 of 105 remaining) [2021-11-13 17:31:35,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr7REQUIRES_VIOLATION (96 of 105 remaining) [2021-11-13 17:31:35,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr8REQUIRES_VIOLATION (95 of 105 remaining) [2021-11-13 17:31:35,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr9REQUIRES_VIOLATION (94 of 105 remaining) [2021-11-13 17:31:35,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr10REQUIRES_VIOLATION (93 of 105 remaining) [2021-11-13 17:31:35,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr11REQUIRES_VIOLATION (92 of 105 remaining) [2021-11-13 17:31:35,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr12REQUIRES_VIOLATION (91 of 105 remaining) [2021-11-13 17:31:35,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr13REQUIRES_VIOLATION (90 of 105 remaining) [2021-11-13 17:31:35,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr14REQUIRES_VIOLATION (89 of 105 remaining) [2021-11-13 17:31:35,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr15REQUIRES_VIOLATION (88 of 105 remaining) [2021-11-13 17:31:35,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr16REQUIRES_VIOLATION (87 of 105 remaining) [2021-11-13 17:31:35,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr17REQUIRES_VIOLATION (86 of 105 remaining) [2021-11-13 17:31:35,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr18REQUIRES_VIOLATION (85 of 105 remaining) [2021-11-13 17:31:35,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_beforeErr19REQUIRES_VIOLATION (84 of 105 remaining) [2021-11-13 17:31:35,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr0REQUIRES_VIOLATION (83 of 105 remaining) [2021-11-13 17:31:35,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr1REQUIRES_VIOLATION (82 of 105 remaining) [2021-11-13 17:31:35,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr2REQUIRES_VIOLATION (81 of 105 remaining) [2021-11-13 17:31:35,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr3REQUIRES_VIOLATION (80 of 105 remaining) [2021-11-13 17:31:35,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr4REQUIRES_VIOLATION (79 of 105 remaining) [2021-11-13 17:31:35,043 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr5REQUIRES_VIOLATION (78 of 105 remaining) [2021-11-13 17:31:35,043 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr6REQUIRES_VIOLATION (77 of 105 remaining) [2021-11-13 17:31:35,044 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr7REQUIRES_VIOLATION (76 of 105 remaining) [2021-11-13 17:31:35,044 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr8REQUIRES_VIOLATION (75 of 105 remaining) [2021-11-13 17:31:35,044 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr9REQUIRES_VIOLATION (74 of 105 remaining) [2021-11-13 17:31:35,044 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr10REQUIRES_VIOLATION (73 of 105 remaining) [2021-11-13 17:31:35,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspect_afterErr11REQUIRES_VIOLATION (72 of 105 remaining) [2021-11-13 17:31:35,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr0REQUIRES_VIOLATION (71 of 105 remaining) [2021-11-13 17:31:35,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr1REQUIRES_VIOLATION (70 of 105 remaining) [2021-11-13 17:31:35,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr2REQUIRES_VIOLATION (69 of 105 remaining) [2021-11-13 17:31:35,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr3REQUIRES_VIOLATION (68 of 105 remaining) [2021-11-13 17:31:35,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr4REQUIRES_VIOLATION (67 of 105 remaining) [2021-11-13 17:31:35,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr5REQUIRES_VIOLATION (66 of 105 remaining) [2021-11-13 17:31:35,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr6REQUIRES_VIOLATION (65 of 105 remaining) [2021-11-13 17:31:35,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr7REQUIRES_VIOLATION (64 of 105 remaining) [2021-11-13 17:31:35,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr8REQUIRES_VIOLATION (63 of 105 remaining) [2021-11-13 17:31:35,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr9REQUIRES_VIOLATION (62 of 105 remaining) [2021-11-13 17:31:35,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr10REQUIRES_VIOLATION (61 of 105 remaining) [2021-11-13 17:31:35,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr11REQUIRES_VIOLATION (60 of 105 remaining) [2021-11-13 17:31:35,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr12REQUIRES_VIOLATION (59 of 105 remaining) [2021-11-13 17:31:35,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr13REQUIRES_VIOLATION (58 of 105 remaining) [2021-11-13 17:31:35,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr0REQUIRES_VIOLATION (57 of 105 remaining) [2021-11-13 17:31:35,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr1REQUIRES_VIOLATION (56 of 105 remaining) [2021-11-13 17:31:35,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr2REQUIRES_VIOLATION (55 of 105 remaining) [2021-11-13 17:31:35,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr3REQUIRES_VIOLATION (54 of 105 remaining) [2021-11-13 17:31:35,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr4REQUIRES_VIOLATION (53 of 105 remaining) [2021-11-13 17:31:35,048 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr5REQUIRES_VIOLATION (52 of 105 remaining) [2021-11-13 17:31:35,049 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr6REQUIRES_VIOLATION (51 of 105 remaining) [2021-11-13 17:31:35,049 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr7REQUIRES_VIOLATION (50 of 105 remaining) [2021-11-13 17:31:35,049 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr8REQUIRES_VIOLATION (49 of 105 remaining) [2021-11-13 17:31:35,049 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr9REQUIRES_VIOLATION (48 of 105 remaining) [2021-11-13 17:31:35,049 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr10REQUIRES_VIOLATION (47 of 105 remaining) [2021-11-13 17:31:35,050 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr11REQUIRES_VIOLATION (46 of 105 remaining) [2021-11-13 17:31:35,050 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr12REQUIRES_VIOLATION (45 of 105 remaining) [2021-11-13 17:31:35,050 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr13REQUIRES_VIOLATION (44 of 105 remaining) [2021-11-13 17:31:35,050 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr14REQUIRES_VIOLATION (43 of 105 remaining) [2021-11-13 17:31:35,050 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr15REQUIRES_VIOLATION (42 of 105 remaining) [2021-11-13 17:31:35,050 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr16REQUIRES_VIOLATION (41 of 105 remaining) [2021-11-13 17:31:35,051 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr17REQUIRES_VIOLATION (40 of 105 remaining) [2021-11-13 17:31:35,051 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr18REQUIRES_VIOLATION (39 of 105 remaining) [2021-11-13 17:31:35,051 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr19REQUIRES_VIOLATION (38 of 105 remaining) [2021-11-13 17:31:35,051 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr20REQUIRES_VIOLATION (37 of 105 remaining) [2021-11-13 17:31:35,051 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_pairErr21REQUIRES_VIOLATION (36 of 105 remaining) [2021-11-13 17:31:35,054 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION (35 of 105 remaining) [2021-11-13 17:31:35,054 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION (34 of 105 remaining) [2021-11-13 17:31:35,054 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION (33 of 105 remaining) [2021-11-13 17:31:35,055 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION (32 of 105 remaining) [2021-11-13 17:31:35,055 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION (31 of 105 remaining) [2021-11-13 17:31:35,055 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION (30 of 105 remaining) [2021-11-13 17:31:35,055 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION (29 of 105 remaining) [2021-11-13 17:31:35,056 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION (28 of 105 remaining) [2021-11-13 17:31:35,056 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION (27 of 105 remaining) [2021-11-13 17:31:35,057 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION (26 of 105 remaining) [2021-11-13 17:31:35,057 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION (25 of 105 remaining) [2021-11-13 17:31:35,057 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION (24 of 105 remaining) [2021-11-13 17:31:35,057 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12ASSERT_VIOLATIONMEMORY_FREE (23 of 105 remaining) [2021-11-13 17:31:35,058 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13ASSERT_VIOLATIONMEMORY_FREE (22 of 105 remaining) [2021-11-13 17:31:35,058 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14ASSERT_VIOLATIONMEMORY_FREE (21 of 105 remaining) [2021-11-13 17:31:35,058 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION (20 of 105 remaining) [2021-11-13 17:31:35,058 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION (19 of 105 remaining) [2021-11-13 17:31:35,058 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17ASSERT_VIOLATIONMEMORY_FREE (18 of 105 remaining) [2021-11-13 17:31:35,059 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18ASSERT_VIOLATIONMEMORY_FREE (17 of 105 remaining) [2021-11-13 17:31:35,059 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19ASSERT_VIOLATIONMEMORY_FREE (16 of 105 remaining) [2021-11-13 17:31:35,059 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20ENSURES_VIOLATIONMEMORY_LEAK (15 of 105 remaining) [2021-11-13 17:31:35,059 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr0REQUIRES_VIOLATION (14 of 105 remaining) [2021-11-13 17:31:35,059 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr1REQUIRES_VIOLATION (13 of 105 remaining) [2021-11-13 17:31:35,060 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr2REQUIRES_VIOLATION (12 of 105 remaining) [2021-11-13 17:31:35,060 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr3REQUIRES_VIOLATION (11 of 105 remaining) [2021-11-13 17:31:35,060 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr4REQUIRES_VIOLATION (10 of 105 remaining) [2021-11-13 17:31:35,060 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr5REQUIRES_VIOLATION (9 of 105 remaining) [2021-11-13 17:31:35,060 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr6REQUIRES_VIOLATION (8 of 105 remaining) [2021-11-13 17:31:35,060 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr7REQUIRES_VIOLATION (7 of 105 remaining) [2021-11-13 17:31:35,061 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr8REQUIRES_VIOLATION (6 of 105 remaining) [2021-11-13 17:31:35,061 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr9REQUIRES_VIOLATION (5 of 105 remaining) [2021-11-13 17:31:35,061 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr10REQUIRES_VIOLATION (4 of 105 remaining) [2021-11-13 17:31:35,061 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr11REQUIRES_VIOLATION (3 of 105 remaining) [2021-11-13 17:31:35,061 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE (2 of 105 remaining) [2021-11-13 17:31:35,062 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE (1 of 105 remaining) [2021-11-13 17:31:35,062 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE (0 of 105 remaining) [2021-11-13 17:31:35,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-13 17:31:35,069 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:31:35,073 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-13 17:31:35,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 05:31:35 BoogieIcfgContainer [2021-11-13 17:31:35,108 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-13 17:31:35,108 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-13 17:31:35,108 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-13 17:31:35,109 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-13 17:31:35,109 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:31:17" (3/4) ... [2021-11-13 17:31:35,111 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-13 17:31:35,155 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a61d6c3-4be3-473c-bb99-276f902a0a6c/bin/uautomizer-YU5uOKAj3y/witness.graphml [2021-11-13 17:31:35,155 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-13 17:31:35,156 INFO L158 Benchmark]: Toolchain (without parser) took 19372.51ms. Allocated memory was 107.0MB in the beginning and 188.7MB in the end (delta: 81.8MB). Free memory was 63.2MB in the beginning and 117.7MB in the end (delta: -54.5MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2021-11-13 17:31:35,156 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 107.0MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 17:31:35,157 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.74ms. Allocated memory is still 107.0MB. Free memory was 63.0MB in the beginning and 72.2MB in the end (delta: -9.2MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2021-11-13 17:31:35,157 INFO L158 Benchmark]: Boogie Preprocessor took 89.44ms. Allocated memory is still 107.0MB. Free memory was 72.2MB in the beginning and 68.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-13 17:31:35,158 INFO L158 Benchmark]: RCFGBuilder took 1200.27ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 68.4MB in the beginning and 95.7MB in the end (delta: -27.3MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. [2021-11-13 17:31:35,158 INFO L158 Benchmark]: TraceAbstraction took 17449.50ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 95.0MB in the beginning and 120.9MB in the end (delta: -25.9MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2021-11-13 17:31:35,159 INFO L158 Benchmark]: Witness Printer took 47.16ms. Allocated memory is still 188.7MB. Free memory was 120.9MB in the beginning and 117.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-13 17:31:35,161 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.35ms. Allocated memory is still 107.0MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 575.74ms. Allocated memory is still 107.0MB. Free memory was 63.0MB in the beginning and 72.2MB in the end (delta: -9.2MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.44ms. Allocated memory is still 107.0MB. Free memory was 72.2MB in the beginning and 68.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1200.27ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 68.4MB in the beginning and 95.7MB in the end (delta: -27.3MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. * TraceAbstraction took 17449.50ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 95.0MB in the beginning and 120.9MB in the end (delta: -25.9MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. * Witness Printer took 47.16ms. Allocated memory is still 188.7MB. Free memory was 120.9MB in the beginning and 117.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 565]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L638] struct list *data = ((void *)0); VAL [data={0:0}] [L639] COND TRUE __VERIFIER_nondet_int() [L640] struct node *node = malloc(sizeof *node); [L641] COND FALSE !(!node) VAL [data={0:0}, node={-1:0}] [L643] node->next = node VAL [data={0:0}, node={-1:0}] [L644] node->value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-2, data={0:0}, node={-1:0}] [L645] struct list *item = malloc(sizeof *item); [L646] COND FALSE !(!item) VAL [data={0:0}, item={-3:0}, node={-1:0}] [L648] item->slist = node VAL [data={0:0}, item={-3:0}, node={-1:0}] [L649] item->next = data VAL [data={0:0}, item={-3:0}, node={-1:0}] [L650] data = item VAL [data={-3:0}, item={-3:0}, node={-1:0}] [L639] COND FALSE !(__VERIFIER_nondet_int()) [L652] COND FALSE !(!data) VAL [data={-3:0}, item={-3:0}, node={-1:0}] [L654] CALL inspect_before(data) VAL [shape={-3:0}] [L615] COND FALSE !(!(shape)) VAL [shape={-3:0}, shape={-3:0}] [L616] shape->next VAL [shape={-3:0}, shape={-3:0}, shape->next={0:0}] [L616] COND FALSE !(shape->next) [L622] COND FALSE !(!(shape)) VAL [shape={-3:0}, shape={-3:0}] [L623] EXPR shape->next VAL [shape={-3:0}, shape={-3:0}, shape->next={0:0}] [L623] COND FALSE !(!(shape->next == ((void *)0))) [L624] EXPR shape->slist VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}] [L624] COND FALSE !(!(shape->slist)) [L625] EXPR shape->slist VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}] [L625] EXPR shape->slist->next VAL [shape={-3:0}, shape={-3:0}, shape->slist={-1:0}, shape->slist->next={-1:0}] [L625] COND TRUE !(shape->slist->next == ((void *)0)) [L625] CALL fail() [L565] reach_error() - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 630]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 630]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 661]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 661]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 636]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 288 locations, 105 error locations. Started 1 CEGAR loops. OverallTime: 17.4s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5240 SdHoareTripleChecker+Valid, 12572.24ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5208 mSDsluCounter, 8820 SdHoareTripleChecker+Invalid, 10323.03ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5333 mSDsCounter, 644 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16207 IncrementalHoareTripleChecker+Invalid, 16851 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 644 mSolverCounterUnsat, 3487 mSDtfsCounter, 16207 mSolverCounterSat, 183.53ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=288occurred in iteration=10, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 1048 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 486 NumberOfCodeBlocks, 486 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 2992 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 24/24 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-11-13 17:31:35,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a61d6c3-4be3-473c-bb99-276f902a0a6c/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)