./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_array_eq_ignore_case_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_795683a1-385d-4134-a094-222c8c74b85e/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_795683a1-385d-4134-a094-222c8c74b85e/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_795683a1-385d-4134-a094-222c8c74b85e/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_795683a1-385d-4134-a094-222c8c74b85e/bin/uautomizer-GMMbpWq8iD/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_array_eq_ignore_case_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_795683a1-385d-4134-a094-222c8c74b85e/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_795683a1-385d-4134-a094-222c8c74b85e/bin/uautomizer-GMMbpWq8iD --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8de283a79f01a407383b7daa040c59e7c5c73f52f0f9c705f7021a208716cd24 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 22:59:01,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 22:59:01,492 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 22:59:01,560 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 22:59:01,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 22:59:01,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 22:59:01,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 22:59:01,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 22:59:01,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 22:59:01,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 22:59:01,577 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 22:59:01,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 22:59:01,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 22:59:01,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 22:59:01,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 22:59:01,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 22:59:01,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 22:59:01,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 22:59:01,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 22:59:01,622 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 22:59:01,625 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 22:59:01,629 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 22:59:01,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 22:59:01,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 22:59:01,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 22:59:01,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 22:59:01,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 22:59:01,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 22:59:01,648 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 22:59:01,650 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 22:59:01,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 22:59:01,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 22:59:01,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 22:59:01,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 22:59:01,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 22:59:01,657 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 22:59:01,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 22:59:01,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 22:59:01,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 22:59:01,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 22:59:01,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 22:59:01,663 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_795683a1-385d-4134-a094-222c8c74b85e/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-10-28 22:59:01,711 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 22:59:01,712 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 22:59:01,713 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 22:59:01,713 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 22:59:01,715 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 22:59:01,715 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 22:59:01,716 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 22:59:01,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 22:59:01,716 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 22:59:01,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 22:59:01,718 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 22:59:01,719 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 22:59:01,719 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 22:59:01,720 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 22:59:01,720 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 22:59:01,720 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 22:59:01,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 22:59:01,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 22:59:01,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 22:59:01,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 22:59:01,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 22:59:01,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 22:59:01,722 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 22:59:01,723 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 22:59:01,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 22:59:01,723 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 22:59:01,723 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 22:59:01,724 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 22:59:01,724 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 22:59:01,726 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_795683a1-385d-4134-a094-222c8c74b85e/bin/uautomizer-GMMbpWq8iD/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_795683a1-385d-4134-a094-222c8c74b85e/bin/uautomizer-GMMbpWq8iD 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 ! call(reach_error())) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8de283a79f01a407383b7daa040c59e7c5c73f52f0f9c705f7021a208716cd24 [2021-10-28 22:59:02,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 22:59:02,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 22:59:02,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 22:59:02,064 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 22:59:02,065 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 22:59:02,066 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_795683a1-385d-4134-a094-222c8c74b85e/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/aws-c-common/aws_array_eq_ignore_case_harness.i [2021-10-28 22:59:02,165 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_795683a1-385d-4134-a094-222c8c74b85e/bin/uautomizer-GMMbpWq8iD/data/c0843f85a/bb44ac9657be4d64b7c822a861257879/FLAG3d4fc635b [2021-10-28 22:59:03,160 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 22:59:03,161 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_795683a1-385d-4134-a094-222c8c74b85e/sv-benchmarks/c/aws-c-common/aws_array_eq_ignore_case_harness.i [2021-10-28 22:59:03,236 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_795683a1-385d-4134-a094-222c8c74b85e/bin/uautomizer-GMMbpWq8iD/data/c0843f85a/bb44ac9657be4d64b7c822a861257879/FLAG3d4fc635b [2021-10-28 22:59:03,511 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_795683a1-385d-4134-a094-222c8c74b85e/bin/uautomizer-GMMbpWq8iD/data/c0843f85a/bb44ac9657be4d64b7c822a861257879 [2021-10-28 22:59:03,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 22:59:03,514 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 22:59:03,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 22:59:03,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 22:59:03,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 22:59:03,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 10:59:03" (1/1) ... [2021-10-28 22:59:03,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a0f2c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:03, skipping insertion in model container [2021-10-28 22:59:03,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 10:59:03" (1/1) ... [2021-10-28 22:59:03,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 22:59:03,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 22:59:03,916 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_795683a1-385d-4134-a094-222c8c74b85e/sv-benchmarks/c/aws-c-common/aws_array_eq_ignore_case_harness.i[4498,4511] [2021-10-28 22:59:03,923 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_795683a1-385d-4134-a094-222c8c74b85e/sv-benchmarks/c/aws-c-common/aws_array_eq_ignore_case_harness.i[4558,4571] [2021-10-28 22:59:03,947 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-10-28 22:59:03,953 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-10-28 22:59:05,063 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 22:59:05,083 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 22:59:05,084 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 22:59:05,086 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 22:59:05,088 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 22:59:05,114 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 22:59:05,116 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 22:59:05,121 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 22:59:05,122 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 22:59:05,644 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-10-28 22:59:05,646 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-10-28 22:59:05,648 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-10-28 22:59:05,650 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-10-28 22:59:05,658 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-10-28 22:59:05,660 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-10-28 22:59:05,661 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-10-28 22:59:05,663 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-10-28 22:59:05,666 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-10-28 22:59:05,668 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-10-28 22:59:05,882 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-10-28 22:59:06,065 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 22:59:06,066 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 22:59:06,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 22:59:06,207 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 22:59:06,224 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_795683a1-385d-4134-a094-222c8c74b85e/sv-benchmarks/c/aws-c-common/aws_array_eq_ignore_case_harness.i[4498,4511] [2021-10-28 22:59:06,224 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_795683a1-385d-4134-a094-222c8c74b85e/sv-benchmarks/c/aws-c-common/aws_array_eq_ignore_case_harness.i[4558,4571] [2021-10-28 22:59:06,226 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-10-28 22:59:06,228 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-10-28 22:59:06,281 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 22:59:06,282 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 22:59:06,283 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 22:59:06,283 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 22:59:06,287 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 22:59:06,304 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 22:59:06,311 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 22:59:06,313 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 22:59:06,314 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 22:59:06,377 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-10-28 22:59:06,381 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-10-28 22:59:06,382 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-10-28 22:59:06,383 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-10-28 22:59:06,384 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-10-28 22:59:06,385 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-10-28 22:59:06,386 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-10-28 22:59:06,386 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-10-28 22:59:06,387 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-10-28 22:59:06,388 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-10-28 22:59:06,426 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-10-28 22:59:06,551 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 22:59:06,551 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 22:59:06,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 22:59:06,808 INFO L208 MainTranslator]: Completed translation [2021-10-28 22:59:06,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:06 WrapperNode [2021-10-28 22:59:06,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 22:59:06,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 22:59:06,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 22:59:06,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 22:59:06,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:06" (1/1) ... [2021-10-28 22:59:06,987 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:06" (1/1) ... [2021-10-28 22:59:07,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 22:59:07,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 22:59:07,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 22:59:07,116 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 22:59:07,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:06" (1/1) ... [2021-10-28 22:59:07,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:06" (1/1) ... [2021-10-28 22:59:07,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:06" (1/1) ... [2021-10-28 22:59:07,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:06" (1/1) ... [2021-10-28 22:59:07,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:06" (1/1) ... [2021-10-28 22:59:07,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:06" (1/1) ... [2021-10-28 22:59:07,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:06" (1/1) ... [2021-10-28 22:59:07,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 22:59:07,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 22:59:07,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 22:59:07,261 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 22:59:07,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:06" (1/1) ... [2021-10-28 22:59:07,270 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 22:59:07,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_795683a1-385d-4134-a094-222c8c74b85e/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 22:59:07,296 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_795683a1-385d-4134-a094-222c8c74b85e/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 22:59:07,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_795683a1-385d-4134-a094-222c8c74b85e/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 22:59:07,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 22:59:07,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-28 22:59:07,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-28 22:59:07,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 22:59:07,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 22:59:07,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 22:59:07,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-10-28 22:59:07,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-28 22:59:07,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 22:59:18,079 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 22:59:18,079 INFO L299 CfgBuilder]: Removed 61 assume(true) statements. [2021-10-28 22:59:18,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:59:18 BoogieIcfgContainer [2021-10-28 22:59:18,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 22:59:18,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 22:59:18,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 22:59:18,087 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 22:59:18,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 10:59:03" (1/3) ... [2021-10-28 22:59:18,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64d2e1aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 10:59:18, skipping insertion in model container [2021-10-28 22:59:18,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:59:06" (2/3) ... [2021-10-28 22:59:18,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64d2e1aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 10:59:18, skipping insertion in model container [2021-10-28 22:59:18,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:59:18" (3/3) ... [2021-10-28 22:59:18,090 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_array_eq_ignore_case_harness.i [2021-10-28 22:59:18,095 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 22:59:18,096 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-10-28 22:59:18,142 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 22:59:18,149 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-28 22:59:18,149 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-10-28 22:59:18,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 66 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:18,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-28 22:59:18,190 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:18,191 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:59:18,191 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:59:18,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:18,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1732099540, now seen corresponding path program 1 times [2021-10-28 22:59:18,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:18,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182721337] [2021-10-28 22:59:18,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:18,212 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:18,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:59:18,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:18,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182721337] [2021-10-28 22:59:18,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182721337] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:18,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:18,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 22:59:18,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066115759] [2021-10-28 22:59:18,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-28 22:59:18,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:19,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-28 22:59:19,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-28 22:59:19,012 INFO L87 Difference]: Start difference. First operand has 67 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 66 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:19,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:19,033 INFO L93 Difference]: Finished difference Result 131 states and 182 transitions. [2021-10-28 22:59:19,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-28 22:59:19,035 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-28 22:59:19,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:19,043 INFO L225 Difference]: With dead ends: 131 [2021-10-28 22:59:19,044 INFO L226 Difference]: Without dead ends: 61 [2021-10-28 22:59:19,047 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-28 22:59:19,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-10-28 22:59:19,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-10-28 22:59:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 60 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:19,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2021-10-28 22:59:19,085 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 27 [2021-10-28 22:59:19,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:19,086 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2021-10-28 22:59:19,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:19,087 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2021-10-28 22:59:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-28 22:59:19,088 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:19,089 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:59:19,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 22:59:19,094 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:59:19,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:19,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1816466470, now seen corresponding path program 1 times [2021-10-28 22:59:19,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:19,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51998099] [2021-10-28 22:59:19,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:19,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:19,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:59:19,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:19,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51998099] [2021-10-28 22:59:19,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51998099] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:19,558 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:19,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:59:19,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268342024] [2021-10-28 22:59:19,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:59:19,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:19,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:59:19,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:59:19,561 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:19,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:19,817 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2021-10-28 22:59:19,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:59:19,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-28 22:59:19,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:19,823 INFO L225 Difference]: With dead ends: 132 [2021-10-28 22:59:19,825 INFO L226 Difference]: Without dead ends: 116 [2021-10-28 22:59:19,826 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:59:19,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-10-28 22:59:19,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 80. [2021-10-28 22:59:19,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 79 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2021-10-28 22:59:19,855 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 27 [2021-10-28 22:59:19,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:19,857 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2021-10-28 22:59:19,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:19,857 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2021-10-28 22:59:19,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-28 22:59:19,860 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:19,860 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:59:19,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 22:59:19,861 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:59:19,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:19,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1086636907, now seen corresponding path program 1 times [2021-10-28 22:59:19,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:19,868 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924135778] [2021-10-28 22:59:19,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:19,868 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:20,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:59:20,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:20,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924135778] [2021-10-28 22:59:20,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924135778] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:20,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:20,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:59:20,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353075326] [2021-10-28 22:59:20,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:59:20,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:20,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:59:20,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:59:20,668 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:20,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:20,877 INFO L93 Difference]: Finished difference Result 104 states and 122 transitions. [2021-10-28 22:59:20,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:59:20,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-28 22:59:20,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:20,880 INFO L225 Difference]: With dead ends: 104 [2021-10-28 22:59:20,880 INFO L226 Difference]: Without dead ends: 102 [2021-10-28 22:59:20,880 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:59:20,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-10-28 22:59:20,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 87. [2021-10-28 22:59:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 86 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:20,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2021-10-28 22:59:20,898 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 29 [2021-10-28 22:59:20,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:20,899 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2021-10-28 22:59:20,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:20,899 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2021-10-28 22:59:20,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-28 22:59:20,903 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:20,903 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:59:20,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 22:59:20,903 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:59:20,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:20,904 INFO L85 PathProgramCache]: Analyzing trace with hash -571433758, now seen corresponding path program 1 times [2021-10-28 22:59:20,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:20,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141517829] [2021-10-28 22:59:20,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:20,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:21,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:59:21,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:21,394 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141517829] [2021-10-28 22:59:21,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141517829] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:21,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:21,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 22:59:21,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563402957] [2021-10-28 22:59:21,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 22:59:21,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:21,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 22:59:21,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 22:59:21,397 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:21,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:21,771 INFO L93 Difference]: Finished difference Result 250 states and 292 transitions. [2021-10-28 22:59:21,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 22:59:21,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-10-28 22:59:21,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:21,776 INFO L225 Difference]: With dead ends: 250 [2021-10-28 22:59:21,776 INFO L226 Difference]: Without dead ends: 241 [2021-10-28 22:59:21,776 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-10-28 22:59:21,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-10-28 22:59:21,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 154. [2021-10-28 22:59:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 151 states have (on average 1.218543046357616) internal successors, (184), 153 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 184 transitions. [2021-10-28 22:59:21,802 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 184 transitions. Word has length 31 [2021-10-28 22:59:21,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:21,803 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 184 transitions. [2021-10-28 22:59:21,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 184 transitions. [2021-10-28 22:59:21,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-28 22:59:21,807 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:21,807 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:59:21,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 22:59:21,808 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:59:21,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:21,809 INFO L85 PathProgramCache]: Analyzing trace with hash -518323106, now seen corresponding path program 1 times [2021-10-28 22:59:21,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:21,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654320526] [2021-10-28 22:59:21,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:21,814 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:22,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-10-28 22:59:22,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:22,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654320526] [2021-10-28 22:59:22,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654320526] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:22,138 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:22,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:59:22,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618497111] [2021-10-28 22:59:22,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:59:22,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:22,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:59:22,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:59:22,139 INFO L87 Difference]: Start difference. First operand 154 states and 184 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:22,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:22,295 INFO L93 Difference]: Finished difference Result 172 states and 203 transitions. [2021-10-28 22:59:22,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:59:22,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-10-28 22:59:22,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:22,297 INFO L225 Difference]: With dead ends: 172 [2021-10-28 22:59:22,297 INFO L226 Difference]: Without dead ends: 167 [2021-10-28 22:59:22,298 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:59:22,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-10-28 22:59:22,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 156. [2021-10-28 22:59:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 153 states have (on average 1.2156862745098038) internal successors, (186), 155 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:22,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 186 transitions. [2021-10-28 22:59:22,316 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 186 transitions. Word has length 32 [2021-10-28 22:59:22,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:22,317 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 186 transitions. [2021-10-28 22:59:22,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:22,318 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 186 transitions. [2021-10-28 22:59:22,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-28 22:59:22,322 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:22,323 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:59:22,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 22:59:22,323 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:59:22,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:22,326 INFO L85 PathProgramCache]: Analyzing trace with hash 618600592, now seen corresponding path program 1 times [2021-10-28 22:59:22,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:22,326 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451043497] [2021-10-28 22:59:22,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:22,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:22,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:59:22,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:22,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451043497] [2021-10-28 22:59:22,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451043497] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:22,859 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:22,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 22:59:22,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246819282] [2021-10-28 22:59:22,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 22:59:22,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:22,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 22:59:22,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 22:59:22,861 INFO L87 Difference]: Start difference. First operand 156 states and 186 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:23,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:23,598 INFO L93 Difference]: Finished difference Result 240 states and 282 transitions. [2021-10-28 22:59:23,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 22:59:23,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-10-28 22:59:23,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:23,601 INFO L225 Difference]: With dead ends: 240 [2021-10-28 22:59:23,601 INFO L226 Difference]: Without dead ends: 202 [2021-10-28 22:59:23,602 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-10-28 22:59:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-28 22:59:23,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 188. [2021-10-28 22:59:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 185 states have (on average 1.2108108108108109) internal successors, (224), 187 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 224 transitions. [2021-10-28 22:59:23,629 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 224 transitions. Word has length 33 [2021-10-28 22:59:23,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:23,630 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 224 transitions. [2021-10-28 22:59:23,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 224 transitions. [2021-10-28 22:59:23,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-28 22:59:23,634 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:23,635 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:59:23,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 22:59:23,635 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:59:23,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:23,636 INFO L85 PathProgramCache]: Analyzing trace with hash -358402595, now seen corresponding path program 1 times [2021-10-28 22:59:23,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:23,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030947274] [2021-10-28 22:59:23,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:23,639 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:24,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:59:24,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:24,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030947274] [2021-10-28 22:59:24,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030947274] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:24,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:24,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:59:24,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29337581] [2021-10-28 22:59:24,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:59:24,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:24,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:59:24,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:59:24,149 INFO L87 Difference]: Start difference. First operand 188 states and 224 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:24,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:24,218 INFO L93 Difference]: Finished difference Result 239 states and 285 transitions. [2021-10-28 22:59:24,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:59:24,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-10-28 22:59:24,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:24,221 INFO L225 Difference]: With dead ends: 239 [2021-10-28 22:59:24,221 INFO L226 Difference]: Without dead ends: 213 [2021-10-28 22:59:24,222 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:59:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-10-28 22:59:24,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2021-10-28 22:59:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 193 states have (on average 1.1917098445595855) internal successors, (230), 195 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 230 transitions. [2021-10-28 22:59:24,236 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 230 transitions. Word has length 33 [2021-10-28 22:59:24,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:24,236 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 230 transitions. [2021-10-28 22:59:24,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:24,237 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 230 transitions. [2021-10-28 22:59:24,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-28 22:59:24,238 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:24,238 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:59:24,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 22:59:24,239 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:59:24,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:24,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1248189667, now seen corresponding path program 1 times [2021-10-28 22:59:24,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:24,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065273519] [2021-10-28 22:59:24,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:24,241 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:24,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:59:24,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:24,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065273519] [2021-10-28 22:59:24,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065273519] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:24,889 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:24,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 22:59:24,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282737063] [2021-10-28 22:59:24,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 22:59:24,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:24,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 22:59:24,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-28 22:59:24,891 INFO L87 Difference]: Start difference. First operand 196 states and 230 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:26,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:26,469 INFO L93 Difference]: Finished difference Result 308 states and 350 transitions. [2021-10-28 22:59:26,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-28 22:59:26,470 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-10-28 22:59:26,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:26,473 INFO L225 Difference]: With dead ends: 308 [2021-10-28 22:59:26,473 INFO L226 Difference]: Without dead ends: 294 [2021-10-28 22:59:26,474 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2021-10-28 22:59:26,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-10-28 22:59:26,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 220. [2021-10-28 22:59:26,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 217 states have (on average 1.1889400921658986) internal successors, (258), 219 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:26,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 258 transitions. [2021-10-28 22:59:26,492 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 258 transitions. Word has length 34 [2021-10-28 22:59:26,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:26,493 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 258 transitions. [2021-10-28 22:59:26,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:26,493 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 258 transitions. [2021-10-28 22:59:26,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-28 22:59:26,495 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:26,496 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:59:26,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 22:59:26,496 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:59:26,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:26,497 INFO L85 PathProgramCache]: Analyzing trace with hash 513264780, now seen corresponding path program 1 times [2021-10-28 22:59:26,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:26,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198822577] [2021-10-28 22:59:26,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:26,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:59:27,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:27,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198822577] [2021-10-28 22:59:27,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198822577] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:27,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:27,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 22:59:27,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101806339] [2021-10-28 22:59:27,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 22:59:27,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:27,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 22:59:27,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:59:27,115 INFO L87 Difference]: Start difference. First operand 220 states and 258 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:27,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:27,358 INFO L93 Difference]: Finished difference Result 252 states and 295 transitions. [2021-10-28 22:59:27,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:59:27,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-10-28 22:59:27,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:27,361 INFO L225 Difference]: With dead ends: 252 [2021-10-28 22:59:27,362 INFO L226 Difference]: Without dead ends: 222 [2021-10-28 22:59:27,362 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-28 22:59:27,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-10-28 22:59:27,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 190. [2021-10-28 22:59:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 188 states have (on average 1.175531914893617) internal successors, (221), 189 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 221 transitions. [2021-10-28 22:59:27,380 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 221 transitions. Word has length 35 [2021-10-28 22:59:27,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:27,381 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 221 transitions. [2021-10-28 22:59:27,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:27,381 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 221 transitions. [2021-10-28 22:59:27,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 22:59:27,382 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:27,383 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:59:27,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 22:59:27,383 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:59:27,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:27,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1203766261, now seen corresponding path program 1 times [2021-10-28 22:59:27,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:27,384 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447336194] [2021-10-28 22:59:27,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:27,385 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:59:27,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:27,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447336194] [2021-10-28 22:59:27,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447336194] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:27,955 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:27,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 22:59:27,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304013276] [2021-10-28 22:59:27,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 22:59:27,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:27,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 22:59:27,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-28 22:59:27,957 INFO L87 Difference]: Start difference. First operand 190 states and 221 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:28,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:28,753 INFO L93 Difference]: Finished difference Result 228 states and 262 transitions. [2021-10-28 22:59:28,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 22:59:28,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-28 22:59:28,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:28,755 INFO L225 Difference]: With dead ends: 228 [2021-10-28 22:59:28,756 INFO L226 Difference]: Without dead ends: 198 [2021-10-28 22:59:28,756 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2021-10-28 22:59:28,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-28 22:59:28,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 190. [2021-10-28 22:59:28,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 188 states have (on average 1.1702127659574468) internal successors, (220), 189 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:28,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 220 transitions. [2021-10-28 22:59:28,771 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 220 transitions. Word has length 36 [2021-10-28 22:59:28,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:28,772 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 220 transitions. [2021-10-28 22:59:28,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:28,772 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 220 transitions. [2021-10-28 22:59:28,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-28 22:59:28,774 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:28,774 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:59:28,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 22:59:28,775 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:59:28,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:28,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1546392854, now seen corresponding path program 1 times [2021-10-28 22:59:28,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:28,777 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648698132] [2021-10-28 22:59:28,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:28,777 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:29,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:59:29,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:29,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648698132] [2021-10-28 22:59:29,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648698132] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:29,334 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:29,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 22:59:29,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924169612] [2021-10-28 22:59:29,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 22:59:29,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:29,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 22:59:29,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:59:29,336 INFO L87 Difference]: Start difference. First operand 190 states and 220 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:29,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:29,543 INFO L93 Difference]: Finished difference Result 281 states and 326 transitions. [2021-10-28 22:59:29,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 22:59:29,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-28 22:59:29,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:29,546 INFO L225 Difference]: With dead ends: 281 [2021-10-28 22:59:29,546 INFO L226 Difference]: Without dead ends: 258 [2021-10-28 22:59:29,547 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-28 22:59:29,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-10-28 22:59:29,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 194. [2021-10-28 22:59:29,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 192 states have (on average 1.1770833333333333) internal successors, (226), 193 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 226 transitions. [2021-10-28 22:59:29,592 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 226 transitions. Word has length 37 [2021-10-28 22:59:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:29,593 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 226 transitions. [2021-10-28 22:59:29,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 226 transitions. [2021-10-28 22:59:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-28 22:59:29,594 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:29,595 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:59:29,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 22:59:29,595 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:59:29,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:29,596 INFO L85 PathProgramCache]: Analyzing trace with hash -865834336, now seen corresponding path program 1 times [2021-10-28 22:59:29,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:29,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652538576] [2021-10-28 22:59:29,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:29,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:59:30,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:30,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652538576] [2021-10-28 22:59:30,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652538576] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:30,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:30,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 22:59:30,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850098919] [2021-10-28 22:59:30,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 22:59:30,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:30,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 22:59:30,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-28 22:59:30,423 INFO L87 Difference]: Start difference. First operand 194 states and 226 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:31,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:31,740 INFO L93 Difference]: Finished difference Result 261 states and 292 transitions. [2021-10-28 22:59:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-28 22:59:31,741 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-28 22:59:31,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:31,743 INFO L225 Difference]: With dead ends: 261 [2021-10-28 22:59:31,743 INFO L226 Difference]: Without dead ends: 231 [2021-10-28 22:59:31,744 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2021-10-28 22:59:31,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-10-28 22:59:31,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 194. [2021-10-28 22:59:31,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 192 states have (on average 1.171875) internal successors, (225), 193 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:31,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 225 transitions. [2021-10-28 22:59:31,757 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 225 transitions. Word has length 37 [2021-10-28 22:59:31,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:31,758 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 225 transitions. [2021-10-28 22:59:31,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:31,759 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 225 transitions. [2021-10-28 22:59:31,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 22:59:31,760 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:31,760 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:59:31,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 22:59:31,761 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:59:31,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:31,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1604639621, now seen corresponding path program 1 times [2021-10-28 22:59:31,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:31,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825297927] [2021-10-28 22:59:31,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:31,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:32,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:59:32,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:32,425 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825297927] [2021-10-28 22:59:32,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825297927] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:32,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:32,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 22:59:32,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766836605] [2021-10-28 22:59:32,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 22:59:32,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:32,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 22:59:32,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-28 22:59:32,428 INFO L87 Difference]: Start difference. First operand 194 states and 225 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:33,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:59:33,492 INFO L93 Difference]: Finished difference Result 276 states and 320 transitions. [2021-10-28 22:59:33,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 22:59:33,494 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-28 22:59:33,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:59:33,496 INFO L225 Difference]: With dead ends: 276 [2021-10-28 22:59:33,496 INFO L226 Difference]: Without dead ends: 230 [2021-10-28 22:59:33,496 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-10-28 22:59:33,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-10-28 22:59:33,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 194. [2021-10-28 22:59:33,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 192 states have (on average 1.1614583333333333) internal successors, (223), 193 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:33,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 223 transitions. [2021-10-28 22:59:33,511 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 223 transitions. Word has length 39 [2021-10-28 22:59:33,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:59:33,512 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 223 transitions. [2021-10-28 22:59:33,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:59:33,512 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 223 transitions. [2021-10-28 22:59:33,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-28 22:59:33,513 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:59:33,513 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:59:33,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 22:59:33,514 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:59:33,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:59:33,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1876182655, now seen corresponding path program 1 times [2021-10-28 22:59:33,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:59:33,515 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879575773] [2021-10-28 22:59:33,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:59:33,516 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:59:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:59:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:59:53,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:59:53,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879575773] [2021-10-28 22:59:53,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879575773] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:59:53,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:59:53,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-10-28 22:59:53,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640021883] [2021-10-28 22:59:53,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-28 22:59:53,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:59:53,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-28 22:59:53,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-10-28 22:59:53,800 INFO L87 Difference]: Start difference. First operand 194 states and 223 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:13,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:13,589 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2021-10-28 23:00:13,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-28 23:00:13,590 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-28 23:00:13,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:13,592 INFO L225 Difference]: With dead ends: 238 [2021-10-28 23:00:13,592 INFO L226 Difference]: Without dead ends: 236 [2021-10-28 23:00:13,594 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=289, Invalid=833, Unknown=0, NotChecked=0, Total=1122 [2021-10-28 23:00:13,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-10-28 23:00:13,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 196. [2021-10-28 23:00:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 194 states have (on average 1.1597938144329898) internal successors, (225), 195 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 225 transitions. [2021-10-28 23:00:13,610 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 225 transitions. Word has length 40 [2021-10-28 23:00:13,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:13,611 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 225 transitions. [2021-10-28 23:00:13,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:13,611 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 225 transitions. [2021-10-28 23:00:13,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-28 23:00:13,612 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:13,613 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:00:13,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 23:00:13,613 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:00:13,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:13,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1569116892, now seen corresponding path program 1 times [2021-10-28 23:00:13,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:13,614 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144925425] [2021-10-28 23:00:13,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:13,615 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:00:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00: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-10-28 23:00:20,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:00:20,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144925425] [2021-10-28 23:00:20,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144925425] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:00:20,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:00:20,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 23:00:20,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854373487] [2021-10-28 23:00:20,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 23:00:20,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:00:20,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 23:00:20,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-10-28 23:00:20,520 INFO L87 Difference]: Start difference. First operand 196 states and 225 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:35,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:35,347 INFO L93 Difference]: Finished difference Result 254 states and 289 transitions. [2021-10-28 23:00:35,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-28 23:00:35,352 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-10-28 23:00:35,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:35,354 INFO L225 Difference]: With dead ends: 254 [2021-10-28 23:00:35,354 INFO L226 Difference]: Without dead ends: 208 [2021-10-28 23:00:35,360 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2021-10-28 23:00:35,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-10-28 23:00:35,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 196. [2021-10-28 23:00:35,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 194 states have (on average 1.1494845360824741) internal successors, (223), 195 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 223 transitions. [2021-10-28 23:00:35,385 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 223 transitions. Word has length 41 [2021-10-28 23:00:35,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:35,385 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 223 transitions. [2021-10-28 23:00:35,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:35,386 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 223 transitions. [2021-10-28 23:00:35,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-28 23:00:35,389 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:35,390 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:00:35,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 23:00:35,390 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:00:35,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:35,391 INFO L85 PathProgramCache]: Analyzing trace with hash 664052998, now seen corresponding path program 1 times [2021-10-28 23:00:35,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:35,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121413592] [2021-10-28 23:00:35,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:35,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:00:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:00:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:00:41,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:00:41,639 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121413592] [2021-10-28 23:00:41,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121413592] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:00:41,639 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:00:41,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 23:00:41,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192258039] [2021-10-28 23:00:41,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 23:00:41,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:00:41,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 23:00:41,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-10-28 23:00:41,642 INFO L87 Difference]: Start difference. First operand 196 states and 223 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:56,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:00:56,362 INFO L93 Difference]: Finished difference Result 204 states and 229 transitions. [2021-10-28 23:00:56,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 23:00:56,363 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-10-28 23:00:56,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:00:56,365 INFO L225 Difference]: With dead ends: 204 [2021-10-28 23:00:56,365 INFO L226 Difference]: Without dead ends: 130 [2021-10-28 23:00:56,366 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-10-28 23:00:56,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-10-28 23:00:56,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 94. [2021-10-28 23:00:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 92 states have (on average 1.0978260869565217) internal successors, (101), 93 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2021-10-28 23:00:56,376 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 42 [2021-10-28 23:00:56,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:00:56,377 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2021-10-28 23:00:56,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:00:56,377 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2021-10-28 23:00:56,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-28 23:00:56,377 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:00:56,378 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:00:56,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 23:00:56,378 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:00:56,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:00:56,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1320231428, now seen corresponding path program 1 times [2021-10-28 23:00:56,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:00:56,379 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195862780] [2021-10-28 23:00:56,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:00:56,379 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:01:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:01:29,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:01:29,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:01:29,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195862780] [2021-10-28 23:01:29,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195862780] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:01:29,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:01:29,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-28 23:01:29,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357024150] [2021-10-28 23:01:29,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-28 23:01:29,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:01:29,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-28 23:01:29,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-10-28 23:01:29,093 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:01:51,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:01:51,325 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2021-10-28 23:01:51,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-28 23:01:51,326 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-10-28 23:01:51,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:01:51,327 INFO L225 Difference]: With dead ends: 130 [2021-10-28 23:01:51,327 INFO L226 Difference]: Without dead ends: 92 [2021-10-28 23:01:51,328 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2021-10-28 23:01:51,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-10-28 23:01:51,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2021-10-28 23:01:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:01:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2021-10-28 23:01:51,335 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 44 [2021-10-28 23:01:51,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:01:51,336 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-10-28 23:01:51,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:01:51,336 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2021-10-28 23:01:51,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-28 23:01:51,337 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:01:51,337 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:01:51,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 23:01:51,338 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:01:51,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:01:51,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2088300975, now seen corresponding path program 1 times [2021-10-28 23:01:51,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:01:51,339 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58562052] [2021-10-28 23:01:51,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:01:51,340 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:01:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:01:51,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:01:51,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:01:51,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58562052] [2021-10-28 23:01:51,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58562052] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:01:51,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:01:51,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 23:01:51,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420600086] [2021-10-28 23:01:51,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 23:01:51,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:01:51,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 23:01:51,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 23:01:51,796 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:01:51,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:01:51,980 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2021-10-28 23:01:51,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 23:01:51,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-10-28 23:01:51,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:01:51,982 INFO L225 Difference]: With dead ends: 92 [2021-10-28 23:01:51,982 INFO L226 Difference]: Without dead ends: 56 [2021-10-28 23:01:51,982 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-28 23:01:51,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-10-28 23:01:51,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-10-28 23:01:51,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:01:51,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2021-10-28 23:01:51,989 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2021-10-28 23:01:51,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:01:51,990 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2021-10-28 23:01:51,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:01:51,991 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2021-10-28 23:01:51,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-28 23:01:51,991 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:01:51,991 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:01:51,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 23:01:51,992 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:01:51,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:01:51,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1768480620, now seen corresponding path program 1 times [2021-10-28 23:01:51,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:01:51,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979642783] [2021-10-28 23:01:51,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:01:51,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:01:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:01:58,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:01:58,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:01:58,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979642783] [2021-10-28 23:01:58,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979642783] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:01:58,995 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:01:58,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-28 23:01:58,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918224841] [2021-10-28 23:01:58,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-28 23:01:58,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:01:58,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-28 23:01:58,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-28 23:01:58,997 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:15,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:02:15,572 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2021-10-28 23:02:15,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 23:02:15,573 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-10-28 23:02:15,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:02:15,574 INFO L225 Difference]: With dead ends: 56 [2021-10-28 23:02:15,574 INFO L226 Difference]: Without dead ends: 0 [2021-10-28 23:02:15,575 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2021-10-28 23:02:15,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-28 23:02:15,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-28 23:02:15,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:15,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-28 23:02:15,576 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2021-10-28 23:02:15,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:02:15,576 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-28 23:02:15,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:02:15,576 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-28 23:02:15,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-28 23:02:15,579 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:02:15,580 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:02:15,581 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:02:15,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 23:02:15,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-28 23:02:15,589 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:02:15,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:02:15,871 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:02:15,875 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:02:16,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:02:16,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:02:16,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:02:16,083 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:02:16,085 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:02:16,120 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:02:16,122 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:02:16,125 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:02:23,322 WARN L207 SmtUtils]: Spent 5.89 s on a formula simplification. DAG size of input: 188 DAG size of output: 135 [2021-10-28 23:02:29,622 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:02:29,622 INFO L857 garLoopResultBuilder]: For program point L7129-2(lines 7129 7131) no Hoare annotation was computed. [2021-10-28 23:02:29,622 INFO L857 garLoopResultBuilder]: For program point L7129(lines 7129 7131) no Hoare annotation was computed. [2021-10-28 23:02:29,623 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-28 23:02:29,623 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-28 23:02:29,623 INFO L857 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:02:29,623 INFO L857 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:02:29,623 INFO L857 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:02:29,624 INFO L857 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:02:29,624 INFO L857 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:02:29,624 INFO L857 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:02:29,624 INFO L857 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:02:29,625 INFO L857 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:02:29,625 INFO L857 garLoopResultBuilder]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2021-10-28 23:02:29,625 INFO L857 garLoopResultBuilder]: For program point L210-9(lines 7686 7690) no Hoare annotation was computed. [2021-10-28 23:02:29,625 INFO L857 garLoopResultBuilder]: For program point L6900-2(lines 6900 6902) no Hoare annotation was computed. [2021-10-28 23:02:29,625 INFO L857 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-10-28 23:02:29,625 INFO L857 garLoopResultBuilder]: For program point L6900(lines 6900 6902) no Hoare annotation was computed. [2021-10-28 23:02:29,625 INFO L857 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-10-28 23:02:29,625 INFO L857 garLoopResultBuilder]: For program point L6900-6(lines 6900 6902) no Hoare annotation was computed. [2021-10-28 23:02:29,625 INFO L857 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-10-28 23:02:29,626 INFO L857 garLoopResultBuilder]: For program point L6900-4(lines 6900 6902) no Hoare annotation was computed. [2021-10-28 23:02:29,626 INFO L853 garLoopResultBuilder]: At program point L6900-3(lines 6899 6903) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_can_fail_malloc_#res.offset| 0))) (or (and (<= 0 |~#s_tolower_table~0.offset|) .cse0 (<= |~#s_tolower_table~0.offset| 0) (= |ULTIMATE.start_can_fail_malloc_#res.base| 0)) (and (<= (+ |ULTIMATE.start_can_fail_malloc_#res.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |~#s_tolower_table~0.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) .cse0 (= (select |#valid| |ULTIMATE.start_can_fail_malloc_#res.base|) 1) (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1)))) [2021-10-28 23:02:29,626 INFO L857 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-10-28 23:02:29,626 INFO L857 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-10-28 23:02:29,627 INFO L853 garLoopResultBuilder]: At program point L6900-7(lines 6899 6903) the Hoare annotation is: (let ((.cse0 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|)) (.cse1 (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1)) (.cse12 (= |ULTIMATE.start_can_fail_malloc_#res.base| 0)) (.cse2 (<= 0 |~#s_tolower_table~0.offset|)) (.cse3 (<= (+ |ULTIMATE.start_can_fail_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse4 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse5 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse6 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse13 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0)) (.cse7 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0)) (.cse8 (= |ULTIMATE.start_can_fail_malloc_#res.offset| 0)) (.cse9 (<= |~#s_tolower_table~0.offset| 0)) (.cse10 (= (select |#valid| |ULTIMATE.start_can_fail_malloc_#res.base|) 1)) (.cse11 (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse11) (and .cse13 .cse7 .cse8 .cse12) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11))) [2021-10-28 23:02:29,627 INFO L860 garLoopResultBuilder]: At program point L9006(line 9006) the Hoare annotation is: true [2021-10-28 23:02:29,627 INFO L857 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-10-28 23:02:29,628 INFO L857 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-10-28 23:02:29,628 INFO L853 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: (= |~#s_tolower_table~0.offset| 0) [2021-10-28 23:02:29,628 INFO L857 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-10-28 23:02:29,628 INFO L853 garLoopResultBuilder]: At program point L261-1(line 261) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_can_fail_malloc_#res.base| 0)) (.cse1 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0)) (.cse2 (= |ULTIMATE.start_can_fail_malloc_#res.offset| 0)) (.cse0 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0))) (or (and (<= 0 |~#s_tolower_table~0.offset|) .cse0 .cse1 .cse2 (<= |~#s_tolower_table~0.offset| 0) .cse3) (and (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|) (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1) (<= (+ |ULTIMATE.start_can_fail_malloc_#res.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (not .cse3) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |~#s_tolower_table~0.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) .cse1 .cse2 (not .cse0) (= (select |#valid| |ULTIMATE.start_can_fail_malloc_#res.base|) 1) (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1)))) [2021-10-28 23:02:29,628 INFO L853 garLoopResultBuilder]: At program point L261-2(line 261) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0))) (or (and (<= 0 |~#s_tolower_table~0.offset|) (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0) .cse0 (<= |~#s_tolower_table~0.offset| 0)) (and (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|) (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1) (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |~#s_tolower_table~0.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) .cse0 (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1)))) [2021-10-28 23:02:29,629 INFO L857 garLoopResultBuilder]: For program point L211-16(line 211) no Hoare annotation was computed. [2021-10-28 23:02:29,629 INFO L857 garLoopResultBuilder]: For program point L211-18(line 211) no Hoare annotation was computed. [2021-10-28 23:02:29,629 INFO L853 garLoopResultBuilder]: At program point L7702(lines 7675 7705) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_can_fail_malloc_#res.base| 0)) (.cse2 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0)) (.cse36 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.offset| 0)) (.cse43 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base| 0))) (let ((.cse1 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 0)) (.cse32 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0)) (.cse39 (or (and .cse36 .cse43) (<= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 0))) (.cse40 (not .cse2)) (.cse23 (not .cse6)) (.cse26 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse3 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0)) (.cse5 (= |ULTIMATE.start_aws_array_eq_ignore_case_#res| 0))) (let ((.cse14 (or (and .cse23 .cse26 .cse39 .cse40 .cse5) (and .cse23 .cse26 .cse2 .cse3 .cse5))) (.cse22 (not (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base| ULTIMATE.start_save_byte_from_array_~storage.base))) (.cse33 (not (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base ULTIMATE.start_save_byte_from_array_~storage.base))) (.cse37 (= (select |#valid| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base|) 1)) (.cse16 (= ULTIMATE.start_save_byte_from_array_~array.offset 0)) (.cse20 (<= (+ |ULTIMATE.start_can_fail_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse24 (let ((.cse45 (select |#memory_int| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.base|))) (= (select (select |#memory_int| ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base) (select .cse45 |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.offset|)) (select .cse45 8)))) (.cse27 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 1) |#StackHeapBarrier|)) (.cse28 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base ULTIMATE.start_save_byte_from_array_~array.base)) (.cse30 (not (= ULTIMATE.start_save_byte_from_array_~array.base ULTIMATE.start_save_byte_from_array_~storage.base))) (.cse41 (or (and .cse23 .cse26 .cse2 .cse3) (and .cse23 .cse26 .cse39 .cse40))) (.cse34 (= (select |#valid| |ULTIMATE.start_can_fail_malloc_#res.base|) 1)) (.cse38 (= ULTIMATE.start_save_byte_from_array_~storage.offset 0)) (.cse17 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|)) (.cse18 (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1)) (.cse19 (<= 0 |~#s_tolower_table~0.offset|)) (.cse21 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse25 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse29 (let ((.cse44 (select |#memory_int| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base|))) (= (select .cse44 8) (select (select |#memory_int| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) (select .cse44 |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.offset|))))) (.cse31 (<= |~#s_tolower_table~0.offset| 0)) (.cse35 (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1)) (.cse0 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.offset 0)) (.cse4 (= |ULTIMATE.start_can_fail_malloc_#res.offset| 0)) (.cse7 (or (not (= ULTIMATE.start_aws_array_eq_ignore_case_~len_b ULTIMATE.start_aws_array_eq_ignore_case_~len_a)) .cse32)) (.cse42 (not .cse43)) (.cse8 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.offset| 0)) (.cse9 (or (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.base| 0) (<= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0 0))) (.cse10 (= ULTIMATE.start_save_byte_from_array_~size ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0)) (.cse11 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 ULTIMATE.start_aws_array_eq_ignore_case_~len_a)) (.cse12 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.base| ULTIMATE.start_save_byte_from_array_~storage.base)) (.cse13 (not .cse1)) (.cse15 (not (= ULTIMATE.start_save_byte_from_array_~array.base 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse0 .cse22 .cse23 .cse24 .cse25 .cse26 .cse8 .cse27 .cse28 .cse3 .cse29 .cse4 .cse30 .cse10 .cse11 .cse12 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse15) (and .cse0 .cse1 .cse26 .cse4 .cse39 .cse40 .cse5 .cse6) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse32 .cse41 .cse13 .cse15) (and .cse16 .cse7 .cse19 .cse20 .cse21 .cse0 .cse24 .cse25 .cse8 .cse27 .cse28 .cse4 .cse30 .cse10 .cse11 .cse12 .cse31 .cse34 .cse35 .cse14 .cse38 .cse15) (and .cse16 .cse17 .cse7 .cse18 .cse42 .cse19 .cse20 .cse21 .cse0 .cse22 .cse23 .cse24 .cse25 .cse26 .cse8 .cse27 .cse28 .cse3 .cse29 .cse4 .cse30 .cse10 .cse11 .cse12 .cse31 .cse33 .cse5 .cse34 .cse35 .cse36 .cse37 .cse38 .cse15) (and .cse32 (or (and .cse0 .cse1 .cse26 .cse4 .cse39 .cse40 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6))) (and .cse42 .cse23 .cse26 .cse39 .cse32 .cse40) (and .cse16 .cse19 .cse20 .cse21 .cse0 .cse24 .cse25 .cse8 .cse27 .cse28 .cse4 .cse30 .cse10 .cse11 .cse12 .cse31 .cse32 .cse41 .cse34 .cse35 .cse38 .cse15) (and .cse17 .cse18 .cse19 .cse21 .cse25 .cse3 .cse29 .cse31 (or (and .cse0 .cse1 .cse26 .cse4 .cse11 .cse32 .cse6) (and .cse23 .cse26 .cse8 .cse9 .cse10 .cse11 .cse12 .cse32 .cse13 .cse15)) .cse35 .cse36) (and .cse17 .cse18 .cse19 .cse21 .cse25 .cse3 .cse29 .cse31 .cse35 .cse36 (or (and .cse7 .cse0 .cse1 .cse26 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse42 .cse23 .cse26 .cse8 .cse9 .cse10 .cse11 .cse12 .cse5 .cse13 .cse15))))))) [2021-10-28 23:02:29,629 INFO L857 garLoopResultBuilder]: For program point L7694-4(lines 7694 7700) no Hoare annotation was computed. [2021-10-28 23:02:29,630 INFO L853 garLoopResultBuilder]: At program point L7694-3(lines 7694 7700) the Hoare annotation is: (let ((.cse3 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0)) (.cse19 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.offset| 0)) (.cse28 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base| 0)) (.cse7 (= |ULTIMATE.start_can_fail_malloc_#res.base| 0))) (let ((.cse4 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0)) (.cse20 (not .cse7)) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse9 (or (and .cse19 .cse28) (<= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 0))) (.cse6 (= ULTIMATE.start_aws_array_eq_ignore_case_~len_b ULTIMATE.start_aws_array_eq_ignore_case_~len_a)) (.cse10 (not .cse3)) (.cse2 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 0))) (let ((.cse22 (or (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.base| 0) (<= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0 0))) (.cse26 (not .cse2)) (.cse11 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|)) (.cse12 (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1)) (.cse16 (let ((.cse39 (select |#memory_int| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base|))) (= (select .cse39 8) (select (select |#memory_int| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) (select .cse39 |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.offset|))))) (.cse30 (= ULTIMATE.start_save_byte_from_array_~array.offset 0)) (.cse13 (<= 0 |~#s_tolower_table~0.offset|)) (.cse31 (<= (+ |ULTIMATE.start_can_fail_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse14 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse29 (or (and .cse20 .cse8 .cse3 .cse4 .cse6) (and .cse20 .cse8 .cse9 .cse6 .cse10))) (.cse1 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.offset 0)) (.cse32 (let ((.cse38 (select |#memory_int| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.base|))) (= (select (select |#memory_int| ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base) (select .cse38 |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.offset|)) (select .cse38 8)))) (.cse15 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse21 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.offset| 0)) (.cse33 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 1) |#StackHeapBarrier|)) (.cse34 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base ULTIMATE.start_save_byte_from_array_~array.base)) (.cse5 (= |ULTIMATE.start_can_fail_malloc_#res.offset| 0)) (.cse35 (not (= ULTIMATE.start_save_byte_from_array_~array.base ULTIMATE.start_save_byte_from_array_~storage.base))) (.cse23 (= ULTIMATE.start_save_byte_from_array_~size ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0)) (.cse24 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 ULTIMATE.start_aws_array_eq_ignore_case_~len_a)) (.cse25 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.base| ULTIMATE.start_save_byte_from_array_~storage.base)) (.cse17 (<= |~#s_tolower_table~0.offset| 0)) (.cse0 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0)) (.cse36 (= (select |#valid| |ULTIMATE.start_can_fail_malloc_#res.base|) 1)) (.cse18 (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1)) (.cse37 (= ULTIMATE.start_save_byte_from_array_~storage.offset 0)) (.cse27 (not (= ULTIMATE.start_save_byte_from_array_~array.base 0)))) (or (and .cse0 (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse8 .cse5 .cse9 .cse6 .cse10 .cse7))) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse4 .cse16 .cse17 .cse18 .cse19 (or (and .cse20 .cse8 .cse21 .cse22 .cse23 .cse24 .cse6 .cse25 .cse0 .cse26 .cse27) (and .cse1 .cse2 .cse8 .cse5 .cse24 .cse6 .cse0 .cse7))) (and (not .cse28) .cse20 .cse8 .cse9 .cse6 .cse0 .cse10) (and .cse29 .cse21 .cse22 .cse23 .cse24 .cse25 .cse0 .cse26 .cse27) (and .cse30 .cse11 .cse12 .cse13 .cse31 .cse14 .cse1 (not (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base| ULTIMATE.start_save_byte_from_array_~storage.base)) .cse20 .cse32 .cse15 .cse8 .cse21 .cse33 .cse34 .cse4 .cse16 .cse5 .cse35 .cse23 .cse24 .cse6 .cse25 .cse17 .cse0 (not (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base ULTIMATE.start_save_byte_from_array_~storage.base)) .cse36 .cse18 .cse19 (= (select |#valid| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base|) 1) .cse37 .cse27) (and .cse30 .cse13 .cse31 .cse14 .cse29 .cse1 .cse32 .cse15 .cse21 .cse33 .cse34 .cse5 .cse35 .cse23 .cse24 .cse25 .cse17 .cse0 .cse36 .cse18 .cse37 .cse27))))) [2021-10-28 23:02:29,630 INFO L857 garLoopResultBuilder]: For program point L7694-2(lines 7694 7700) no Hoare annotation was computed. [2021-10-28 23:02:29,630 INFO L857 garLoopResultBuilder]: For program point L8999(lines 8967 9005) no Hoare annotation was computed. [2021-10-28 23:02:29,630 INFO L857 garLoopResultBuilder]: For program point L8975-2(lines 8975 8981) no Hoare annotation was computed. [2021-10-28 23:02:29,630 INFO L857 garLoopResultBuilder]: For program point L7695(lines 7695 7699) no Hoare annotation was computed. [2021-10-28 23:02:29,631 INFO L857 garLoopResultBuilder]: For program point L8975(lines 8975 8981) no Hoare annotation was computed. [2021-10-28 23:02:29,631 INFO L853 garLoopResultBuilder]: At program point L6886(lines 6882 6887) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |~#s_tolower_table~0.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1)) [2021-10-28 23:02:29,631 INFO L853 garLoopResultBuilder]: At program point L263(line 263) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 0)) (.cse3 (= |ULTIMATE.start_can_fail_malloc_#res.base| 0))) (let ((.cse8 (<= (+ |ULTIMATE.start_can_fail_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse10 (not .cse3)) (.cse13 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 1) |#StackHeapBarrier|)) (.cse14 (= (select |#valid| |ULTIMATE.start_can_fail_malloc_#res.base|) 1)) (.cse16 (not .cse5)) (.cse9 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse4 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.offset 0)) (.cse11 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse12 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse7 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0)) (.cse15 (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1))) (let ((.cse0 (= |~#s_tolower_table~0.offset| 0)) (.cse1 (let ((.cse17 (= ULTIMATE.start_save_byte_from_array_~array.offset 0)) (.cse18 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|)) (.cse19 (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1)) (.cse20 (not (= ULTIMATE.start_save_byte_from_array_~array.base ULTIMATE.start_save_byte_from_array_~storage.base))) (.cse21 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 ULTIMATE.start_save_byte_from_array_~size)) (.cse22 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.offset| 0)) (.cse23 (= ULTIMATE.start_save_byte_from_array_~array.base ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base)) (.cse24 (not (= ULTIMATE.start_save_byte_from_array_~storage.base 0))) (.cse25 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base| ULTIMATE.start_save_byte_from_array_~storage.base)) (.cse26 (= ULTIMATE.start_save_byte_from_array_~storage.offset 0))) (or (and .cse17 .cse18 .cse19 .cse8 .cse9 .cse4 .cse10 .cse11 .cse12 .cse13 .cse7 .cse20 .cse21 .cse14 .cse15 .cse16 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse17 .cse18 .cse19 .cse9 .cse4 .cse11 .cse5 .cse12 .cse7 .cse20 .cse21 .cse3 .cse15 .cse22 .cse23 .cse24 .cse25 .cse26 (not (= ULTIMATE.start_save_byte_from_array_~array.base 0)))))) (.cse6 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0)) (.cse2 (= |ULTIMATE.start_can_fail_malloc_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (= (select |#valid| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base|) 1)) (and .cse4 .cse5 .cse6 .cse7 .cse2 .cse3) (and (<= 0 |~#s_tolower_table~0.offset|) .cse8 .cse9 .cse4 .cse10 .cse11 .cse12 .cse13 .cse6 .cse7 .cse2 (<= |~#s_tolower_table~0.offset| 0) .cse14 .cse15 .cse16))))) [2021-10-28 23:02:29,632 INFO L853 garLoopResultBuilder]: At program point L263-1(line 263) the Hoare annotation is: (let ((.cse30 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0)) (.cse8 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.offset| 0)) (.cse31 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base| 0)) (.cse6 (= |ULTIMATE.start_can_fail_malloc_#res.base| 0))) (let ((.cse18 (= ULTIMATE.start_save_byte_from_array_~array.offset 0)) (.cse11 (<= 0 |~#s_tolower_table~0.offset|)) (.cse7 (<= (+ |ULTIMATE.start_can_fail_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse12 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse13 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse20 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.offset| 0)) (.cse21 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 1) |#StackHeapBarrier|)) (.cse22 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base ULTIMATE.start_save_byte_from_array_~array.base)) (.cse23 (not (= ULTIMATE.start_save_byte_from_array_~array.base ULTIMATE.start_save_byte_from_array_~storage.base))) (.cse24 (= ULTIMATE.start_save_byte_from_array_~size ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0)) (.cse25 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.base| ULTIMATE.start_save_byte_from_array_~storage.base)) (.cse16 (<= |~#s_tolower_table~0.offset| 0)) (.cse26 (= (select |#valid| |ULTIMATE.start_can_fail_malloc_#res.base|) 1)) (.cse17 (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1)) (.cse27 (= ULTIMATE.start_save_byte_from_array_~storage.offset 0)) (.cse28 (not (= ULTIMATE.start_save_byte_from_array_~array.base 0))) (.cse19 (not .cse6)) (.cse2 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse4 (or (and .cse8 .cse31) (<= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 0))) (.cse5 (not .cse30)) (.cse0 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.offset 0)) (.cse1 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 0)) (.cse14 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0)) (.cse3 (= |ULTIMATE.start_can_fail_malloc_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 (not (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base| ULTIMATE.start_save_byte_from_array_~storage.base)) (not (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base ULTIMATE.start_save_byte_from_array_~storage.base)) .cse8 (let ((.cse9 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|)) (.cse10 (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1)) (.cse15 (let ((.cse29 (select |#memory_int| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base|))) (= (select .cse29 8) (select (select |#memory_int| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) (select .cse29 |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.offset|)))))) (or (and .cse9 .cse10 .cse11 .cse12 .cse0 .cse13 .cse1 .cse2 .cse14 .cse15 .cse3 .cse16 .cse6 .cse17) (and .cse18 .cse9 .cse10 .cse11 .cse12 .cse0 .cse19 .cse13 .cse2 .cse20 .cse21 .cse22 .cse14 .cse15 .cse3 .cse23 .cse24 .cse25 .cse16 .cse26 .cse17 .cse27 .cse28))) (= (select |#valid| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base|) 1)) (and .cse18 .cse11 .cse7 .cse12 .cse0 .cse13 .cse20 .cse21 .cse22 .cse3 .cse23 .cse24 .cse25 .cse16 (or (and .cse19 .cse2 .cse30 .cse14) (and .cse19 .cse2 .cse4 .cse5)) .cse26 .cse17 .cse27 .cse28) (and (not .cse31) .cse19 .cse2 .cse4 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0) .cse5) (and .cse0 .cse1 .cse30 .cse14 .cse3 .cse6)))) [2021-10-28 23:02:29,632 INFO L857 garLoopResultBuilder]: For program point L8967(lines 8967 9005) no Hoare annotation was computed. [2021-10-28 23:02:29,632 INFO L853 garLoopResultBuilder]: At program point L6886-1(lines 6882 6887) the Hoare annotation is: (let ((.cse0 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse1 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse2 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse3 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0)) (.cse4 (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1))) (or (and (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|) (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1) .cse0 .cse1 (= |~#s_tolower_table~0.offset| 0) .cse2 .cse3 .cse4) (and (<= 0 |~#s_tolower_table~0.offset|) .cse0 .cse1 .cse2 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0) .cse3 (<= |~#s_tolower_table~0.offset| 0) .cse4))) [2021-10-28 23:02:29,632 INFO L857 garLoopResultBuilder]: For program point L7134(lines 7134 7140) no Hoare annotation was computed. [2021-10-28 23:02:29,632 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-28 23:02:29,632 INFO L857 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-10-28 23:02:29,633 INFO L857 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-10-28 23:02:29,633 INFO L857 garLoopResultBuilder]: For program point L7134-1(lines 7134 7140) no Hoare annotation was computed. [2021-10-28 23:02:29,633 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:02:29,633 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-28 23:02:29,633 INFO L857 garLoopResultBuilder]: For program point L7135(lines 7135 7139) no Hoare annotation was computed. [2021-10-28 23:02:29,633 INFO L857 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-10-28 23:02:29,634 INFO L857 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-10-28 23:02:29,634 INFO L857 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-10-28 23:02:29,634 INFO L857 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-10-28 23:02:29,634 INFO L857 garLoopResultBuilder]: For program point L7135-2(lines 7135 7139) no Hoare annotation was computed. [2021-10-28 23:02:29,634 INFO L857 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-10-28 23:02:29,635 INFO L857 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-10-28 23:02:29,635 INFO L857 garLoopResultBuilder]: For program point L9002(lines 9002 9004) no Hoare annotation was computed. [2021-10-28 23:02:29,635 INFO L857 garLoopResultBuilder]: For program point L8994(lines 8994 8996) no Hoare annotation was computed. [2021-10-28 23:02:29,635 INFO L857 garLoopResultBuilder]: For program point L8994-1(lines 8967 9005) no Hoare annotation was computed. [2021-10-28 23:02:29,635 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 23:02:29,639 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:02:29,641 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 23:02:29,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 11:02:29 BoogieIcfgContainer [2021-10-28 23:02:29,755 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 23:02:29,756 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 23:02:29,756 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 23:02:29,756 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 23:02:29,757 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:59:18" (3/4) ... [2021-10-28 23:02:29,760 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-28 23:02:29,791 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 131 nodes and edges [2021-10-28 23:02:29,793 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2021-10-28 23:02:29,796 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-10-28 23:02:29,798 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-10-28 23:02:29,800 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-10-28 23:02:29,802 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-28 23:02:29,805 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-28 23:02:29,807 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 23:02:29,846 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 <= s_tolower_table && \result == 0) && s_tolower_table <= 0) && \result == 0) || (((((((\result + 1 <= unknown-#StackHeapBarrier-unknown && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && \result == 0) && \valid[\result] == 1) && \valid[\result] == 1) [2021-10-28 23:02:29,847 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result + 1 <= unknown-#StackHeapBarrier-unknown && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && \valid[\result] == 1 [2021-10-28 23:02:29,847 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 <= s_tolower_table && lhs == 0) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \result == 0) || ((((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && lhs == 0) && \result == 0) && !(lhs == 0)) && \valid[\result] == 1) && \valid[\result] == 1) [2021-10-28 23:02:29,848 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((s_tolower_table == 0 && (((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && lhs == 0) && !(array == storage)) && lhs_len == size) && \valid[\result] == 1) && \valid[\result] == 1) && !(rhs == 0)) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) || ((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && rhs == 0) && !(\result == 0)) && lhs == 0) && !(array == storage)) && lhs_len == size) && \result == 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) && !(array == 0)))) && \result == 0) && \result == 0) || (((s_tolower_table == 0 && (((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && lhs == 0) && !(array == storage)) && lhs_len == size) && \valid[\result] == 1) && \valid[\result] == 1) && !(rhs == 0)) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) || ((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && rhs == 0) && !(\result == 0)) && lhs == 0) && !(array == storage)) && lhs_len == size) && \result == 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) && !(array == 0)))) && \result == 0) && \valid[\old_byte_from_lhs] == 1)) || (((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0)) || ((((((((((((((0 <= s_tolower_table && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && lhs == 0) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) && !(rhs == 0)) [2021-10-28 23:02:29,848 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 <= s_tolower_table && lhs == 0) && lhs == 0) && s_tolower_table <= 0) || (((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && lhs == 0) && \valid[\result] == 1) [2021-10-28 23:02:29,848 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || (((((\result + 1 <= unknown-#StackHeapBarrier-unknown && !(\old_byte_from_lhs == storage)) && !(lhs == storage)) && \old_byte_from_lhs == 0) && ((((((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && rhs == 0) && !(\result == 0)) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && s_tolower_table <= 0) && \result == 0) && \valid[\result] == 1) || ((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0)))) && \valid[\old_byte_from_lhs] == 1)) || ((((((((((((((((((array == 0 && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) || (((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)))) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0))) || (((((!(\old_byte_from_lhs == 0) && !(\result == 0)) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && lhs_len == rhs_len) && !(lhs == 0))) || (((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0) [2021-10-28 23:02:29,849 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \result == 0) && \valid[\result] == 1)) || (((lhs == 0 && lhs == 0) && \result == 0) && \result == 0)) || ((((((((((0 <= s_tolower_table && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) [2021-10-28 23:02:29,849 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && lhs == 0) && \valid[\result] == 1) || (((((((0 <= s_tolower_table && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && s_tolower_table <= 0) && \valid[\result] == 1) [2021-10-28 23:02:29,850 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0) && \result == 0) || (((((((((!(len_b == len_a) || lhs_len == rhs_len) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && !(rhs == 0)) && (((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && \result == 0))) && !(array == 0))) || ((((((((((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\old_byte_from_lhs == storage)) && !(\result == 0)) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && !(lhs == storage)) && \valid[\result] == 1) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && \valid[\old_byte_from_lhs] == 1) && storage == 0) && !(array == 0))) || (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) && \result == 0)) || ((((((((\old_byte_from_rhs == 0 && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) || (((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)))) && !(rhs == 0)) && !(array == 0))) || (((((((((((((((((((((array == 0 && (!(len_b == len_a) || lhs_len == rhs_len)) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) && (((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && \result == 0))) && storage == 0) && !(array == 0))) || ((((((((((((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && (!(len_b == len_a) || lhs_len == rhs_len)) && \valid[lhs] == 1) && !(\old_byte_from_lhs == 0)) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\old_byte_from_lhs == storage)) && !(\result == 0)) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && !(lhs == storage)) && \result == 0) && \valid[\result] == 1) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && \valid[\old_byte_from_lhs] == 1) && storage == 0) && !(array == 0))) || (lhs_len == rhs_len && (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || (((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0)))) || (((((!(\old_byte_from_lhs == 0) && !(\result == 0)) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && lhs_len == rhs_len) && !(lhs == 0))) || (((((((((((((((((((((array == 0 && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) || (((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)))) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0))) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && s_tolower_table <= 0) && (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && lhs_len == len_a) && lhs_len == rhs_len) && \result == 0) || (((((((((!(\result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && !(rhs == 0)) && !(array == 0)))) && \valid[\result] == 1) && \old_byte_from_lhs == 0)) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && s_tolower_table <= 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && (((((((((!(len_b == len_a) || lhs_len == rhs_len) && rhs == 0) && rhs == 0) && !(\result == 0)) && \result == 0) && lhs_len == len_a) && \result == 0) && \result == 0) || ((((((((((((!(len_b == len_a) || lhs_len == rhs_len) && !(\old_byte_from_lhs == 0)) && !(\result == 0)) && !(\result == 0)) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && \result == 0) && !(rhs == 0)) && !(array == 0)))) [2021-10-28 23:02:29,850 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((lhs_len == rhs_len && (((((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && len_b == len_a) && \result == 0) || (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && !(lhs == 0)) && \result == 0))) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && s_tolower_table <= 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && (((((((((((!(\result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && len_b == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && !(rhs == 0)) && !(array == 0)) || (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && lhs_len == len_a) && len_b == len_a) && lhs_len == rhs_len) && \result == 0)))) || ((((((!(\old_byte_from_lhs == 0) && !(\result == 0)) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && lhs_len == rhs_len) && !(lhs == 0))) || (((((((((((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && len_b == len_a) || ((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && !(lhs == 0))) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && !(rhs == 0)) && !(array == 0))) || (((((((((((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\old_byte_from_lhs == storage)) && !(\result == 0)) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && len_b == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && !(lhs == storage)) && \valid[\result] == 1) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && \valid[\old_byte_from_lhs] == 1) && storage == 0) && !(array == 0))) || (((((((((((((((((((((array == 0 && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && (((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && len_b == len_a) || ((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && !(lhs == 0)))) && rhs == 0) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0)) [2021-10-28 23:02:31,041 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_795683a1-385d-4134-a094-222c8c74b85e/bin/uautomizer-GMMbpWq8iD/witness.graphml [2021-10-28 23:02:31,041 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 23:02:31,043 INFO L168 Benchmark]: Toolchain (without parser) took 207527.53 ms. Allocated memory was 90.2 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 65.8 MB in the beginning and 736.0 MB in the end (delta: -670.2 MB). Peak memory consumption was 807.7 MB. Max. memory is 16.1 GB. [2021-10-28 23:02:31,043 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 90.2 MB. Free memory was 60.8 MB in the beginning and 60.8 MB in the end (delta: 27.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 23:02:31,044 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3293.82 ms. Allocated memory was 90.2 MB in the beginning and 119.5 MB in the end (delta: 29.4 MB). Free memory was 65.4 MB in the beginning and 40.3 MB in the end (delta: 25.2 MB). Peak memory consumption was 69.0 MB. Max. memory is 16.1 GB. [2021-10-28 23:02:31,044 INFO L168 Benchmark]: Boogie Procedure Inliner took 304.48 ms. Allocated memory was 119.5 MB in the beginning and 167.8 MB in the end (delta: 48.2 MB). Free memory was 40.3 MB in the beginning and 107.7 MB in the end (delta: -67.4 MB). Peak memory consumption was 4.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:02:31,045 INFO L168 Benchmark]: Boogie Preprocessor took 144.30 ms. Allocated memory is still 167.8 MB. Free memory was 107.7 MB in the beginning and 100.3 MB in the end (delta: 7.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 23:02:31,045 INFO L168 Benchmark]: RCFGBuilder took 10820.92 ms. Allocated memory was 167.8 MB in the beginning and 293.6 MB in the end (delta: 125.8 MB). Free memory was 100.3 MB in the beginning and 108.5 MB in the end (delta: -8.3 MB). Peak memory consumption was 167.8 MB. Max. memory is 16.1 GB. [2021-10-28 23:02:31,046 INFO L168 Benchmark]: TraceAbstraction took 191671.69 ms. Allocated memory was 293.6 MB in the beginning and 1.2 GB in the end (delta: 924.8 MB). Free memory was 107.5 MB in the beginning and 835.5 MB in the end (delta: -728.0 MB). Peak memory consumption was 624.6 MB. Max. memory is 16.1 GB. [2021-10-28 23:02:31,046 INFO L168 Benchmark]: Witness Printer took 1285.73 ms. Allocated memory is still 1.2 GB. Free memory was 835.5 MB in the beginning and 736.0 MB in the end (delta: 99.5 MB). Peak memory consumption was 449.7 MB. Max. memory is 16.1 GB. [2021-10-28 23:02:31,049 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.36 ms. Allocated memory is still 90.2 MB. Free memory was 60.8 MB in the beginning and 60.8 MB in the end (delta: 27.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 3293.82 ms. Allocated memory was 90.2 MB in the beginning and 119.5 MB in the end (delta: 29.4 MB). Free memory was 65.4 MB in the beginning and 40.3 MB in the end (delta: 25.2 MB). Peak memory consumption was 69.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 304.48 ms. Allocated memory was 119.5 MB in the beginning and 167.8 MB in the end (delta: 48.2 MB). Free memory was 40.3 MB in the beginning and 107.7 MB in the end (delta: -67.4 MB). Peak memory consumption was 4.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 144.30 ms. Allocated memory is still 167.8 MB. Free memory was 107.7 MB in the beginning and 100.3 MB in the end (delta: 7.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 10820.92 ms. Allocated memory was 167.8 MB in the beginning and 293.6 MB in the end (delta: 125.8 MB). Free memory was 100.3 MB in the beginning and 108.5 MB in the end (delta: -8.3 MB). Peak memory consumption was 167.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 191671.69 ms. Allocated memory was 293.6 MB in the beginning and 1.2 GB in the end (delta: 924.8 MB). Free memory was 107.5 MB in the beginning and 835.5 MB in the end (delta: -728.0 MB). Peak memory consumption was 624.6 MB. Max. memory is 16.1 GB. * Witness Printer took 1285.73 ms. Allocated memory is still 1.2 GB. Free memory was 835.5 MB in the beginning and 736.0 MB in the end (delta: 99.5 MB). Peak memory consumption was 449.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 67 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 191.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 95.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1328 SDtfs, 4025 SDslu, 5646 SDs, 0 SdLazy, 2225 SolverSat, 156 SolverUnsat, 35 SolverUnknown, 0 SolverNotchecked, 77.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 16.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=8, InterpolantAutomatonStates: 195, 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, 19 MinimizatonAttempts, 555 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 85 NumberOfFragments, 2871 HoareAnnotationTreeSize, 12 FomulaSimplifications, 12887 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 12 FomulaSimplificationsInter, 6251 FormulaSimplificationTreeSizeReductionInter, 13.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 68.7s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 688 NumberOfCodeBlocks, 688 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 669 ConstructedInterpolants, 0 QuantifiedInterpolants, 5286 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: (((((s_tolower_table == 0 && (((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && lhs == 0) && !(array == storage)) && lhs_len == size) && \valid[\result] == 1) && \valid[\result] == 1) && !(rhs == 0)) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) || ((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && rhs == 0) && !(\result == 0)) && lhs == 0) && !(array == storage)) && lhs_len == size) && \result == 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) && !(array == 0)))) && \result == 0) && \result == 0) || (((s_tolower_table == 0 && (((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && lhs == 0) && !(array == storage)) && lhs_len == size) && \valid[\result] == 1) && \valid[\result] == 1) && !(rhs == 0)) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) || ((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && rhs == 0) && !(\result == 0)) && lhs == 0) && !(array == storage)) && lhs_len == size) && \result == 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) && !(array == 0)))) && \result == 0) && \valid[\old_byte_from_lhs] == 1)) || (((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0)) || ((((((((((((((0 <= s_tolower_table && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && lhs == 0) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) && !(rhs == 0)) - InvariantResult [Line: 6882]: Loop Invariant Derived loop invariant: (((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && lhs == 0) && \valid[\result] == 1) || (((((((0 <= s_tolower_table && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && s_tolower_table <= 0) && \valid[\result] == 1) - InvariantResult [Line: 7675]: Loop Invariant Derived loop invariant: ((((((((((((((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0) && \result == 0) || (((((((((!(len_b == len_a) || lhs_len == rhs_len) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && !(rhs == 0)) && (((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && \result == 0))) && !(array == 0))) || ((((((((((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\old_byte_from_lhs == storage)) && !(\result == 0)) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && !(lhs == storage)) && \valid[\result] == 1) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && \valid[\old_byte_from_lhs] == 1) && storage == 0) && !(array == 0))) || (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) && \result == 0)) || ((((((((\old_byte_from_rhs == 0 && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) || (((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)))) && !(rhs == 0)) && !(array == 0))) || (((((((((((((((((((((array == 0 && (!(len_b == len_a) || lhs_len == rhs_len)) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) && (((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && \result == 0))) && storage == 0) && !(array == 0))) || ((((((((((((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && (!(len_b == len_a) || lhs_len == rhs_len)) && \valid[lhs] == 1) && !(\old_byte_from_lhs == 0)) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\old_byte_from_lhs == storage)) && !(\result == 0)) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && !(lhs == storage)) && \result == 0) && \valid[\result] == 1) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && \valid[\old_byte_from_lhs] == 1) && storage == 0) && !(array == 0))) || (lhs_len == rhs_len && (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || (((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0)))) || (((((!(\old_byte_from_lhs == 0) && !(\result == 0)) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && lhs_len == rhs_len) && !(lhs == 0))) || (((((((((((((((((((((array == 0 && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) || (((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)))) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0))) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && s_tolower_table <= 0) && (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && lhs_len == len_a) && lhs_len == rhs_len) && \result == 0) || (((((((((!(\result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && !(rhs == 0)) && !(array == 0)))) && \valid[\result] == 1) && \old_byte_from_lhs == 0)) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && s_tolower_table <= 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && (((((((((!(len_b == len_a) || lhs_len == rhs_len) && rhs == 0) && rhs == 0) && !(\result == 0)) && \result == 0) && lhs_len == len_a) && \result == 0) && \result == 0) || ((((((((((((!(len_b == len_a) || lhs_len == rhs_len) && !(\old_byte_from_lhs == 0)) && !(\result == 0)) && !(\result == 0)) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && \result == 0) && !(rhs == 0)) && !(array == 0)))) - InvariantResult [Line: 7694]: Loop Invariant Derived loop invariant: (((((lhs_len == rhs_len && (((((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && len_b == len_a) && \result == 0) || (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && !(lhs == 0)) && \result == 0))) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && s_tolower_table <= 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && (((((((((((!(\result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && len_b == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && !(rhs == 0)) && !(array == 0)) || (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && lhs_len == len_a) && len_b == len_a) && lhs_len == rhs_len) && \result == 0)))) || ((((((!(\old_byte_from_lhs == 0) && !(\result == 0)) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && lhs_len == rhs_len) && !(lhs == 0))) || (((((((((((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && len_b == len_a) || ((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && !(lhs == 0))) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && !(rhs == 0)) && !(array == 0))) || (((((((((((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\old_byte_from_lhs == storage)) && !(\result == 0)) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && len_b == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && !(lhs == storage)) && \valid[\result] == 1) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && \valid[\old_byte_from_lhs] == 1) && storage == 0) && !(array == 0))) || (((((((((((((((((((((array == 0 && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && (((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && len_b == len_a) || ((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && !(lhs == 0)))) && rhs == 0) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0)) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (((((0 <= s_tolower_table && lhs == 0) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \result == 0) || ((((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && lhs == 0) && \result == 0) && !(lhs == 0)) && \valid[\result] == 1) && \valid[\result] == 1) - InvariantResult [Line: 6899]: Loop Invariant Derived loop invariant: (((0 <= s_tolower_table && \result == 0) && s_tolower_table <= 0) && \result == 0) || (((((((\result + 1 <= unknown-#StackHeapBarrier-unknown && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && \result == 0) && \valid[\result] == 1) && \valid[\result] == 1) - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: (((((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || (((((\result + 1 <= unknown-#StackHeapBarrier-unknown && !(\old_byte_from_lhs == storage)) && !(lhs == storage)) && \old_byte_from_lhs == 0) && ((((((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && rhs == 0) && !(\result == 0)) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && s_tolower_table <= 0) && \result == 0) && \valid[\result] == 1) || ((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0)))) && \valid[\old_byte_from_lhs] == 1)) || ((((((((((((((((((array == 0 && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) || (((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)))) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0))) || (((((!(\old_byte_from_lhs == 0) && !(\result == 0)) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && lhs_len == rhs_len) && !(lhs == 0))) || (((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0) - InvariantResult [Line: 6899]: Loop Invariant Derived loop invariant: (((((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \result == 0) && \valid[\result] == 1)) || (((lhs == 0 && lhs == 0) && \result == 0) && \result == 0)) || ((((((((((0 <= s_tolower_table && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) - InvariantResult [Line: 9006]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6882]: Loop Invariant Derived loop invariant: (((\result + 1 <= unknown-#StackHeapBarrier-unknown && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && \valid[\result] == 1 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (((0 <= s_tolower_table && lhs == 0) && lhs == 0) && s_tolower_table <= 0) || (((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && lhs == 0) && \valid[\result] == 1) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: s_tolower_table == 0 RESULT: Ultimate proved your program to be correct! [2021-10-28 23:02:31,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_795683a1-385d-4134-a094-222c8c74b85e/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...