./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_250cd78c-0e06-47e5-a94d-9a4de98226f4/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250cd78c-0e06-47e5-a94d-9a4de98226f4/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250cd78c-0e06-47e5-a94d-9a4de98226f4/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250cd78c-0e06-47e5-a94d-9a4de98226f4/bin/uautomizer-UnR33cPsHg/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_250cd78c-0e06-47e5-a94d-9a4de98226f4/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250cd78c-0e06-47e5-a94d-9a4de98226f4/bin/uautomizer-UnR33cPsHg --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 09:18:51,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 09:18:51,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 09:18:51,378 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 09:18:51,379 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 09:18:51,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 09:18:51,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 09:18:51,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 09:18:51,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 09:18:51,398 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 09:18:51,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 09:18:51,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 09:18:51,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 09:18:51,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 09:18:51,410 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 09:18:51,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 09:18:51,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 09:18:51,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 09:18:51,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 09:18:51,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 09:18:51,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 09:18:51,435 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 09:18:51,436 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 09:18:51,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 09:18:51,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 09:18:51,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 09:18:51,449 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 09:18:51,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 09:18:51,452 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 09:18:51,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 09:18:51,459 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 09:18:51,461 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 09:18:51,462 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 09:18:51,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 09:18:51,465 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 09:18:51,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 09:18:51,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 09:18:51,467 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 09:18:51,467 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 09:18:51,468 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 09:18:51,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 09:18:51,470 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250cd78c-0e06-47e5-a94d-9a4de98226f4/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-10-28 09:18:51,521 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 09:18:51,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 09:18:51,522 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 09:18:51,522 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 09:18:51,524 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 09:18:51,524 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 09:18:51,524 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 09:18:51,525 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 09:18:51,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 09:18:51,525 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 09:18:51,526 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 09:18:51,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 09:18:51,527 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 09:18:51,527 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 09:18:51,527 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 09:18:51,527 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 09:18:51,528 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 09:18:51,528 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 09:18:51,528 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 09:18:51,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:18:51,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 09:18:51,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 09:18:51,529 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 09:18:51,529 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 09:18:51,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 09:18:51,530 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 09:18:51,530 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 09:18:51,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 09:18:51,531 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 09:18:51,532 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250cd78c-0e06-47e5-a94d-9a4de98226f4/bin/uautomizer-UnR33cPsHg/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_250cd78c-0e06-47e5-a94d-9a4de98226f4/bin/uautomizer-UnR33cPsHg 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 09:18:51,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 09:18:51,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 09:18:51,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 09:18:51,839 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 09:18:51,840 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 09:18:51,841 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250cd78c-0e06-47e5-a94d-9a4de98226f4/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/aws-c-common/aws_array_eq_ignore_case_harness.i [2021-10-28 09:18:51,902 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250cd78c-0e06-47e5-a94d-9a4de98226f4/bin/uautomizer-UnR33cPsHg/data/db6af263b/9b71dad2afdf4572a7b4ad19fc2d9b79/FLAG61ce9349a [2021-10-28 09:18:52,746 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 09:18:52,748 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250cd78c-0e06-47e5-a94d-9a4de98226f4/sv-benchmarks/c/aws-c-common/aws_array_eq_ignore_case_harness.i [2021-10-28 09:18:52,795 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250cd78c-0e06-47e5-a94d-9a4de98226f4/bin/uautomizer-UnR33cPsHg/data/db6af263b/9b71dad2afdf4572a7b4ad19fc2d9b79/FLAG61ce9349a [2021-10-28 09:18:53,269 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250cd78c-0e06-47e5-a94d-9a4de98226f4/bin/uautomizer-UnR33cPsHg/data/db6af263b/9b71dad2afdf4572a7b4ad19fc2d9b79 [2021-10-28 09:18:53,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 09:18:53,273 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 09:18:53,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 09:18:53,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 09:18:53,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 09:18:53,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:18:53" (1/1) ... [2021-10-28 09:18:53,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@516dfad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:53, skipping insertion in model container [2021-10-28 09:18:53,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:18:53" (1/1) ... [2021-10-28 09:18:53,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 09:18:53,377 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 09:18:53,659 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_250cd78c-0e06-47e5-a94d-9a4de98226f4/sv-benchmarks/c/aws-c-common/aws_array_eq_ignore_case_harness.i[4498,4511] [2021-10-28 09:18:53,666 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_250cd78c-0e06-47e5-a94d-9a4de98226f4/sv-benchmarks/c/aws-c-common/aws_array_eq_ignore_case_harness.i[4558,4571] [2021-10-28 09:18:53,688 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-10-28 09:18:53,694 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-10-28 09:18:54,577 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:18:54,578 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:18:54,579 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:18:54,580 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:18:54,581 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:18:54,595 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:18:54,596 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:18:54,598 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:18:54,599 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:18:55,025 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-10-28 09:18:55,026 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-10-28 09:18:55,027 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-10-28 09:18:55,032 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-10-28 09:18:55,033 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-10-28 09:18:55,038 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-10-28 09:18:55,039 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-10-28 09:18:55,040 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-10-28 09:18:55,041 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-10-28 09:18:55,042 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-10-28 09:18:55,252 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-10-28 09:18:55,345 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:18:55,346 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:18:55,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:18:55,507 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 09:18:55,538 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_250cd78c-0e06-47e5-a94d-9a4de98226f4/sv-benchmarks/c/aws-c-common/aws_array_eq_ignore_case_harness.i[4498,4511] [2021-10-28 09:18:55,539 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_250cd78c-0e06-47e5-a94d-9a4de98226f4/sv-benchmarks/c/aws-c-common/aws_array_eq_ignore_case_harness.i[4558,4571] [2021-10-28 09:18:55,540 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-10-28 09:18:55,541 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-10-28 09:18:55,623 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:18:55,626 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:18:55,626 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:18:55,627 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:18:55,628 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:18:55,645 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:18:55,651 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:18:55,652 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:18:55,653 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:18:55,722 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-10-28 09:18:55,723 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-10-28 09:18:55,724 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-10-28 09:18:55,725 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-10-28 09:18:55,729 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-10-28 09:18:55,729 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-10-28 09:18:55,731 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-10-28 09:18:55,732 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-10-28 09:18:55,732 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-10-28 09:18:55,733 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-10-28 09:18:55,780 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-10-28 09:18:55,873 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:18:55,874 WARN L1513 CHandler]: Possible shadowing of function index [2021-10-28 09:18:55,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:18:56,145 INFO L208 MainTranslator]: Completed translation [2021-10-28 09:18:56,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:56 WrapperNode [2021-10-28 09:18:56,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 09:18:56,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 09:18:56,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 09:18:56,147 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 09:18:56,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:56" (1/1) ... [2021-10-28 09:18:56,287 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:56" (1/1) ... [2021-10-28 09:18:56,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 09:18:56,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 09:18:56,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 09:18:56,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 09:18:56,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:56" (1/1) ... [2021-10-28 09:18:56,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:56" (1/1) ... [2021-10-28 09:18:56,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:56" (1/1) ... [2021-10-28 09:18:56,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:56" (1/1) ... [2021-10-28 09:18:56,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:56" (1/1) ... [2021-10-28 09:18:56,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:56" (1/1) ... [2021-10-28 09:18:56,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:56" (1/1) ... [2021-10-28 09:18:56,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 09:18:56,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 09:18:56,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 09:18:56,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 09:18:56,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:56" (1/1) ... [2021-10-28 09:18:56,563 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:18:56,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250cd78c-0e06-47e5-a94d-9a4de98226f4/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:18:56,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250cd78c-0e06-47e5-a94d-9a4de98226f4/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 09:18:56,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250cd78c-0e06-47e5-a94d-9a4de98226f4/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 09:18:56,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 09:18:56,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-28 09:18:56,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-28 09:18:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 09:18:56,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 09:18:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 09:18:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-10-28 09:18:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-28 09:18:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 09:19:07,540 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 09:19:07,541 INFO L299 CfgBuilder]: Removed 61 assume(true) statements. [2021-10-28 09:19:07,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:19:07 BoogieIcfgContainer [2021-10-28 09:19:07,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 09:19:07,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 09:19:07,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 09:19:07,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 09:19:07,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 09:18:53" (1/3) ... [2021-10-28 09:19:07,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743e7e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:19:07, skipping insertion in model container [2021-10-28 09:19:07,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:18:56" (2/3) ... [2021-10-28 09:19:07,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743e7e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:19:07, skipping insertion in model container [2021-10-28 09:19:07,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:19:07" (3/3) ... [2021-10-28 09:19:07,560 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_array_eq_ignore_case_harness.i [2021-10-28 09:19:07,565 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 09:19:07,566 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-10-28 09:19:07,611 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 09:19:07,617 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 09:19:07,617 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-10-28 09:19:07,633 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 09:19:07,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-28 09:19:07,640 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:07,640 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 09:19:07,641 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 09:19:07,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:07,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1732099540, now seen corresponding path program 1 times [2021-10-28 09:19:07,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:07,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771974771] [2021-10-28 09:19:07,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:07,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:08,376 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 09:19:08,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:08,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771974771] [2021-10-28 09:19:08,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771974771] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:08,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:08,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:19:08,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18183931] [2021-10-28 09:19:08,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-28 09:19:08,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:08,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-28 09:19:08,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-28 09:19:08,399 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 09:19:08,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:08,418 INFO L93 Difference]: Finished difference Result 131 states and 182 transitions. [2021-10-28 09:19:08,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-28 09:19:08,420 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 09:19:08,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:08,428 INFO L225 Difference]: With dead ends: 131 [2021-10-28 09:19:08,428 INFO L226 Difference]: Without dead ends: 61 [2021-10-28 09:19:08,431 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 09:19:08,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-10-28 09:19:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-10-28 09:19:08,463 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 09:19:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2021-10-28 09:19:08,467 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 27 [2021-10-28 09:19:08,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:08,467 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2021-10-28 09:19:08,467 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 09:19:08,468 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2021-10-28 09:19:08,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-28 09:19:08,469 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:08,469 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 09:19:08,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 09:19:08,470 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 09:19:08,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:08,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1816466470, now seen corresponding path program 1 times [2021-10-28 09:19:08,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:08,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405634605] [2021-10-28 09:19:08,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:08,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:08,826 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 09:19:08,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:08,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405634605] [2021-10-28 09:19:08,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405634605] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:08,827 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:08,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:19:08,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819654571] [2021-10-28 09:19:08,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:19:08,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:08,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:19:08,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:19:08,831 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 09:19:09,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:09,065 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2021-10-28 09:19:09,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:19:09,068 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 09:19:09,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:09,070 INFO L225 Difference]: With dead ends: 132 [2021-10-28 09:19:09,071 INFO L226 Difference]: Without dead ends: 116 [2021-10-28 09:19:09,072 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 09:19:09,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-10-28 09:19:09,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 80. [2021-10-28 09:19:09,090 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 09:19:09,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2021-10-28 09:19:09,092 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 27 [2021-10-28 09:19:09,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:09,093 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2021-10-28 09:19:09,093 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 09:19:09,094 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2021-10-28 09:19:09,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-28 09:19:09,098 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:09,099 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 09:19:09,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 09:19:09,099 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 09:19:09,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:09,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1086636907, now seen corresponding path program 1 times [2021-10-28 09:19:09,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:09,101 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917915853] [2021-10-28 09:19:09,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:09,101 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:09,935 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 09:19:09,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:09,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917915853] [2021-10-28 09:19:09,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917915853] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:09,936 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:09,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:19:09,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583979162] [2021-10-28 09:19:09,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:19:09,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:09,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:19:09,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:19:09,938 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 09:19:10,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:10,164 INFO L93 Difference]: Finished difference Result 104 states and 122 transitions. [2021-10-28 09:19:10,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:19:10,165 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 09:19:10,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:10,166 INFO L225 Difference]: With dead ends: 104 [2021-10-28 09:19:10,166 INFO L226 Difference]: Without dead ends: 102 [2021-10-28 09:19:10,167 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 09:19:10,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-10-28 09:19:10,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 87. [2021-10-28 09:19:10,174 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 09:19:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2021-10-28 09:19:10,179 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 29 [2021-10-28 09:19:10,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:10,179 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2021-10-28 09:19:10,180 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 09:19:10,180 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2021-10-28 09:19:10,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-28 09:19:10,181 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:10,181 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 09:19:10,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 09:19:10,182 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 09:19:10,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:10,182 INFO L85 PathProgramCache]: Analyzing trace with hash -571433758, now seen corresponding path program 1 times [2021-10-28 09:19:10,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:10,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597697720] [2021-10-28 09:19:10,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:10,183 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:10,697 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 09:19:10,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:10,697 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597697720] [2021-10-28 09:19:10,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597697720] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:10,698 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:10,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:19:10,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197697914] [2021-10-28 09:19:10,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:19:10,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:10,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:19:10,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:19:10,700 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 09:19:11,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:11,120 INFO L93 Difference]: Finished difference Result 250 states and 292 transitions. [2021-10-28 09:19:11,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:19:11,121 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 09:19:11,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:11,125 INFO L225 Difference]: With dead ends: 250 [2021-10-28 09:19:11,125 INFO L226 Difference]: Without dead ends: 241 [2021-10-28 09:19:11,126 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 09:19:11,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-10-28 09:19:11,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 154. [2021-10-28 09:19:11,156 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 09:19:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 184 transitions. [2021-10-28 09:19:11,162 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 184 transitions. Word has length 31 [2021-10-28 09:19:11,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:11,163 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 184 transitions. [2021-10-28 09:19:11,163 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 09:19:11,163 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 184 transitions. [2021-10-28 09:19:11,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-28 09:19:11,165 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:11,165 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 09:19:11,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 09:19:11,166 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 09:19:11,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:11,167 INFO L85 PathProgramCache]: Analyzing trace with hash -518323106, now seen corresponding path program 1 times [2021-10-28 09:19:11,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:11,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102668253] [2021-10-28 09:19:11,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:11,168 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:11,513 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 09:19:11,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:11,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102668253] [2021-10-28 09:19:11,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102668253] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:11,514 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:11,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:19:11,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353243772] [2021-10-28 09:19:11,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:19:11,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:11,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:19:11,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:19:11,516 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 09:19:11,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:11,669 INFO L93 Difference]: Finished difference Result 172 states and 203 transitions. [2021-10-28 09:19:11,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:19:11,671 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 09:19:11,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:11,672 INFO L225 Difference]: With dead ends: 172 [2021-10-28 09:19:11,672 INFO L226 Difference]: Without dead ends: 167 [2021-10-28 09:19:11,673 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 09:19:11,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-10-28 09:19:11,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 156. [2021-10-28 09:19:11,716 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 09:19:11,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 186 transitions. [2021-10-28 09:19:11,717 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 186 transitions. Word has length 32 [2021-10-28 09:19:11,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:11,718 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 186 transitions. [2021-10-28 09:19:11,718 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 09:19:11,718 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 186 transitions. [2021-10-28 09:19:11,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-28 09:19:11,720 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:11,720 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 09:19:11,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 09:19:11,721 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 09:19:11,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:11,721 INFO L85 PathProgramCache]: Analyzing trace with hash 618600592, now seen corresponding path program 1 times [2021-10-28 09:19:11,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:11,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309761473] [2021-10-28 09:19:11,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:11,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:12,249 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 09:19:12,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:12,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309761473] [2021-10-28 09:19:12,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309761473] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:12,250 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:12,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 09:19:12,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356838214] [2021-10-28 09:19:12,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 09:19:12,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:12,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 09:19:12,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:19:12,252 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 09:19:13,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:13,006 INFO L93 Difference]: Finished difference Result 240 states and 282 transitions. [2021-10-28 09:19:13,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 09:19:13,007 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 09:19:13,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:13,008 INFO L225 Difference]: With dead ends: 240 [2021-10-28 09:19:13,009 INFO L226 Difference]: Without dead ends: 202 [2021-10-28 09:19:13,009 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 09:19:13,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-28 09:19:13,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 188. [2021-10-28 09:19:13,034 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 09:19:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 224 transitions. [2021-10-28 09:19:13,036 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 224 transitions. Word has length 33 [2021-10-28 09:19:13,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:13,038 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 224 transitions. [2021-10-28 09:19:13,039 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 09:19:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 224 transitions. [2021-10-28 09:19:13,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-28 09:19:13,046 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:13,046 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 09:19:13,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 09:19:13,047 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 09:19:13,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:13,050 INFO L85 PathProgramCache]: Analyzing trace with hash -358402595, now seen corresponding path program 1 times [2021-10-28 09:19:13,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:13,050 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238215485] [2021-10-28 09:19:13,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:13,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:13,473 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 09:19:13,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:13,473 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238215485] [2021-10-28 09:19:13,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238215485] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:13,473 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:13,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:19:13,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658164610] [2021-10-28 09:19:13,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:19:13,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:13,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:19:13,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:19:13,475 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 09:19:13,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:13,538 INFO L93 Difference]: Finished difference Result 239 states and 285 transitions. [2021-10-28 09:19:13,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:19:13,540 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 09:19:13,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:13,542 INFO L225 Difference]: With dead ends: 239 [2021-10-28 09:19:13,542 INFO L226 Difference]: Without dead ends: 213 [2021-10-28 09:19:13,542 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 09:19:13,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-10-28 09:19:13,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2021-10-28 09:19:13,564 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 09:19:13,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 230 transitions. [2021-10-28 09:19:13,566 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 230 transitions. Word has length 33 [2021-10-28 09:19:13,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:13,568 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 230 transitions. [2021-10-28 09:19:13,568 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 09:19:13,568 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 230 transitions. [2021-10-28 09:19:13,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-28 09:19:13,572 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:13,572 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 09:19:13,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 09:19:13,573 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 09:19:13,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:13,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1248189667, now seen corresponding path program 1 times [2021-10-28 09:19:13,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:13,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122987605] [2021-10-28 09:19:13,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:13,574 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:14,163 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 09:19:14,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:14,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122987605] [2021-10-28 09:19:14,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122987605] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:14,163 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:14,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 09:19:14,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058612721] [2021-10-28 09:19:14,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 09:19:14,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:14,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 09:19:14,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:19:14,165 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 09:19:15,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:15,583 INFO L93 Difference]: Finished difference Result 308 states and 350 transitions. [2021-10-28 09:19:15,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-28 09:19:15,584 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 09:19:15,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:15,587 INFO L225 Difference]: With dead ends: 308 [2021-10-28 09:19:15,588 INFO L226 Difference]: Without dead ends: 294 [2021-10-28 09:19:15,588 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2021-10-28 09:19:15,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-10-28 09:19:15,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 220. [2021-10-28 09:19:15,599 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 09:19:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 258 transitions. [2021-10-28 09:19:15,601 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 258 transitions. Word has length 34 [2021-10-28 09:19:15,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:15,601 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 258 transitions. [2021-10-28 09:19:15,601 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 09:19:15,601 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 258 transitions. [2021-10-28 09:19:15,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-28 09:19:15,603 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:15,603 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 09:19:15,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 09:19:15,603 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 09:19:15,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:15,604 INFO L85 PathProgramCache]: Analyzing trace with hash 513264780, now seen corresponding path program 1 times [2021-10-28 09:19:15,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:15,604 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917416854] [2021-10-28 09:19:15,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:15,605 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:16,074 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 09:19:16,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:16,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917416854] [2021-10-28 09:19:16,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917416854] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:16,075 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:16,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:19:16,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582409700] [2021-10-28 09:19:16,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:19:16,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:16,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:19:16,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:19:16,077 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 09:19:16,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:16,284 INFO L93 Difference]: Finished difference Result 252 states and 295 transitions. [2021-10-28 09:19:16,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:19:16,313 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 09:19:16,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:16,315 INFO L225 Difference]: With dead ends: 252 [2021-10-28 09:19:16,315 INFO L226 Difference]: Without dead ends: 222 [2021-10-28 09:19:16,316 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:19:16,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-10-28 09:19:16,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 190. [2021-10-28 09:19:16,329 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 09:19:16,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 221 transitions. [2021-10-28 09:19:16,330 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 221 transitions. Word has length 35 [2021-10-28 09:19:16,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:16,331 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 221 transitions. [2021-10-28 09:19:16,331 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 09:19:16,331 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 221 transitions. [2021-10-28 09:19:16,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 09:19:16,332 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:16,332 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 09:19:16,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 09:19:16,333 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 09:19:16,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:16,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1203766261, now seen corresponding path program 1 times [2021-10-28 09:19:16,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:16,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150708378] [2021-10-28 09:19:16,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:16,334 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:16,799 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 09:19:16,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:16,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150708378] [2021-10-28 09:19:16,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150708378] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:16,800 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:16,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:19:16,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258734933] [2021-10-28 09:19:16,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 09:19:16,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:16,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 09:19:16,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:19:16,802 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 09:19:17,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:17,420 INFO L93 Difference]: Finished difference Result 228 states and 262 transitions. [2021-10-28 09:19:17,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 09:19:17,421 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 09:19:17,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:17,422 INFO L225 Difference]: With dead ends: 228 [2021-10-28 09:19:17,422 INFO L226 Difference]: Without dead ends: 198 [2021-10-28 09:19:17,423 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2021-10-28 09:19:17,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-28 09:19:17,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 190. [2021-10-28 09:19:17,432 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 09:19:17,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 220 transitions. [2021-10-28 09:19:17,433 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 220 transitions. Word has length 36 [2021-10-28 09:19:17,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:17,434 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 220 transitions. [2021-10-28 09:19:17,434 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 09:19:17,434 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 220 transitions. [2021-10-28 09:19:17,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-28 09:19:17,435 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:17,435 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 09:19:17,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 09:19:17,436 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 09:19:17,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:17,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1546392854, now seen corresponding path program 1 times [2021-10-28 09:19:17,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:17,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597464083] [2021-10-28 09:19:17,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:17,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:17,815 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 09:19:17,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:17,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597464083] [2021-10-28 09:19:17,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597464083] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:17,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:17,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:19:17,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222905272] [2021-10-28 09:19:17,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:19:17,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:17,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:19:17,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:19:17,818 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 09:19:17,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:17,991 INFO L93 Difference]: Finished difference Result 281 states and 326 transitions. [2021-10-28 09:19:17,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:19:17,992 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 09:19:17,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:17,994 INFO L225 Difference]: With dead ends: 281 [2021-10-28 09:19:17,994 INFO L226 Difference]: Without dead ends: 258 [2021-10-28 09:19:17,994 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 09:19:17,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-10-28 09:19:18,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 194. [2021-10-28 09:19:18,007 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 09:19:18,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 226 transitions. [2021-10-28 09:19:18,008 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 226 transitions. Word has length 37 [2021-10-28 09:19:18,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:18,009 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 226 transitions. [2021-10-28 09:19:18,009 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 09:19:18,009 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 226 transitions. [2021-10-28 09:19:18,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-28 09:19:18,010 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:18,011 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 09:19:18,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 09:19:18,011 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 09:19:18,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:18,012 INFO L85 PathProgramCache]: Analyzing trace with hash -865834336, now seen corresponding path program 1 times [2021-10-28 09:19:18,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:18,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839583888] [2021-10-28 09:19:18,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:18,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:18,625 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 09:19:18,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:18,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839583888] [2021-10-28 09:19:18,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839583888] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:18,626 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:18,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 09:19:18,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727852728] [2021-10-28 09:19:18,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 09:19:18,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:18,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 09:19:18,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:19:18,628 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 09:19:19,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:19,843 INFO L93 Difference]: Finished difference Result 261 states and 292 transitions. [2021-10-28 09:19:19,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-28 09:19:19,845 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 09:19:19,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:19,847 INFO L225 Difference]: With dead ends: 261 [2021-10-28 09:19:19,847 INFO L226 Difference]: Without dead ends: 231 [2021-10-28 09:19:19,848 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2021-10-28 09:19:19,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-10-28 09:19:19,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 194. [2021-10-28 09:19:19,858 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 09:19:19,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 225 transitions. [2021-10-28 09:19:19,859 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 225 transitions. Word has length 37 [2021-10-28 09:19:19,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:19,860 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 225 transitions. [2021-10-28 09:19:19,861 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 09:19:19,861 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 225 transitions. [2021-10-28 09:19:19,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 09:19:19,862 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:19,862 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 09:19:19,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 09:19:19,863 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 09:19:19,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:19,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1604639621, now seen corresponding path program 1 times [2021-10-28 09:19:19,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:19,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927235148] [2021-10-28 09:19:19,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:19,866 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:20,401 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 09:19:20,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:20,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927235148] [2021-10-28 09:19:20,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927235148] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:20,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:20,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 09:19:20,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208440856] [2021-10-28 09:19:20,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 09:19:20,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:20,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 09:19:20,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:19:20,407 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 09:19:21,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:21,215 INFO L93 Difference]: Finished difference Result 276 states and 320 transitions. [2021-10-28 09:19:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:19:21,215 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 09:19:21,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:21,217 INFO L225 Difference]: With dead ends: 276 [2021-10-28 09:19:21,217 INFO L226 Difference]: Without dead ends: 230 [2021-10-28 09:19:21,218 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-10-28 09:19:21,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-10-28 09:19:21,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 194. [2021-10-28 09:19:21,227 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 09:19:21,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 223 transitions. [2021-10-28 09:19:21,228 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 223 transitions. Word has length 39 [2021-10-28 09:19:21,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:21,229 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 223 transitions. [2021-10-28 09:19:21,229 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 09:19:21,229 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 223 transitions. [2021-10-28 09:19:21,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-28 09:19:21,230 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:21,230 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 09:19:21,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 09:19:21,231 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 09:19:21,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:21,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1876182655, now seen corresponding path program 1 times [2021-10-28 09:19:21,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:21,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680539517] [2021-10-28 09:19:21,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:21,232 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:19:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:19:38,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 09:19:38,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:19:38,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680539517] [2021-10-28 09:19:38,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680539517] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:19:38,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:19:38,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-10-28 09:19:38,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88301032] [2021-10-28 09:19:38,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-28 09:19:38,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:19:38,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-28 09:19:38,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-10-28 09:19:38,520 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 09:19:57,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:19:57,488 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2021-10-28 09:19:57,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-28 09:19:57,488 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 09:19:57,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:19:57,490 INFO L225 Difference]: With dead ends: 238 [2021-10-28 09:19:57,490 INFO L226 Difference]: Without dead ends: 236 [2021-10-28 09:19:57,491 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=289, Invalid=833, Unknown=0, NotChecked=0, Total=1122 [2021-10-28 09:19:57,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-10-28 09:19:57,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 196. [2021-10-28 09:19:57,504 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 09:19:57,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 225 transitions. [2021-10-28 09:19:57,505 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 225 transitions. Word has length 40 [2021-10-28 09:19:57,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:19:57,505 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 225 transitions. [2021-10-28 09:19:57,506 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 09:19:57,506 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 225 transitions. [2021-10-28 09:19:57,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-28 09:19:57,506 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:19:57,507 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 09:19:57,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 09:19:57,507 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 09:19:57,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:19:57,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1569116892, now seen corresponding path program 1 times [2021-10-28 09:19:57,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:19:57,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964479270] [2021-10-28 09:19:57,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:19:57,508 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:20:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:20:03,521 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 09:20:03,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:20:03,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964479270] [2021-10-28 09:20:03,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964479270] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:20:03,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:20:03,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 09:20:03,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795159282] [2021-10-28 09:20:03,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 09:20:03,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:20:03,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 09:20:03,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:20:03,524 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 09:20:18,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:20:18,242 INFO L93 Difference]: Finished difference Result 254 states and 289 transitions. [2021-10-28 09:20:18,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-28 09:20:18,243 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 09:20:18,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:20:18,244 INFO L225 Difference]: With dead ends: 254 [2021-10-28 09:20:18,245 INFO L226 Difference]: Without dead ends: 208 [2021-10-28 09:20:18,245 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2021-10-28 09:20:18,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-10-28 09:20:18,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 196. [2021-10-28 09:20:18,258 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 09:20:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 223 transitions. [2021-10-28 09:20:18,259 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 223 transitions. Word has length 41 [2021-10-28 09:20:18,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:20:18,259 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 223 transitions. [2021-10-28 09:20:18,260 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 09:20:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 223 transitions. [2021-10-28 09:20:18,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-28 09:20:18,261 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:20:18,261 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 09:20:18,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 09:20:18,261 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 09:20:18,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:20:18,262 INFO L85 PathProgramCache]: Analyzing trace with hash 664052998, now seen corresponding path program 1 times [2021-10-28 09:20:18,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:20:18,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661511754] [2021-10-28 09:20:18,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:20:18,263 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:20:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:20:23,497 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 09:20:23,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:20:23,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661511754] [2021-10-28 09:20:23,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661511754] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:20:23,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:20:23,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 09:20:23,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390413951] [2021-10-28 09:20:23,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 09:20:23,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:20:23,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 09:20:23,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:20:23,500 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 09:20:37,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:20:37,839 INFO L93 Difference]: Finished difference Result 204 states and 229 transitions. [2021-10-28 09:20:37,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 09:20:37,840 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 09:20:37,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:20:37,841 INFO L225 Difference]: With dead ends: 204 [2021-10-28 09:20:37,841 INFO L226 Difference]: Without dead ends: 130 [2021-10-28 09:20:37,842 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-10-28 09:20:37,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-10-28 09:20:37,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 94. [2021-10-28 09:20:37,849 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 09:20:37,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2021-10-28 09:20:37,850 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 42 [2021-10-28 09:20:37,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:20:37,850 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2021-10-28 09:20:37,851 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 09:20:37,851 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2021-10-28 09:20:37,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-28 09:20:37,851 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:20:37,852 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 09:20:37,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 09:20:37,852 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 09:20:37,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:20:37,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1320231428, now seen corresponding path program 1 times [2021-10-28 09:20:37,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:20:37,853 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806181465] [2021-10-28 09:20:37,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:20:37,853 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:21:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:21:04,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 09:21:04,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:21:04,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806181465] [2021-10-28 09:21:04,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806181465] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:21:04,558 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:21:04,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-28 09:21:04,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304059144] [2021-10-28 09:21:04,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-28 09:21:04,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:21:04,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-28 09:21:04,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-10-28 09:21:04,561 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 09:21:26,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:21:26,452 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2021-10-28 09:21:26,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-28 09:21:26,452 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 09:21:26,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:21:26,453 INFO L225 Difference]: With dead ends: 130 [2021-10-28 09:21:26,453 INFO L226 Difference]: Without dead ends: 92 [2021-10-28 09:21:26,454 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2021-10-28 09:21:26,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-10-28 09:21:26,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2021-10-28 09:21:26,459 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 09:21:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2021-10-28 09:21:26,460 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 44 [2021-10-28 09:21:26,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:21:26,460 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-10-28 09:21:26,460 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 09:21:26,460 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2021-10-28 09:21:26,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-28 09:21:26,461 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:21:26,461 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 09:21:26,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 09:21:26,462 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 09:21:26,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:21:26,462 INFO L85 PathProgramCache]: Analyzing trace with hash -2088300975, now seen corresponding path program 1 times [2021-10-28 09:21:26,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:21:26,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478178160] [2021-10-28 09:21:26,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:21:26,463 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:21:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:21:26,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 09:21:26,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:21:26,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478178160] [2021-10-28 09:21:26,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478178160] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:21:26,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:21:26,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:21:26,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105018677] [2021-10-28 09:21:26,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:21:26,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:21:26,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:21:26,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:21:26,800 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 09:21:26,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:21:26,967 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2021-10-28 09:21:26,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:21:26,967 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 09:21:26,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:21:26,968 INFO L225 Difference]: With dead ends: 92 [2021-10-28 09:21:26,968 INFO L226 Difference]: Without dead ends: 56 [2021-10-28 09:21:26,968 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 09:21:26,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-10-28 09:21:26,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-10-28 09:21:26,971 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 09:21:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2021-10-28 09:21:26,972 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2021-10-28 09:21:26,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:21:26,972 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2021-10-28 09:21:26,972 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 09:21:26,972 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2021-10-28 09:21:26,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-28 09:21:26,973 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:21:26,973 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 09:21:26,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 09:21:26,973 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 09:21:26,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:21:26,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1768480620, now seen corresponding path program 1 times [2021-10-28 09:21:26,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:21:26,974 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790849792] [2021-10-28 09:21:26,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:21:26,974 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:21:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:21:32,889 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 09:21:32,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:21:32,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790849792] [2021-10-28 09:21:32,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790849792] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:21:32,889 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:21:32,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-28 09:21:32,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410266029] [2021-10-28 09:21:32,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-28 09:21:32,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:21:32,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-28 09:21:32,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-10-28 09:21:32,891 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 09:21:49,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:21:49,377 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2021-10-28 09:21:49,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 09:21:49,378 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 09:21:49,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:21:49,378 INFO L225 Difference]: With dead ends: 56 [2021-10-28 09:21:49,378 INFO L226 Difference]: Without dead ends: 0 [2021-10-28 09:21:49,378 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2021-10-28 09:21:49,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-28 09:21:49,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-28 09:21:49,379 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 09:21:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-28 09:21:49,380 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2021-10-28 09:21:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:21:49,380 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-28 09:21:49,380 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 09:21:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-28 09:21:49,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-28 09:21:49,383 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:21:49,384 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:21:49,385 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:21:49,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 09:21:49,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-28 09:21:49,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:21:49,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:21:49,675 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:21:49,678 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:21:49,814 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:21:49,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:21:49,819 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:21:49,831 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:21:49,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:21:49,861 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:21:49,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:21:49,865 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:21:56,308 WARN L207 SmtUtils]: Spent 5.19 s on a formula simplification. DAG size of input: 188 DAG size of output: 135 [2021-10-28 09:22:02,067 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 09:22:02,067 INFO L857 garLoopResultBuilder]: For program point L7129-2(lines 7129 7131) no Hoare annotation was computed. [2021-10-28 09:22:02,068 INFO L857 garLoopResultBuilder]: For program point L7129(lines 7129 7131) no Hoare annotation was computed. [2021-10-28 09:22:02,068 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-28 09:22:02,068 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-28 09:22:02,068 INFO L857 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:22:02,068 INFO L857 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:22:02,068 INFO L857 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:22:02,069 INFO L857 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:22:02,069 INFO L857 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:22:02,069 INFO L857 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:22:02,069 INFO L857 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:22:02,069 INFO L857 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:22:02,069 INFO L857 garLoopResultBuilder]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2021-10-28 09:22:02,069 INFO L857 garLoopResultBuilder]: For program point L210-9(lines 7686 7690) no Hoare annotation was computed. [2021-10-28 09:22:02,070 INFO L857 garLoopResultBuilder]: For program point L6900-2(lines 6900 6902) no Hoare annotation was computed. [2021-10-28 09:22:02,070 INFO L857 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-10-28 09:22:02,070 INFO L857 garLoopResultBuilder]: For program point L6900(lines 6900 6902) no Hoare annotation was computed. [2021-10-28 09:22:02,070 INFO L857 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-10-28 09:22:02,070 INFO L857 garLoopResultBuilder]: For program point L6900-6(lines 6900 6902) no Hoare annotation was computed. [2021-10-28 09:22:02,070 INFO L857 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-10-28 09:22:02,070 INFO L857 garLoopResultBuilder]: For program point L6900-4(lines 6900 6902) no Hoare annotation was computed. [2021-10-28 09:22:02,071 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 09:22:02,071 INFO L857 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-10-28 09:22:02,071 INFO L857 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-10-28 09:22:02,071 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 09:22:02,071 INFO L860 garLoopResultBuilder]: At program point L9006(line 9006) the Hoare annotation is: true [2021-10-28 09:22:02,072 INFO L857 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-10-28 09:22:02,072 INFO L857 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-10-28 09:22:02,072 INFO L853 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: (= |~#s_tolower_table~0.offset| 0) [2021-10-28 09:22:02,072 INFO L857 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-10-28 09:22:02,072 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 09:22:02,072 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 09:22:02,072 INFO L857 garLoopResultBuilder]: For program point L211-16(line 211) no Hoare annotation was computed. [2021-10-28 09:22:02,072 INFO L857 garLoopResultBuilder]: For program point L211-18(line 211) no Hoare annotation was computed. [2021-10-28 09:22:02,073 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 09:22:02,073 INFO L857 garLoopResultBuilder]: For program point L7694-4(lines 7694 7700) no Hoare annotation was computed. [2021-10-28 09:22:02,073 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 09:22:02,073 INFO L857 garLoopResultBuilder]: For program point L7694-2(lines 7694 7700) no Hoare annotation was computed. [2021-10-28 09:22:02,073 INFO L857 garLoopResultBuilder]: For program point L8999(lines 8967 9005) no Hoare annotation was computed. [2021-10-28 09:22:02,073 INFO L857 garLoopResultBuilder]: For program point L8975-2(lines 8975 8981) no Hoare annotation was computed. [2021-10-28 09:22:02,074 INFO L857 garLoopResultBuilder]: For program point L7695(lines 7695 7699) no Hoare annotation was computed. [2021-10-28 09:22:02,074 INFO L857 garLoopResultBuilder]: For program point L8975(lines 8975 8981) no Hoare annotation was computed. [2021-10-28 09:22:02,074 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 09:22:02,074 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 09:22:02,075 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 09:22:02,075 INFO L857 garLoopResultBuilder]: For program point L8967(lines 8967 9005) no Hoare annotation was computed. [2021-10-28 09:22:02,075 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 09:22:02,075 INFO L857 garLoopResultBuilder]: For program point L7134(lines 7134 7140) no Hoare annotation was computed. [2021-10-28 09:22:02,075 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-28 09:22:02,075 INFO L857 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-10-28 09:22:02,075 INFO L857 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-10-28 09:22:02,075 INFO L857 garLoopResultBuilder]: For program point L7134-1(lines 7134 7140) no Hoare annotation was computed. [2021-10-28 09:22:02,075 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 09:22:02,076 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-28 09:22:02,076 INFO L857 garLoopResultBuilder]: For program point L7135(lines 7135 7139) no Hoare annotation was computed. [2021-10-28 09:22:02,076 INFO L857 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-10-28 09:22:02,076 INFO L857 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-10-28 09:22:02,076 INFO L857 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-10-28 09:22:02,076 INFO L857 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-10-28 09:22:02,076 INFO L857 garLoopResultBuilder]: For program point L7135-2(lines 7135 7139) no Hoare annotation was computed. [2021-10-28 09:22:02,076 INFO L857 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-10-28 09:22:02,076 INFO L857 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-10-28 09:22:02,076 INFO L857 garLoopResultBuilder]: For program point L9002(lines 9002 9004) no Hoare annotation was computed. [2021-10-28 09:22:02,076 INFO L857 garLoopResultBuilder]: For program point L8994(lines 8994 8996) no Hoare annotation was computed. [2021-10-28 09:22:02,076 INFO L857 garLoopResultBuilder]: For program point L8994-1(lines 8967 9005) no Hoare annotation was computed. [2021-10-28 09:22:02,077 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-10-28 09:22:02,080 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 09:22:02,081 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 09:22:02,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 09:22:02 BoogieIcfgContainer [2021-10-28 09:22:02,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 09:22:02,151 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 09:22:02,151 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 09:22:02,151 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 09:22:02,152 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:19:07" (3/4) ... [2021-10-28 09:22:02,155 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-28 09:22:02,177 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 131 nodes and edges [2021-10-28 09:22:02,179 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2021-10-28 09:22:02,181 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-10-28 09:22:02,182 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-10-28 09:22:02,184 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-10-28 09:22:02,186 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-28 09:22:02,187 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-28 09:22:02,189 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 09:22:02,221 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 09:22:02,221 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 09:22:02,221 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 09:22:02,222 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 09:22:02,222 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 09:22:02,222 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 09:22:02,223 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 09:22:02,223 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 09:22:02,224 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 09:22:02,224 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 09:22:03,144 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250cd78c-0e06-47e5-a94d-9a4de98226f4/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 09:22:03,144 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 09:22:03,145 INFO L168 Benchmark]: Toolchain (without parser) took 189871.49 ms. Allocated memory was 92.3 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 64.4 MB in the beginning and 940.7 MB in the end (delta: -876.3 MB). Peak memory consumption was 912.0 MB. Max. memory is 16.1 GB. [2021-10-28 09:22:03,145 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 92.3 MB. Free memory is still 71.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:22:03,146 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2870.25 ms. Allocated memory was 92.3 MB in the beginning and 117.4 MB in the end (delta: 25.2 MB). Free memory was 64.4 MB in the beginning and 67.7 MB in the end (delta: -3.2 MB). Peak memory consumption was 58.4 MB. Max. memory is 16.1 GB. [2021-10-28 09:22:03,146 INFO L168 Benchmark]: Boogie Procedure Inliner took 255.15 ms. Allocated memory is still 117.4 MB. Free memory was 67.7 MB in the beginning and 56.0 MB in the end (delta: 11.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-28 09:22:03,147 INFO L168 Benchmark]: Boogie Preprocessor took 149.44 ms. Allocated memory is still 117.4 MB. Free memory was 56.0 MB in the beginning and 48.1 MB in the end (delta: 7.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 09:22:03,147 INFO L168 Benchmark]: RCFGBuilder took 10990.40 ms. Allocated memory was 117.4 MB in the beginning and 337.6 MB in the end (delta: 220.2 MB). Free memory was 48.1 MB in the beginning and 97.0 MB in the end (delta: -48.9 MB). Peak memory consumption was 187.8 MB. Max. memory is 16.1 GB. [2021-10-28 09:22:03,147 INFO L168 Benchmark]: TraceAbstraction took 174605.72 ms. Allocated memory was 337.6 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 97.0 MB in the beginning and 915.3 MB in the end (delta: -818.3 MB). Peak memory consumption was 271.2 MB. Max. memory is 16.1 GB. [2021-10-28 09:22:03,148 INFO L168 Benchmark]: Witness Printer took 993.24 ms. Allocated memory is still 1.4 GB. Free memory was 915.3 MB in the beginning and 940.7 MB in the end (delta: -25.4 MB). Peak memory consumption was 429.7 MB. Max. memory is 16.1 GB. [2021-10-28 09:22:03,149 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.25 ms. Allocated memory is still 92.3 MB. Free memory is still 71.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 2870.25 ms. Allocated memory was 92.3 MB in the beginning and 117.4 MB in the end (delta: 25.2 MB). Free memory was 64.4 MB in the beginning and 67.7 MB in the end (delta: -3.2 MB). Peak memory consumption was 58.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 255.15 ms. Allocated memory is still 117.4 MB. Free memory was 67.7 MB in the beginning and 56.0 MB in the end (delta: 11.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 149.44 ms. Allocated memory is still 117.4 MB. Free memory was 56.0 MB in the beginning and 48.1 MB in the end (delta: 7.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 10990.40 ms. Allocated memory was 117.4 MB in the beginning and 337.6 MB in the end (delta: 220.2 MB). Free memory was 48.1 MB in the beginning and 97.0 MB in the end (delta: -48.9 MB). Peak memory consumption was 187.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 174605.72 ms. Allocated memory was 337.6 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 97.0 MB in the beginning and 915.3 MB in the end (delta: -818.3 MB). Peak memory consumption was 271.2 MB. Max. memory is 16.1 GB. * Witness Printer took 993.24 ms. Allocated memory is still 1.4 GB. Free memory was 915.3 MB in the beginning and 940.7 MB in the end (delta: -25.4 MB). Peak memory consumption was 429.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: 174.4s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 93.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1328 SDtfs, 4025 SDslu, 5646 SDs, 0 SdLazy, 2225 SolverSat, 156 SolverUnsat, 35 SolverUnknown, 0 SolverNotchecked, 76.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 13.8s 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.4s HoareSimplificationTime, 12 FomulaSimplificationsInter, 6251 FormulaSimplificationTreeSizeReductionInter, 12.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 57.3s SatisfiabilityAnalysisTime, 10.2s 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 09:22:03,259 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_250cd78c-0e06-47e5-a94d-9a4de98226f4/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...