./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa --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 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 20:49:21,620 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 20:49:21,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 20:49:21,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 20:49:21,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 20:49:21,653 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 20:49:21,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 20:49:21,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 20:49:21,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 20:49:21,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 20:49:21,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 20:49:21,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 20:49:21,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 20:49:21,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 20:49:21,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 20:49:21,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 20:49:21,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 20:49:21,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 20:49:21,670 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 20:49:21,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 20:49:21,673 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 20:49:21,674 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 20:49:21,675 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 20:49:21,676 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 20:49:21,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 20:49:21,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 20:49:21,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 20:49:21,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 20:49:21,680 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 20:49:21,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 20:49:21,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 20:49:21,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 20:49:21,682 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 20:49:21,683 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 20:49:21,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 20:49:21,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 20:49:21,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 20:49:21,684 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 20:49:21,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 20:49:21,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 20:49:21,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 20:49:21,686 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-06 20:49:21,702 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 20:49:21,703 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 20:49:21,703 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 20:49:21,703 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 20:49:21,703 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 20:49:21,704 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 20:49:21,704 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 20:49:21,704 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 20:49:21,704 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 20:49:21,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 20:49:21,705 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 20:49:21,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 20:49:21,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 20:49:21,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 20:49:21,705 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 20:49:21,705 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 20:49:21,705 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 20:49:21,705 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 20:49:21,706 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 20:49:21,706 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 20:49:21,706 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 20:49:21,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 20:49:21,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 20:49:21,706 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 20:49:21,706 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 20:49:21,706 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 20:49:21,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 20:49:21,707 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 20:49:21,707 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 20:49:21,707 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 20:49:21,707 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 20:49:21,707 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_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/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_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa 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 -> 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 [2021-12-06 20:49:21,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 20:49:21,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 20:49:21,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 20:49:21,898 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 20:49:21,899 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 20:49:21,900 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2021-12-06 20:49:21,942 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/data/e13ff89c0/d4078eb6861f4c259db509f6307c50e2/FLAG9d176d420 [2021-12-06 20:49:22,497 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 20:49:22,498 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2021-12-06 20:49:22,520 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/data/e13ff89c0/d4078eb6861f4c259db509f6307c50e2/FLAG9d176d420 [2021-12-06 20:49:22,975 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/data/e13ff89c0/d4078eb6861f4c259db509f6307c50e2 [2021-12-06 20:49:22,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 20:49:22,979 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 20:49:22,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 20:49:22,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 20:49:22,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 20:49:22,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 08:49:22" (1/1) ... [2021-12-06 20:49:22,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fb19dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:49:22, skipping insertion in model container [2021-12-06 20:49:22,989 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 08:49:22" (1/1) ... [2021-12-06 20:49:22,994 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 20:49:23,072 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 20:49:23,286 WARN L230 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_9431d67c-59f1-488d-9781-c87af3d2c561/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2021-12-06 20:49:23,293 WARN L230 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_9431d67c-59f1-488d-9781-c87af3d2c561/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2021-12-06 20:49:24,009 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:49:24,010 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:49:24,010 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:49:24,011 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:49:24,011 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:49:24,021 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:49:24,021 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:49:24,022 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:49:24,023 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:49:24,310 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-06 20:49:24,311 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-06 20:49:24,312 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-06 20:49:24,313 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-06 20:49:24,314 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-06 20:49:24,314 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-06 20:49:24,315 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-06 20:49:24,315 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-06 20:49:24,316 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-06 20:49:24,316 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-06 20:49:24,454 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-06 20:49:24,525 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:49:24,525 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:49:24,580 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 20:49:24,629 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 20:49:24,642 WARN L230 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_9431d67c-59f1-488d-9781-c87af3d2c561/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2021-12-06 20:49:24,643 WARN L230 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_9431d67c-59f1-488d-9781-c87af3d2c561/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2021-12-06 20:49:24,674 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:49:24,675 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:49:24,675 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:49:24,676 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:49:24,676 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:49:24,682 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:49:24,683 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:49:24,684 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:49:24,684 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:49:24,714 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-06 20:49:24,715 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-06 20:49:24,715 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-06 20:49:24,716 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-06 20:49:24,717 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-06 20:49:24,717 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-06 20:49:24,718 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-06 20:49:24,718 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-06 20:49:24,718 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-06 20:49:24,719 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-06 20:49:24,747 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-06 20:49:24,799 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:49:24,799 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-06 20:49:24,826 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 20:49:25,045 INFO L208 MainTranslator]: Completed translation [2021-12-06 20:49:25,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:49:25 WrapperNode [2021-12-06 20:49:25,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 20:49:25,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 20:49:25,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 20:49:25,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 20:49:25,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:49:25" (1/1) ... [2021-12-06 20:49:25,128 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:49:25" (1/1) ... [2021-12-06 20:49:25,190 INFO L137 Inliner]: procedures = 690, calls = 2614, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 794 [2021-12-06 20:49:25,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 20:49:25,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 20:49:25,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 20:49:25,191 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 20:49:25,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:49:25" (1/1) ... [2021-12-06 20:49:25,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:49:25" (1/1) ... [2021-12-06 20:49:25,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:49:25" (1/1) ... [2021-12-06 20:49:25,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:49:25" (1/1) ... [2021-12-06 20:49:25,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:49:25" (1/1) ... [2021-12-06 20:49:25,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:49:25" (1/1) ... [2021-12-06 20:49:25,247 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:49:25" (1/1) ... [2021-12-06 20:49:25,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 20:49:25,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 20:49:25,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 20:49:25,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 20:49:25,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:49:25" (1/1) ... [2021-12-06 20:49:25,264 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 20:49:25,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:49:25,287 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 20:49:25,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 20:49:25,331 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2021-12-06 20:49:25,331 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2021-12-06 20:49:25,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 20:49:25,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-06 20:49:25,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-06 20:49:25,331 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-06 20:49:25,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 20:49:25,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 20:49:25,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 20:49:25,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 20:49:25,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 20:49:25,332 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-06 20:49:25,332 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-06 20:49:25,332 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-06 20:49:25,332 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-06 20:49:25,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 20:49:25,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 20:49:25,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-06 20:49:25,333 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-06 20:49:25,333 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-06 20:49:25,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 20:49:25,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 20:49:25,489 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 20:49:25,490 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 20:49:26,339 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 20:49:26,344 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 20:49:26,344 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-06 20:49:26,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:49:26 BoogieIcfgContainer [2021-12-06 20:49:26,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 20:49:26,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 20:49:26,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 20:49:26,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 20:49:26,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 08:49:22" (1/3) ... [2021-12-06 20:49:26,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582b990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 08:49:26, skipping insertion in model container [2021-12-06 20:49:26,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:49:25" (2/3) ... [2021-12-06 20:49:26,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582b990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 08:49:26, skipping insertion in model container [2021-12-06 20:49:26,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:49:26" (3/3) ... [2021-12-06 20:49:26,351 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_empty_array_harness.i [2021-12-06 20:49:26,355 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 20:49:26,355 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 20:49:26,390 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 20:49:26,395 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-12-06 20:49:26,395 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 20:49:26,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 50 states have (on average 1.26) internal successors, (63), 51 states have internal predecessors, (63), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-06 20:49:26,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-06 20:49:26,414 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:26,414 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:26,415 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:26,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:26,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1597769755, now seen corresponding path program 1 times [2021-12-06 20:49:26,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:26,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690415392] [2021-12-06 20:49:26,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:26,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:26,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:26,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:26,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:26,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:26,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 20:49:26,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:26,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690415392] [2021-12-06 20:49:26,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690415392] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:26,863 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:26,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 20:49:26,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543448935] [2021-12-06 20:49:26,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:26,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:49:26,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:26,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:49:26,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 20:49:26,890 INFO L87 Difference]: Start difference. First operand has 71 states, 50 states have (on average 1.26) internal successors, (63), 51 states have internal predecessors, (63), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:49:26,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:26,993 INFO L93 Difference]: Finished difference Result 137 states and 186 transitions. [2021-12-06 20:49:26,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:49:26,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2021-12-06 20:49:26,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:27,001 INFO L225 Difference]: With dead ends: 137 [2021-12-06 20:49:27,002 INFO L226 Difference]: Without dead ends: 64 [2021-12-06 20:49:27,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 20:49:27,007 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:27,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 109 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:49:27,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-06 20:49:27,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-12-06 20:49:27,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 45 states have internal predecessors, (53), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-06 20:49:27,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2021-12-06 20:49:27,039 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 31 [2021-12-06 20:49:27,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:27,040 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2021-12-06 20:49:27,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:49:27,040 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2021-12-06 20:49:27,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-06 20:49:27,041 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:27,041 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:27,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 20:49:27,042 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:27,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:27,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1816677797, now seen corresponding path program 1 times [2021-12-06 20:49:27,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:27,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245316582] [2021-12-06 20:49:27,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:27,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:27,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:27,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:27,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:27,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:27,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 20:49:27,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:27,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245316582] [2021-12-06 20:49:27,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245316582] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:27,265 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:27,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 20:49:27,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389438885] [2021-12-06 20:49:27,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:27,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 20:49:27,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:27,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 20:49:27,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:49:27,267 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:49:27,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:27,432 INFO L93 Difference]: Finished difference Result 117 states and 146 transitions. [2021-12-06 20:49:27,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 20:49:27,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2021-12-06 20:49:27,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:27,435 INFO L225 Difference]: With dead ends: 117 [2021-12-06 20:49:27,435 INFO L226 Difference]: Without dead ends: 67 [2021-12-06 20:49:27,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:49:27,438 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 58 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:27,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 163 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:49:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-06 20:49:27,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-12-06 20:49:27,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 48 states have internal predecessors, (55), 14 states have call successors, (14), 5 states have call predecessors, (14), 6 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2021-12-06 20:49:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2021-12-06 20:49:27,452 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 31 [2021-12-06 20:49:27,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:27,453 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2021-12-06 20:49:27,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:49:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2021-12-06 20:49:27,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-06 20:49:27,454 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:27,455 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:27,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 20:49:27,455 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:27,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:27,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1185357712, now seen corresponding path program 1 times [2021-12-06 20:49:27,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:27,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559940740] [2021-12-06 20:49:27,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:27,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:27,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:27,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:27,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:27,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:27,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 20:49:27,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:27,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559940740] [2021-12-06 20:49:27,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559940740] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:27,752 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:27,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 20:49:27,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642204074] [2021-12-06 20:49:27,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:27,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 20:49:27,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:27,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 20:49:27,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 20:49:27,753 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:49:27,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:27,988 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2021-12-06 20:49:27,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 20:49:27,989 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2021-12-06 20:49:27,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:27,990 INFO L225 Difference]: With dead ends: 79 [2021-12-06 20:49:27,991 INFO L226 Difference]: Without dead ends: 77 [2021-12-06 20:49:27,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-12-06 20:49:27,993 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 59 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:27,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 359 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:49:27,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-06 20:49:28,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2021-12-06 20:49:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 55 states have internal predecessors, (61), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2021-12-06 20:49:28,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2021-12-06 20:49:28,006 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 37 [2021-12-06 20:49:28,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:28,006 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2021-12-06 20:49:28,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:49:28,007 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2021-12-06 20:49:28,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-06 20:49:28,008 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:28,008 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:28,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 20:49:28,009 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:28,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:28,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1529203256, now seen corresponding path program 1 times [2021-12-06 20:49:28,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:28,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803493188] [2021-12-06 20:49:28,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:28,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:28,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:28,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:28,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:28,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:28,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 20:49:28,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:28,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803493188] [2021-12-06 20:49:28,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803493188] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:28,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:28,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 20:49:28,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127195511] [2021-12-06 20:49:28,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:28,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 20:49:28,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:28,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 20:49:28,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-06 20:49:28,305 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:49:28,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:28,581 INFO L93 Difference]: Finished difference Result 145 states and 177 transitions. [2021-12-06 20:49:28,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 20:49:28,582 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-06 20:49:28,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:28,583 INFO L225 Difference]: With dead ends: 145 [2021-12-06 20:49:28,583 INFO L226 Difference]: Without dead ends: 88 [2021-12-06 20:49:28,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-12-06 20:49:28,584 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 92 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:28,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 283 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:49:28,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-06 20:49:28,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2021-12-06 20:49:28,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 59 states have internal predecessors, (66), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2021-12-06 20:49:28,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2021-12-06 20:49:28,593 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 41 [2021-12-06 20:49:28,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:28,594 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2021-12-06 20:49:28,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:49:28,594 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2021-12-06 20:49:28,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-06 20:49:28,595 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:28,595 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:28,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 20:49:28,595 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:28,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:28,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1787368694, now seen corresponding path program 1 times [2021-12-06 20:49:28,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:28,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087510547] [2021-12-06 20:49:28,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:28,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:28,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:28,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:28,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:28,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:29,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:49:29,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:29,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087510547] [2021-12-06 20:49:29,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087510547] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:49:29,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302190706] [2021-12-06 20:49:29,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:29,125 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:49:29,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:49:29,126 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:49:29,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 20:49:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:29,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 2418 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-06 20:49:29,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:49:29,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 20:49:29,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 20:49:29,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 20:49:29,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-06 20:49:29,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 20:49:29,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:49:29,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302190706] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:29,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:49:29,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 24 [2021-12-06 20:49:29,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962443865] [2021-12-06 20:49:29,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:29,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 20:49:29,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:29,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 20:49:29,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2021-12-06 20:49:29,994 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:49:30,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:30,069 INFO L93 Difference]: Finished difference Result 173 states and 213 transitions. [2021-12-06 20:49:30,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 20:49:30,069 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-06 20:49:30,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:30,071 INFO L225 Difference]: With dead ends: 173 [2021-12-06 20:49:30,071 INFO L226 Difference]: Without dead ends: 95 [2021-12-06 20:49:30,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2021-12-06 20:49:30,073 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 22 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:30,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 371 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 43 Unchecked, 0.0s Time] [2021-12-06 20:49:30,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-06 20:49:30,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2021-12-06 20:49:30,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 70 states have internal predecessors, (80), 16 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (19), 14 states have call predecessors, (19), 15 states have call successors, (19) [2021-12-06 20:49:30,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2021-12-06 20:49:30,087 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 41 [2021-12-06 20:49:30,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:30,088 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2021-12-06 20:49:30,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:49:30,088 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2021-12-06 20:49:30,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-06 20:49:30,090 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:30,090 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:30,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 20:49:30,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:49:30,291 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:30,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:30,291 INFO L85 PathProgramCache]: Analyzing trace with hash 199020792, now seen corresponding path program 1 times [2021-12-06 20:49:30,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:30,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349628942] [2021-12-06 20:49:30,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:30,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:30,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:30,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:30,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:30,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:30,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 20:49:30,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:30,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349628942] [2021-12-06 20:49:30,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349628942] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:30,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:30,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 20:49:30,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283046252] [2021-12-06 20:49:30,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:30,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 20:49:30,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:30,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 20:49:30,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:49:30,428 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:49:30,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:30,563 INFO L93 Difference]: Finished difference Result 199 states and 254 transitions. [2021-12-06 20:49:30,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 20:49:30,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2021-12-06 20:49:30,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:30,566 INFO L225 Difference]: With dead ends: 199 [2021-12-06 20:49:30,566 INFO L226 Difference]: Without dead ends: 133 [2021-12-06 20:49:30,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:49:30,568 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 66 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:30,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 204 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:49:30,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-06 20:49:30,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 94. [2021-12-06 20:49:30,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 72 states have internal predecessors, (82), 16 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (19), 14 states have call predecessors, (19), 15 states have call successors, (19) [2021-12-06 20:49:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 117 transitions. [2021-12-06 20:49:30,580 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 117 transitions. Word has length 41 [2021-12-06 20:49:30,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:30,580 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 117 transitions. [2021-12-06 20:49:30,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:49:30,581 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2021-12-06 20:49:30,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-06 20:49:30,582 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:30,582 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:30,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 20:49:30,582 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:30,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:30,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1080842886, now seen corresponding path program 1 times [2021-12-06 20:49:30,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:30,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473684690] [2021-12-06 20:49:30,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:30,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:30,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:30,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:30,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:30,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 20:49:30,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:30,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473684690] [2021-12-06 20:49:30,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473684690] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:30,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:30,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 20:49:30,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95659845] [2021-12-06 20:49:30,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:30,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 20:49:30,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:30,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 20:49:30,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:49:30,790 INFO L87 Difference]: Start difference. First operand 94 states and 117 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:49:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:30,998 INFO L93 Difference]: Finished difference Result 178 states and 224 transitions. [2021-12-06 20:49:30,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 20:49:30,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2021-12-06 20:49:30,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:31,000 INFO L225 Difference]: With dead ends: 178 [2021-12-06 20:49:31,000 INFO L226 Difference]: Without dead ends: 115 [2021-12-06 20:49:31,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-06 20:49:31,001 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 63 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:31,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 185 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:49:31,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-06 20:49:31,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2021-12-06 20:49:31,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 79 states have internal predecessors, (89), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (21), 14 states have call predecessors, (21), 15 states have call successors, (21) [2021-12-06 20:49:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2021-12-06 20:49:31,011 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 41 [2021-12-06 20:49:31,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:31,011 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2021-12-06 20:49:31,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:49:31,011 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2021-12-06 20:49:31,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-06 20:49:31,012 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:31,013 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:31,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 20:49:31,013 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:31,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:31,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2006223412, now seen corresponding path program 1 times [2021-12-06 20:49:31,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:31,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248935920] [2021-12-06 20:49:31,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:31,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:31,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:31,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:31,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:31,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 20:49:31,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:31,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248935920] [2021-12-06 20:49:31,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248935920] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:31,302 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:31,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 20:49:31,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859535518] [2021-12-06 20:49:31,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:31,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 20:49:31,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:31,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 20:49:31,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-06 20:49:31,304 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:49:31,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:31,755 INFO L93 Difference]: Finished difference Result 200 states and 249 transitions. [2021-12-06 20:49:31,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 20:49:31,755 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-06 20:49:31,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:31,756 INFO L225 Difference]: With dead ends: 200 [2021-12-06 20:49:31,756 INFO L226 Difference]: Without dead ends: 130 [2021-12-06 20:49:31,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-12-06 20:49:31,757 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 113 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:31,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 301 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 20:49:31,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-06 20:49:31,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 120. [2021-12-06 20:49:31,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.2150537634408602) internal successors, (113), 98 states have internal predecessors, (113), 16 states have call successors, (16), 7 states have call predecessors, (16), 10 states have return successors, (23), 14 states have call predecessors, (23), 15 states have call successors, (23) [2021-12-06 20:49:31,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 152 transitions. [2021-12-06 20:49:31,765 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 152 transitions. Word has length 41 [2021-12-06 20:49:31,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:31,766 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 152 transitions. [2021-12-06 20:49:31,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:49:31,766 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 152 transitions. [2021-12-06 20:49:31,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-06 20:49:31,766 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:31,767 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:31,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 20:49:31,767 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:31,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:31,767 INFO L85 PathProgramCache]: Analyzing trace with hash 726359734, now seen corresponding path program 1 times [2021-12-06 20:49:31,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:31,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404571589] [2021-12-06 20:49:31,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:31,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:31,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:31,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:31,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:31,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:31,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 20:49:31,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:31,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404571589] [2021-12-06 20:49:31,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404571589] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:31,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:31,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 20:49:31,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779564867] [2021-12-06 20:49:31,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:31,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 20:49:31,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:31,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 20:49:31,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-06 20:49:31,930 INFO L87 Difference]: Start difference. First operand 120 states and 152 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:49:32,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:32,195 INFO L93 Difference]: Finished difference Result 230 states and 286 transitions. [2021-12-06 20:49:32,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 20:49:32,196 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-06 20:49:32,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:32,197 INFO L225 Difference]: With dead ends: 230 [2021-12-06 20:49:32,197 INFO L226 Difference]: Without dead ends: 136 [2021-12-06 20:49:32,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-12-06 20:49:32,198 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 109 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:32,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 294 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:49:32,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-06 20:49:32,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 117. [2021-12-06 20:49:32,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.211111111111111) internal successors, (109), 95 states have internal predecessors, (109), 16 states have call successors, (16), 7 states have call predecessors, (16), 10 states have return successors, (23), 14 states have call predecessors, (23), 15 states have call successors, (23) [2021-12-06 20:49:32,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2021-12-06 20:49:32,205 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 41 [2021-12-06 20:49:32,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:32,205 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2021-12-06 20:49:32,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:49:32,206 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2021-12-06 20:49:32,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-06 20:49:32,206 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:32,206 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:32,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 20:49:32,206 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:32,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:32,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1315800189, now seen corresponding path program 1 times [2021-12-06 20:49:32,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:32,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742181487] [2021-12-06 20:49:32,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:32,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:32,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:32,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:32,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:32,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 20:49:32,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:32,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742181487] [2021-12-06 20:49:32,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742181487] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:32,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:32,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 20:49:32,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914001875] [2021-12-06 20:49:32,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:32,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 20:49:32,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:32,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 20:49:32,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-06 20:49:32,370 INFO L87 Difference]: Start difference. First operand 117 states and 148 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:49:32,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:32,609 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2021-12-06 20:49:32,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 20:49:32,609 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2021-12-06 20:49:32,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:32,611 INFO L225 Difference]: With dead ends: 145 [2021-12-06 20:49:32,612 INFO L226 Difference]: Without dead ends: 143 [2021-12-06 20:49:32,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-12-06 20:49:32,613 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 63 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:32,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 450 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:49:32,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-06 20:49:32,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 125. [2021-12-06 20:49:32,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 97 states have (on average 1.1958762886597938) internal successors, (116), 103 states have internal predecessors, (116), 16 states have call successors, (16), 7 states have call predecessors, (16), 11 states have return successors, (25), 14 states have call predecessors, (25), 15 states have call successors, (25) [2021-12-06 20:49:32,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 157 transitions. [2021-12-06 20:49:32,629 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 157 transitions. Word has length 43 [2021-12-06 20:49:32,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:32,629 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 157 transitions. [2021-12-06 20:49:32,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:49:32,630 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 157 transitions. [2021-12-06 20:49:32,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-06 20:49:32,630 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:32,630 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:32,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 20:49:32,631 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:32,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:32,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2016864767, now seen corresponding path program 1 times [2021-12-06 20:49:32,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:32,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888508094] [2021-12-06 20:49:32,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:32,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:32,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:32,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:32,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:32,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:32,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 20:49:32,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:32,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888508094] [2021-12-06 20:49:32,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888508094] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:32,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:32,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-06 20:49:32,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431686662] [2021-12-06 20:49:32,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:32,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 20:49:32,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:32,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 20:49:32,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-12-06 20:49:32,867 INFO L87 Difference]: Start difference. First operand 125 states and 157 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:49:33,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:33,300 INFO L93 Difference]: Finished difference Result 153 states and 185 transitions. [2021-12-06 20:49:33,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-06 20:49:33,301 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2021-12-06 20:49:33,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:33,302 INFO L225 Difference]: With dead ends: 153 [2021-12-06 20:49:33,302 INFO L226 Difference]: Without dead ends: 151 [2021-12-06 20:49:33,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2021-12-06 20:49:33,303 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 114 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:33,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 553 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 20:49:33,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-06 20:49:33,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 117. [2021-12-06 20:49:33,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.2) internal successors, (108), 95 states have internal predecessors, (108), 16 states have call successors, (16), 7 states have call predecessors, (16), 10 states have return successors, (23), 14 states have call predecessors, (23), 15 states have call successors, (23) [2021-12-06 20:49:33,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 147 transitions. [2021-12-06 20:49:33,309 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 147 transitions. Word has length 43 [2021-12-06 20:49:33,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:33,309 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 147 transitions. [2021-12-06 20:49:33,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-06 20:49:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 147 transitions. [2021-12-06 20:49:33,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-06 20:49:33,310 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:33,310 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:33,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 20:49:33,310 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:33,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:33,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1260426877, now seen corresponding path program 1 times [2021-12-06 20:49:33,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:33,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825013339] [2021-12-06 20:49:33,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:33,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:33,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:33,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:33,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:33,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:33,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 20:49:33,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:33,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825013339] [2021-12-06 20:49:33,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825013339] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:33,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:33,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 20:49:33,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359724509] [2021-12-06 20:49:33,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:33,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 20:49:33,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:33,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 20:49:33,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:49:33,475 INFO L87 Difference]: Start difference. First operand 117 states and 147 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:49:33,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:33,690 INFO L93 Difference]: Finished difference Result 224 states and 273 transitions. [2021-12-06 20:49:33,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 20:49:33,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-12-06 20:49:33,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:33,691 INFO L225 Difference]: With dead ends: 224 [2021-12-06 20:49:33,691 INFO L226 Difference]: Without dead ends: 133 [2021-12-06 20:49:33,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-06 20:49:33,692 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 60 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:33,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 256 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:49:33,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-06 20:49:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2021-12-06 20:49:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 89 states have internal predecessors, (103), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (19), 13 states have call predecessors, (19), 14 states have call successors, (19) [2021-12-06 20:49:33,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 137 transitions. [2021-12-06 20:49:33,698 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 137 transitions. Word has length 43 [2021-12-06 20:49:33,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:33,698 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 137 transitions. [2021-12-06 20:49:33,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-06 20:49:33,698 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 137 transitions. [2021-12-06 20:49:33,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-06 20:49:33,699 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:33,699 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:33,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 20:49:33,699 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:33,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:33,699 INFO L85 PathProgramCache]: Analyzing trace with hash 707087091, now seen corresponding path program 1 times [2021-12-06 20:49:33,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:33,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031389074] [2021-12-06 20:49:33,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:33,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:33,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:33,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:33,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:33,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:33,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:49:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:33,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 20:49:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:33,807 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 20:49:33,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:33,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031389074] [2021-12-06 20:49:33,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031389074] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:49:33,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342631304] [2021-12-06 20:49:33,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:33,807 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:49:33,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:49:33,808 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:49:33,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 20:49:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:34,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 2456 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 20:49:34,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:49:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 20:49:34,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:49:34,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342631304] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:34,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:49:34,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-06 20:49:34,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117032826] [2021-12-06 20:49:34,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:34,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:49:34,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:34,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:49:34,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:49:34,110 INFO L87 Difference]: Start difference. First operand 110 states and 137 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 20:49:34,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:34,123 INFO L93 Difference]: Finished difference Result 198 states and 247 transitions. [2021-12-06 20:49:34,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 20:49:34,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2021-12-06 20:49:34,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:34,125 INFO L225 Difference]: With dead ends: 198 [2021-12-06 20:49:34,125 INFO L226 Difference]: Without dead ends: 114 [2021-12-06 20:49:34,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:49:34,126 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 20 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:34,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 232 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:49:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-06 20:49:34,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2021-12-06 20:49:34,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 85 states have (on average 1.188235294117647) internal successors, (101), 89 states have internal predecessors, (101), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (19), 13 states have call predecessors, (19), 14 states have call successors, (19) [2021-12-06 20:49:34,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 135 transitions. [2021-12-06 20:49:34,133 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 135 transitions. Word has length 50 [2021-12-06 20:49:34,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:34,133 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 135 transitions. [2021-12-06 20:49:34,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 20:49:34,133 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2021-12-06 20:49:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-06 20:49:34,134 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:34,134 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:34,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-06 20:49:34,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-06 20:49:34,334 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:34,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:34,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1480660857, now seen corresponding path program 1 times [2021-12-06 20:49:34,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:34,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947265435] [2021-12-06 20:49:34,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:34,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:34,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:34,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:34,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:34,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:34,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:49:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:34,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 20:49:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:34,456 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 20:49:34,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:34,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947265435] [2021-12-06 20:49:34,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947265435] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:34,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:34,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 20:49:34,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035692105] [2021-12-06 20:49:34,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:34,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 20:49:34,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:34,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 20:49:34,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:49:34,458 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 20:49:34,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:34,565 INFO L93 Difference]: Finished difference Result 142 states and 171 transitions. [2021-12-06 20:49:34,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 20:49:34,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2021-12-06 20:49:34,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:34,566 INFO L225 Difference]: With dead ends: 142 [2021-12-06 20:49:34,566 INFO L226 Difference]: Without dead ends: 110 [2021-12-06 20:49:34,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:49:34,567 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 66 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:34,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 134 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:49:34,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-06 20:49:34,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-12-06 20:49:34,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (19), 13 states have call predecessors, (19), 14 states have call successors, (19) [2021-12-06 20:49:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2021-12-06 20:49:34,572 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 50 [2021-12-06 20:49:34,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:34,572 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2021-12-06 20:49:34,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 20:49:34,572 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2021-12-06 20:49:34,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-06 20:49:34,573 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:34,573 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:34,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 20:49:34,573 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:34,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:34,574 INFO L85 PathProgramCache]: Analyzing trace with hash 973183812, now seen corresponding path program 1 times [2021-12-06 20:49:34,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:34,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564617395] [2021-12-06 20:49:34,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:34,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:34,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:34,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:34,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:34,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:34,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:49:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:34,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 20:49:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-06 20:49:34,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:34,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564617395] [2021-12-06 20:49:34,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564617395] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:34,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:34,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 20:49:34,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480276409] [2021-12-06 20:49:34,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:34,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 20:49:34,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:34,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 20:49:34,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 20:49:34,723 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-06 20:49:34,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:34,887 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2021-12-06 20:49:34,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 20:49:34,888 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 56 [2021-12-06 20:49:34,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:34,888 INFO L225 Difference]: With dead ends: 118 [2021-12-06 20:49:34,889 INFO L226 Difference]: Without dead ends: 116 [2021-12-06 20:49:34,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-12-06 20:49:34,889 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 56 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:34,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 352 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:49:34,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-06 20:49:34,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2021-12-06 20:49:34,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.1704545454545454) internal successors, (103), 92 states have internal predecessors, (103), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2021-12-06 20:49:34,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 139 transitions. [2021-12-06 20:49:34,894 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 139 transitions. Word has length 56 [2021-12-06 20:49:34,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:34,895 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 139 transitions. [2021-12-06 20:49:34,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-06 20:49:34,895 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 139 transitions. [2021-12-06 20:49:34,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-06 20:49:34,895 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:34,896 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:34,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 20:49:34,896 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:34,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:34,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1607419124, now seen corresponding path program 1 times [2021-12-06 20:49:34,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:34,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133674645] [2021-12-06 20:49:34,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:34,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:35,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:35,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:35,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:35,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:35,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:49:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:35,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 20:49:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:35,094 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 20:49:35,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:35,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133674645] [2021-12-06 20:49:35,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133674645] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:35,094 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:35,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 20:49:35,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616691773] [2021-12-06 20:49:35,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:35,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 20:49:35,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:35,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 20:49:35,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-06 20:49:35,096 INFO L87 Difference]: Start difference. First operand 115 states and 139 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-06 20:49:35,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:35,358 INFO L93 Difference]: Finished difference Result 163 states and 195 transitions. [2021-12-06 20:49:35,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 20:49:35,359 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 60 [2021-12-06 20:49:35,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:35,360 INFO L225 Difference]: With dead ends: 163 [2021-12-06 20:49:35,360 INFO L226 Difference]: Without dead ends: 129 [2021-12-06 20:49:35,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2021-12-06 20:49:35,360 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 101 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:35,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 177 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:49:35,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-06 20:49:35,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2021-12-06 20:49:35,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.1555555555555554) internal successors, (104), 94 states have internal predecessors, (104), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2021-12-06 20:49:35,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 140 transitions. [2021-12-06 20:49:35,366 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 140 transitions. Word has length 60 [2021-12-06 20:49:35,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:35,366 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 140 transitions. [2021-12-06 20:49:35,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-06 20:49:35,366 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 140 transitions. [2021-12-06 20:49:35,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-06 20:49:35,367 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:35,367 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:35,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 20:49:35,367 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:35,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:35,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1349253686, now seen corresponding path program 1 times [2021-12-06 20:49:35,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:35,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152819237] [2021-12-06 20:49:35,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:35,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:35,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:35,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:35,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:35,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:35,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:49:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:35,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 20:49:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:35,682 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 20:49:35,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:35,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152819237] [2021-12-06 20:49:35,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152819237] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:35,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:35,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-06 20:49:35,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50468136] [2021-12-06 20:49:35,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:35,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 20:49:35,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:35,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 20:49:35,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-12-06 20:49:35,683 INFO L87 Difference]: Start difference. First operand 117 states and 140 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-06 20:49:36,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:36,177 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2021-12-06 20:49:36,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 20:49:36,178 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 60 [2021-12-06 20:49:36,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:36,178 INFO L225 Difference]: With dead ends: 173 [2021-12-06 20:49:36,179 INFO L226 Difference]: Without dead ends: 144 [2021-12-06 20:49:36,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2021-12-06 20:49:36,179 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 150 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:36,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 231 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 20:49:36,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-12-06 20:49:36,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2021-12-06 20:49:36,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 102 states have internal predecessors, (111), 18 states have call successors, (18), 8 states have call predecessors, (18), 11 states have return successors, (25), 16 states have call predecessors, (25), 17 states have call successors, (25) [2021-12-06 20:49:36,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 154 transitions. [2021-12-06 20:49:36,188 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 154 transitions. Word has length 60 [2021-12-06 20:49:36,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:36,188 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 154 transitions. [2021-12-06 20:49:36,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-06 20:49:36,189 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 154 transitions. [2021-12-06 20:49:36,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-06 20:49:36,190 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:36,190 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:36,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-06 20:49:36,190 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:36,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:36,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1665849932, now seen corresponding path program 1 times [2021-12-06 20:49:36,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:36,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23337878] [2021-12-06 20:49:36,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:36,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:36,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:36,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:36,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:36,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:36,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:49:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:36,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 20:49:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:36,389 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 20:49:36,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:36,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23337878] [2021-12-06 20:49:36,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23337878] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:36,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:36,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 20:49:36,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444716503] [2021-12-06 20:49:36,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:36,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 20:49:36,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:36,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 20:49:36,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-06 20:49:36,390 INFO L87 Difference]: Start difference. First operand 127 states and 154 transitions. Second operand has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-06 20:49:36,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:36,695 INFO L93 Difference]: Finished difference Result 162 states and 194 transitions. [2021-12-06 20:49:36,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 20:49:36,696 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 60 [2021-12-06 20:49:36,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:36,696 INFO L225 Difference]: With dead ends: 162 [2021-12-06 20:49:36,697 INFO L226 Difference]: Without dead ends: 119 [2021-12-06 20:49:36,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-12-06 20:49:36,697 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 124 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:36,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 199 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 20:49:36,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-06 20:49:36,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-12-06 20:49:36,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 89 states have (on average 1.1123595505617978) internal successors, (99), 94 states have internal predecessors, (99), 18 states have call successors, (18), 8 states have call predecessors, (18), 11 states have return successors, (25), 16 states have call predecessors, (25), 17 states have call successors, (25) [2021-12-06 20:49:36,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 142 transitions. [2021-12-06 20:49:36,703 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 142 transitions. Word has length 60 [2021-12-06 20:49:36,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:36,704 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 142 transitions. [2021-12-06 20:49:36,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-06 20:49:36,704 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 142 transitions. [2021-12-06 20:49:36,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-06 20:49:36,705 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:36,705 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:36,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-06 20:49:36,705 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:36,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:36,705 INFO L85 PathProgramCache]: Analyzing trace with hash 127651990, now seen corresponding path program 1 times [2021-12-06 20:49:36,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:36,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676943586] [2021-12-06 20:49:36,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:36,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:36,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:36,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:36,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:36,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:36,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:49:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:36,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 20:49:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:36,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-06 20:49:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:36,851 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 20:49:36,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:36,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676943586] [2021-12-06 20:49:36,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676943586] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:36,851 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:36,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 20:49:36,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777741051] [2021-12-06 20:49:36,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:36,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 20:49:36,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:36,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 20:49:36,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 20:49:36,852 INFO L87 Difference]: Start difference. First operand 119 states and 142 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 20:49:37,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:37,056 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2021-12-06 20:49:37,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 20:49:37,057 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2021-12-06 20:49:37,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:37,057 INFO L225 Difference]: With dead ends: 125 [2021-12-06 20:49:37,058 INFO L226 Difference]: Without dead ends: 123 [2021-12-06 20:49:37,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-12-06 20:49:37,058 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 53 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:37,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 225 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:49:37,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-06 20:49:37,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-12-06 20:49:37,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 92 states have (on average 1.108695652173913) internal successors, (102), 97 states have internal predecessors, (102), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (25), 16 states have call predecessors, (25), 17 states have call successors, (25) [2021-12-06 20:49:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 145 transitions. [2021-12-06 20:49:37,064 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 145 transitions. Word has length 62 [2021-12-06 20:49:37,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:37,065 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 145 transitions. [2021-12-06 20:49:37,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 20:49:37,065 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 145 transitions. [2021-12-06 20:49:37,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-06 20:49:37,065 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:37,066 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:37,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-06 20:49:37,066 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:37,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:37,066 INFO L85 PathProgramCache]: Analyzing trace with hash -554307627, now seen corresponding path program 1 times [2021-12-06 20:49:37,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:37,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502154259] [2021-12-06 20:49:37,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:37,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:37,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:37,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:37,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:37,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:37,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:49:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:37,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 20:49:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:37,232 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-06 20:49:37,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:37,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502154259] [2021-12-06 20:49:37,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502154259] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:37,233 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:37,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 20:49:37,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361226478] [2021-12-06 20:49:37,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:37,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 20:49:37,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:37,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 20:49:37,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-06 20:49:37,234 INFO L87 Difference]: Start difference. First operand 123 states and 145 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-06 20:49:37,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:37,443 INFO L93 Difference]: Finished difference Result 131 states and 153 transitions. [2021-12-06 20:49:37,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 20:49:37,444 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 62 [2021-12-06 20:49:37,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:37,445 INFO L225 Difference]: With dead ends: 131 [2021-12-06 20:49:37,445 INFO L226 Difference]: Without dead ends: 129 [2021-12-06 20:49:37,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-12-06 20:49:37,445 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 60 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:37,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 441 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:49:37,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-06 20:49:37,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2021-12-06 20:49:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 92 states have (on average 1.108695652173913) internal successors, (102), 97 states have internal predecessors, (102), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (25), 16 states have call predecessors, (25), 17 states have call successors, (25) [2021-12-06 20:49:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 145 transitions. [2021-12-06 20:49:37,452 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 145 transitions. Word has length 62 [2021-12-06 20:49:37,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:37,452 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 145 transitions. [2021-12-06 20:49:37,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-06 20:49:37,453 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 145 transitions. [2021-12-06 20:49:37,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-06 20:49:37,453 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:37,453 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:37,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-06 20:49:37,453 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:37,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:37,454 INFO L85 PathProgramCache]: Analyzing trace with hash 146756951, now seen corresponding path program 1 times [2021-12-06 20:49:37,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:37,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364399263] [2021-12-06 20:49:37,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:37,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:37,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:37,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:37,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:37,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:37,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:49:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:37,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 20:49:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 20:49:37,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:37,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364399263] [2021-12-06 20:49:37,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364399263] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:37,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:37,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 20:49:37,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007468281] [2021-12-06 20:49:37,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:37,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 20:49:37,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:37,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 20:49:37,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-06 20:49:37,627 INFO L87 Difference]: Start difference. First operand 123 states and 145 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-06 20:49:37,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:37,902 INFO L93 Difference]: Finished difference Result 161 states and 186 transitions. [2021-12-06 20:49:37,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 20:49:37,902 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 62 [2021-12-06 20:49:37,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:37,904 INFO L225 Difference]: With dead ends: 161 [2021-12-06 20:49:37,904 INFO L226 Difference]: Without dead ends: 116 [2021-12-06 20:49:37,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-12-06 20:49:37,905 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 87 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:37,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 163 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:49:37,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-06 20:49:37,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-12-06 20:49:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 90 states have internal predecessors, (94), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (23), 16 states have call predecessors, (23), 17 states have call successors, (23) [2021-12-06 20:49:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2021-12-06 20:49:37,913 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 62 [2021-12-06 20:49:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:37,914 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2021-12-06 20:49:37,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-06 20:49:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2021-12-06 20:49:37,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-06 20:49:37,915 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:37,915 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:37,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-06 20:49:37,915 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:37,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:37,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1448791323, now seen corresponding path program 1 times [2021-12-06 20:49:37,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:37,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743091564] [2021-12-06 20:49:37,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:37,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:38,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:38,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:38,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:38,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:38,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:49:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:38,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 20:49:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-06 20:49:38,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:38,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743091564] [2021-12-06 20:49:38,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743091564] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:49:38,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735032093] [2021-12-06 20:49:38,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:38,097 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:49:38,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:49:38,098 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:49:38,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 20:49:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:38,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 2505 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-06 20:49:38,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:49:38,489 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-06 20:49:38,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:49:38,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735032093] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:38,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:49:38,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2021-12-06 20:49:38,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835235824] [2021-12-06 20:49:38,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:38,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 20:49:38,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:38,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 20:49:38,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:49:38,491 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 20:49:38,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:38,577 INFO L93 Difference]: Finished difference Result 204 states and 232 transitions. [2021-12-06 20:49:38,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 20:49:38,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2021-12-06 20:49:38,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:38,578 INFO L225 Difference]: With dead ends: 204 [2021-12-06 20:49:38,578 INFO L226 Difference]: Without dead ends: 116 [2021-12-06 20:49:38,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-06 20:49:38,579 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 17 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:38,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 264 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 23 Unchecked, 0.1s Time] [2021-12-06 20:49:38,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-06 20:49:38,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-12-06 20:49:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 86 states have (on average 1.069767441860465) internal successors, (92), 90 states have internal predecessors, (92), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (23), 16 states have call predecessors, (23), 17 states have call successors, (23) [2021-12-06 20:49:38,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 133 transitions. [2021-12-06 20:49:38,588 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 133 transitions. Word has length 66 [2021-12-06 20:49:38,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:38,588 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 133 transitions. [2021-12-06 20:49:38,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 20:49:38,589 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 133 transitions. [2021-12-06 20:49:38,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-06 20:49:38,590 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:38,590 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:38,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-06 20:49:38,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:49:38,792 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:38,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:38,793 INFO L85 PathProgramCache]: Analyzing trace with hash 2108322845, now seen corresponding path program 1 times [2021-12-06 20:49:38,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:38,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994943892] [2021-12-06 20:49:38,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:38,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:38,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:38,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:38,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:38,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:38,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:49:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:38,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 20:49:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:38,940 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-06 20:49:38,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:38,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994943892] [2021-12-06 20:49:38,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994943892] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:49:38,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498880053] [2021-12-06 20:49:38,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:38,941 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:49:38,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:49:38,942 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:49:38,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 20:49:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:39,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 2500 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 20:49:39,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:49:39,251 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-06 20:49:39,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:49:39,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498880053] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:39,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:49:39,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-06 20:49:39,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178277335] [2021-12-06 20:49:39,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:39,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:49:39,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:39,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:49:39,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:49:39,252 INFO L87 Difference]: Start difference. First operand 116 states and 133 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 20:49:39,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:39,267 INFO L93 Difference]: Finished difference Result 195 states and 219 transitions. [2021-12-06 20:49:39,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 20:49:39,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2021-12-06 20:49:39,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:39,268 INFO L225 Difference]: With dead ends: 195 [2021-12-06 20:49:39,268 INFO L226 Difference]: Without dead ends: 102 [2021-12-06 20:49:39,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:49:39,268 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 7 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:39,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 221 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:49:39,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-06 20:49:39,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-12-06 20:49:39,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.0547945205479452) internal successors, (77), 76 states have internal predecessors, (77), 18 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (21), 16 states have call predecessors, (21), 17 states have call successors, (21) [2021-12-06 20:49:39,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2021-12-06 20:49:39,273 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 66 [2021-12-06 20:49:39,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:39,274 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2021-12-06 20:49:39,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-06 20:49:39,274 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2021-12-06 20:49:39,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-06 20:49:39,274 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:39,275 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:39,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-06 20:49:39,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-06 20:49:39,476 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:39,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:39,477 INFO L85 PathProgramCache]: Analyzing trace with hash 325130519, now seen corresponding path program 1 times [2021-12-06 20:49:39,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:39,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336068541] [2021-12-06 20:49:39,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:39,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:39,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:39,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:39,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:39,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:39,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:49:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:39,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 20:49:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-06 20:49:39,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:39,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336068541] [2021-12-06 20:49:39,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336068541] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:49:39,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252523947] [2021-12-06 20:49:39,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:39,904 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:49:39,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:49:39,904 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:49:39,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 20:49:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:40,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 2497 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-06 20:49:40,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:49:40,851 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 20:49:40,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:49:41,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252523947] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:49:41,105 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 20:49:41,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2021-12-06 20:49:41,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30034841] [2021-12-06 20:49:41,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 20:49:41,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-06 20:49:41,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:41,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-06 20:49:41,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1011, Unknown=0, NotChecked=0, Total=1122 [2021-12-06 20:49:41,106 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 29 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 25 states have internal predecessors, (94), 10 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2021-12-06 20:49:42,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:42,376 INFO L93 Difference]: Finished difference Result 241 states and 273 transitions. [2021-12-06 20:49:42,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-12-06 20:49:42,377 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 25 states have internal predecessors, (94), 10 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 66 [2021-12-06 20:49:42,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:42,378 INFO L225 Difference]: With dead ends: 241 [2021-12-06 20:49:42,378 INFO L226 Difference]: Without dead ends: 163 [2021-12-06 20:49:42,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=326, Invalid=2980, Unknown=0, NotChecked=0, Total=3306 [2021-12-06 20:49:42,379 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 199 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 766 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:42,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 1056 Invalid, 1988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1148 Invalid, 0 Unknown, 766 Unchecked, 0.6s Time] [2021-12-06 20:49:42,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-06 20:49:42,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 97. [2021-12-06 20:49:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 71 states have internal predecessors, (72), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2021-12-06 20:49:42,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2021-12-06 20:49:42,386 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 66 [2021-12-06 20:49:42,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:42,386 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2021-12-06 20:49:42,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 25 states have internal predecessors, (94), 10 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2021-12-06 20:49:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2021-12-06 20:49:42,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-06 20:49:42,387 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:42,387 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:42,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 20:49:42,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-06 20:49:42,587 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:42,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:42,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1497368934, now seen corresponding path program 1 times [2021-12-06 20:49:42,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:42,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451248185] [2021-12-06 20:49:42,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:42,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:42,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:42,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:42,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:42,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:42,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:49:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:42,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 20:49:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:42,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-06 20:49:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:42,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-06 20:49:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:42,787 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-06 20:49:42,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:42,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451248185] [2021-12-06 20:49:42,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451248185] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:42,787 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:42,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 20:49:42,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451715106] [2021-12-06 20:49:42,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:42,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 20:49:42,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:42,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 20:49:42,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-06 20:49:42,788 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-06 20:49:43,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:43,052 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2021-12-06 20:49:43,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 20:49:43,052 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 68 [2021-12-06 20:49:43,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:43,053 INFO L225 Difference]: With dead ends: 103 [2021-12-06 20:49:43,053 INFO L226 Difference]: Without dead ends: 101 [2021-12-06 20:49:43,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-12-06 20:49:43,054 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 59 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:43,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 200 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:49:43,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-06 20:49:43,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-12-06 20:49:43,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 74 states have internal predecessors, (75), 17 states have call successors, (17), 11 states have call predecessors, (17), 11 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2021-12-06 20:49:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2021-12-06 20:49:43,060 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 68 [2021-12-06 20:49:43,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:43,060 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2021-12-06 20:49:43,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-06 20:49:43,060 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2021-12-06 20:49:43,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-06 20:49:43,061 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:43,061 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:43,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-06 20:49:43,061 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:43,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:43,061 INFO L85 PathProgramCache]: Analyzing trace with hash 997273396, now seen corresponding path program 1 times [2021-12-06 20:49:43,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:43,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616675627] [2021-12-06 20:49:43,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:43,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:43,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:43,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:43,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:43,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:43,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:49:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:43,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 20:49:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:43,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-06 20:49:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:43,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-06 20:49:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:43,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 20:49:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:43,226 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-06 20:49:43,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:43,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616675627] [2021-12-06 20:49:43,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616675627] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:43,226 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:43,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 20:49:43,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150883622] [2021-12-06 20:49:43,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:43,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 20:49:43,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:43,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 20:49:43,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-06 20:49:43,228 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 20:49:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:43,432 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2021-12-06 20:49:43,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 20:49:43,433 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 74 [2021-12-06 20:49:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:43,433 INFO L225 Difference]: With dead ends: 107 [2021-12-06 20:49:43,434 INFO L226 Difference]: Without dead ends: 105 [2021-12-06 20:49:43,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-12-06 20:49:43,434 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 48 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:43,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 228 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:49:43,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-06 20:49:43,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-12-06 20:49:43,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.04) internal successors, (78), 77 states have internal predecessors, (78), 17 states have call successors, (17), 12 states have call predecessors, (17), 12 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2021-12-06 20:49:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2021-12-06 20:49:43,444 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 74 [2021-12-06 20:49:43,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:43,444 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2021-12-06 20:49:43,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 20:49:43,444 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2021-12-06 20:49:43,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-06 20:49:43,445 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:43,445 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:43,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-06 20:49:43,445 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:43,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:43,446 INFO L85 PathProgramCache]: Analyzing trace with hash 880347013, now seen corresponding path program 1 times [2021-12-06 20:49:43,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:43,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022979202] [2021-12-06 20:49:43,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:43,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:43,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:43,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:43,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:43,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:43,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:49:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:43,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 20:49:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:43,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-06 20:49:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:43,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-06 20:49:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:43,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 20:49:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:43,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-06 20:49:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:43,605 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-12-06 20:49:43,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:43,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022979202] [2021-12-06 20:49:43,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022979202] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:43,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:43,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 20:49:43,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953045068] [2021-12-06 20:49:43,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:43,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 20:49:43,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:43,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 20:49:43,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:49:43,606 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 20:49:43,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:43,834 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2021-12-06 20:49:43,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 20:49:43,834 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 81 [2021-12-06 20:49:43,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:43,835 INFO L225 Difference]: With dead ends: 138 [2021-12-06 20:49:43,835 INFO L226 Difference]: Without dead ends: 84 [2021-12-06 20:49:43,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-06 20:49:43,836 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 36 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:43,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 275 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:49:43,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-06 20:49:43,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-06 20:49:43,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 60 states have internal predecessors, (60), 14 states have call successors, (14), 10 states have call predecessors, (14), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-06 20:49:43,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2021-12-06 20:49:43,841 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 81 [2021-12-06 20:49:43,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:43,841 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2021-12-06 20:49:43,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 20:49:43,841 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2021-12-06 20:49:43,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-06 20:49:43,842 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:43,842 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:43,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-06 20:49:43,842 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:43,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:43,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1004637351, now seen corresponding path program 1 times [2021-12-06 20:49:43,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:43,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038587889] [2021-12-06 20:49:43,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:43,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:44,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:44,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:44,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:44,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:44,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:49:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:44,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 20:49:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:44,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 20:49:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:44,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-06 20:49:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:44,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-06 20:49:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:44,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-06 20:49:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-06 20:49:44,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:44,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038587889] [2021-12-06 20:49:44,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038587889] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:44,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:44,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-06 20:49:44,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937359545] [2021-12-06 20:49:44,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:44,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-06 20:49:44,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:44,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-06 20:49:44,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-12-06 20:49:44,154 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2021-12-06 20:49:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:44,522 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2021-12-06 20:49:44,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 20:49:44,522 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 93 [2021-12-06 20:49:44,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:44,523 INFO L225 Difference]: With dead ends: 90 [2021-12-06 20:49:44,523 INFO L226 Difference]: Without dead ends: 86 [2021-12-06 20:49:44,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2021-12-06 20:49:44,524 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 58 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:44,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 275 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 20:49:44,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-06 20:49:44,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-12-06 20:49:44,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.0) internal successors, (61), 61 states have internal predecessors, (61), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-06 20:49:44,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2021-12-06 20:49:44,534 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 93 [2021-12-06 20:49:44,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:44,535 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2021-12-06 20:49:44,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2021-12-06 20:49:44,535 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2021-12-06 20:49:44,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-06 20:49:44,535 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:49:44,536 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 20:49:44,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-06 20:49:44,536 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:49:44,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:49:44,536 INFO L85 PathProgramCache]: Analyzing trace with hash 131876282, now seen corresponding path program 1 times [2021-12-06 20:49:44,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:49:44,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284238049] [2021-12-06 20:49:44,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:49:44,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:49:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:45,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 20:49:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:45,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:49:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:45,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 20:49:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:45,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:49:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:45,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:49:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:45,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 20:49:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:45,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 20:49:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:45,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-06 20:49:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:45,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-06 20:49:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:45,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-06 20:49:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:45,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-06 20:49:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:45,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-06 20:49:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:45,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-06 20:49:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:49:45,318 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-12-06 20:49:45,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:49:45,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284238049] [2021-12-06 20:49:45,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284238049] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:49:45,318 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:49:45,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-06 20:49:45,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003502759] [2021-12-06 20:49:45,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:49:45,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 20:49:45,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:49:45,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 20:49:45,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2021-12-06 20:49:45,319 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2021-12-06 20:49:45,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:49:45,744 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2021-12-06 20:49:45,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 20:49:45,744 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 110 [2021-12-06 20:49:45,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:49:45,745 INFO L225 Difference]: With dead ends: 86 [2021-12-06 20:49:45,745 INFO L226 Difference]: Without dead ends: 0 [2021-12-06 20:49:45,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2021-12-06 20:49:45,746 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 54 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:49:45,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 304 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 20:49:45,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-06 20:49:45,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-06 20:49:45,746 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-12-06 20:49:45,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-06 20:49:45,746 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2021-12-06 20:49:45,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:49:45,746 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-06 20:49:45,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2021-12-06 20:49:45,747 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-06 20:49:45,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-06 20:49:45,748 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-06 20:49:45,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-06 20:49:45,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-06 20:49:47,812 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-12-06 20:49:47,812 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2021-12-06 20:49:47,812 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2021-12-06 20:49:47,812 INFO L858 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2021-12-06 20:49:47,813 INFO L854 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-12-06 20:49:47,813 INFO L861 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7375 7381) the Hoare annotation is: true [2021-12-06 20:49:47,813 INFO L858 garLoopResultBuilder]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2021-12-06 20:49:47,813 INFO L858 garLoopResultBuilder]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2021-12-06 20:49:47,813 INFO L858 garLoopResultBuilder]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2021-12-06 20:49:47,813 INFO L858 garLoopResultBuilder]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2021-12-06 20:49:47,813 INFO L858 garLoopResultBuilder]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2021-12-06 20:49:47,813 INFO L858 garLoopResultBuilder]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2021-12-06 20:49:47,813 INFO L858 garLoopResultBuilder]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2021-12-06 20:49:47,813 INFO L858 garLoopResultBuilder]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2021-12-06 20:49:47,813 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7375 7381) no Hoare annotation was computed. [2021-12-06 20:49:47,813 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7375 7381) no Hoare annotation was computed. [2021-12-06 20:49:47,813 INFO L858 garLoopResultBuilder]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2021-12-06 20:49:47,813 INFO L858 garLoopResultBuilder]: For program point L7380(line 7380) no Hoare annotation was computed. [2021-12-06 20:49:47,813 INFO L858 garLoopResultBuilder]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2021-12-06 20:49:47,813 INFO L858 garLoopResultBuilder]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2021-12-06 20:49:47,813 INFO L858 garLoopResultBuilder]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2021-12-06 20:49:47,813 INFO L858 garLoopResultBuilder]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2021-12-06 20:49:47,813 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-06 20:49:47,813 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-06 20:49:47,814 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-06 20:49:47,814 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-06 20:49:47,814 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-12-06 20:49:47,814 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-12-06 20:49:47,814 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-12-06 20:49:47,814 INFO L858 garLoopResultBuilder]: For program point L8219-1(line 8219) no Hoare annotation was computed. [2021-12-06 20:49:47,814 INFO L854 garLoopResultBuilder]: At program point L8219(line 8219) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| 18446744073709551616)) 36028797018963967)) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) [2021-12-06 20:49:47,814 INFO L858 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2021-12-06 20:49:47,814 INFO L854 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse3 (select .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) (.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse5 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (<= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len|) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= (select .cse2 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (<= .cse3 0) (= (select .cse4 .cse1) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (<= 0 .cse3) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0) (= (select .cse4 .cse5) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= 0 (select .cse0 .cse5)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)))) [2021-12-06 20:49:47,814 INFO L861 garLoopResultBuilder]: At program point L8963(line 8963) the Hoare annotation is: true [2021-12-06 20:49:47,814 INFO L858 garLoopResultBuilder]: For program point L8963-1(line 8963) no Hoare annotation was computed. [2021-12-06 20:49:47,814 INFO L854 garLoopResultBuilder]: At program point L8967(line 8967) the Hoare annotation is: (let ((.cse22 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse18 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse19 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse20 (select .cse22 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) (.cse17 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse21 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse2 (<= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len|)) (.cse3 (= (select .cse17 .cse21) 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse5 (= (select .cse22 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse6 (<= .cse20 0)) (.cse7 (select .cse19 .cse21)) (.cse8 (<= 0 .cse20)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse10 (= (select .cse19 .cse18) 0)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1211#1| 0)) (.cse15 (= 0 (select .cse17 .cse18))) (.cse16 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse7 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse6 (= .cse7 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse15 .cse16))))) [2021-12-06 20:49:47,814 INFO L858 garLoopResultBuilder]: For program point L8967-1(line 8967) no Hoare annotation was computed. [2021-12-06 20:49:47,814 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-06 20:49:47,814 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-06 20:49:47,814 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-06 20:49:47,815 INFO L858 garLoopResultBuilder]: For program point L8959(lines 8959 8975) no Hoare annotation was computed. [2021-12-06 20:49:47,815 INFO L858 garLoopResultBuilder]: For program point L8972(lines 8972 8974) no Hoare annotation was computed. [2021-12-06 20:49:47,815 INFO L858 garLoopResultBuilder]: For program point L8972-2(lines 8972 8974) no Hoare annotation was computed. [2021-12-06 20:49:47,815 INFO L861 garLoopResultBuilder]: At program point L8976(line 8976) the Hoare annotation is: true [2021-12-06 20:49:47,815 INFO L854 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse3 (select .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) (.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse5 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (<= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len|) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= (select .cse2 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (<= .cse3 0) (= (select .cse4 .cse1) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (<= 0 .cse3) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0) (= (select .cse4 .cse5) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= (+ |ULTIMATE.start_assert_bytes_match_#t~mem589#1| (* 256 (div |ULTIMATE.start_assert_bytes_match_#t~mem588#1| 256))) (+ |ULTIMATE.start_assert_bytes_match_#t~mem588#1| (* 256 (div |ULTIMATE.start_assert_bytes_match_#t~mem589#1| 256)))) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= 0 (select .cse0 .cse5)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)))) [2021-12-06 20:49:47,815 INFO L854 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse3 (select .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) (.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse5 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (<= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len|) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= (select .cse2 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (<= .cse3 0) (= (select .cse4 .cse1) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (<= 0 .cse3) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0) (= (select .cse4 .cse5) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= 0 (select .cse0 .cse5)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)))) [2021-12-06 20:49:47,815 INFO L854 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse22 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse18 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse19 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse20 (select .cse22 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) (.cse17 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse21 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse2 (<= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len|)) (.cse3 (= (select .cse17 .cse21) 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse5 (= (select .cse22 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse6 (<= .cse20 0)) (.cse7 (select .cse19 .cse21)) (.cse8 (<= 0 .cse20)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1212#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse11 (= (select .cse19 .cse18) 0)) (.cse12 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse15 (= 0 (select .cse17 .cse18))) (.cse16 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse7 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse6 (= .cse7 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse15 .cse16))))) [2021-12-06 20:49:47,815 INFO L858 garLoopResultBuilder]: For program point L8968-1(line 8968) no Hoare annotation was computed. [2021-12-06 20:49:47,815 INFO L858 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2021-12-06 20:49:47,815 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-06 20:49:47,815 INFO L858 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2021-12-06 20:49:47,815 INFO L854 garLoopResultBuilder]: At program point L8230(line 8230) the Hoare annotation is: (let ((.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (let ((.cse7 (select .cse15 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 16))) (.cse12 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse13 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 8)) (.cse16 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse14 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base| 0))) (.cse1 (= 0 (select .cse16 .cse14))) (.cse2 (select .cse16 .cse13)) (.cse3 (= (select .cse15 |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset|) 0)) (.cse4 (= (select .cse12 .cse14) 0)) (.cse5 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse8 (= .cse7 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse9 (= (select .cse12 .cse13) 0)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 0)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 (= .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4 .cse5 .cse6 (<= .cse7 (+ (* 18446744073709551616 (div (+ (- 1) .cse7) 18446744073709551616)) 36028797018963967)) .cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse9 .cse10 .cse11) (and .cse0 .cse1 (= .cse2 0) .cse3 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| 18446744073709551616)) 36028797018963967)) .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11))))) [2021-12-06 20:49:47,815 INFO L854 garLoopResultBuilder]: At program point L8969(lines 8969 8971) the Hoare annotation is: (let ((.cse23 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse19 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse20 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse21 (select .cse23 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) (.cse18 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse22 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse2 (<= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len|)) (.cse3 (= (select .cse18 .cse22) 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse5 (= (select .cse23 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse6 (<= .cse21 0)) (.cse7 (select .cse20 .cse22)) (.cse8 (<= 0 .cse21)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse10 (= (select .cse20 .cse19) 0)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse14 (= 0 (select .cse18 .cse19))) (.cse15 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1213#1.offset| 0)) (.cse16 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1213#1.base| 0)) (.cse17 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse6 (= .cse7 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse7 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)))))) [2021-12-06 20:49:47,816 INFO L858 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2021-12-06 20:49:47,816 INFO L858 garLoopResultBuilder]: For program point L8969-1(lines 8969 8971) no Hoare annotation was computed. [2021-12-06 20:49:47,816 INFO L854 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse3 (select .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) (.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse5 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (<= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len|) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= (select .cse2 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (<= .cse3 0) (= (select .cse4 .cse1) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (<= 0 .cse3) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0) (= (select .cse4 .cse5) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= 0 (select .cse0 .cse5)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)))) [2021-12-06 20:49:47,816 INFO L858 garLoopResultBuilder]: For program point L8230-2(line 8230) no Hoare annotation was computed. [2021-12-06 20:49:47,816 INFO L854 garLoopResultBuilder]: At program point L8230-1(line 8230) the Hoare annotation is: (let ((.cse17 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (let ((.cse9 (select .cse17 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 16))) (.cse14 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse15 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 8)) (.cse18 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse16 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base| 0))) (.cse1 (= 0 (select .cse18 .cse16))) (.cse3 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#t~ret1059#1| 1)) (.cse2 (select .cse18 .cse15)) (.cse4 (= (select .cse17 |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset|) 0)) (.cse5 (= (select .cse14 .cse16) 0)) (.cse6 (<= 1 |ULTIMATE.start_aws_byte_buf_from_empty_array_#t~ret1059#1|)) (.cse7 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse10 (= .cse9 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse11 (= (select .cse14 .cse15) 0)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 (= .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse5 .cse6 .cse7 .cse8 (<= .cse9 (+ (* 18446744073709551616 (div (+ (- 1) .cse9) 18446744073709551616)) 36028797018963967)) .cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse3 (= .cse2 0) .cse4 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| 18446744073709551616)) 36028797018963967)) .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13))))) [2021-12-06 20:49:47,816 INFO L858 garLoopResultBuilder]: For program point L8222(lines 8222 8223) no Hoare annotation was computed. [2021-12-06 20:49:47,816 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-12-06 20:49:47,816 INFO L858 garLoopResultBuilder]: For program point L8222-2(lines 8222 8223) no Hoare annotation was computed. [2021-12-06 20:49:47,816 INFO L854 garLoopResultBuilder]: At program point L8966-1(line 8966) the Hoare annotation is: (let ((.cse23 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse19 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse20 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse21 (select .cse23 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) (.cse18 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse22 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse2 (<= 0 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len|)) (.cse3 (= (select .cse18 .cse22) 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse5 (= (select .cse23 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse6 (<= .cse21 0)) (.cse7 (select .cse20 .cse22)) (.cse8 (<= 0 .cse21)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse10 (= (select .cse20 .cse19) 0)) (.cse11 (<= 1 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~ret1210#1|)) (.cse12 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse15 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~ret1210#1| 1)) (.cse16 (= 0 (select .cse18 .cse19))) (.cse17 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse7 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse6 (= .cse7 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse15 .cse16 .cse17))))) [2021-12-06 20:49:47,816 INFO L854 garLoopResultBuilder]: At program point L8231(lines 8218 8232) the Hoare annotation is: (let ((.cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0))) (let ((.cse5 (let ((.cse10 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8| Int)) (let ((.cse11 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8|) 16))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| .cse11) (not (= (mod .cse11 18446744073709551616) 0))))))) (or (and .cse7 .cse8 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity|) 18446744073709551616)))) .cse9 .cse10) (and .cse7 .cse2 .cse8 .cse9 .cse6 .cse10)))) (.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0)) (and .cse0 .cse1 .cse7 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| 18446744073709551616)) 36028797018963967)) .cse2 .cse8 .cse3 .cse4 .cse9 .cse6)))) [2021-12-06 20:49:47,816 INFO L858 garLoopResultBuilder]: For program point L8966-2(line 8966) no Hoare annotation was computed. [2021-12-06 20:49:47,816 INFO L854 garLoopResultBuilder]: At program point L8966(line 8966) the Hoare annotation is: (let ((.cse19 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse17 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse14 (select .cse19 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|))) (.cse15 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse18 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (= (select .cse19 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse2 (= (select .cse15 .cse18) 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse4 (= .cse14 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse6 (select .cse17 .cse18)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse8 (= (select .cse17 .cse16) 0)) (.cse9 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse12 (= 0 (select .cse15 .cse16))) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= .cse6 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and .cse0 .cse1 (<= .cse14 (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) .cse14) 18446744073709551616)))) .cse2 .cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse5 (= .cse6 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse12 .cse13))))) [2021-12-06 20:49:47,817 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-06 20:49:47,817 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-06 20:49:47,817 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-06 20:49:47,817 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-06 20:49:47,817 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-06 20:49:47,817 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-06 20:49:47,819 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:49:47,820 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 20:49:47,827 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,827 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,827 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,828 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:47,828 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:47,828 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,828 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,828 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:47,828 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:47,828 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,828 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,828 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,829 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,829 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,829 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:47,829 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:47,829 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,829 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,829 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:47,829 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:47,829 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,830 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,830 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,830 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,836 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,836 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,836 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,836 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:47,836 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:47,837 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,837 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,837 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:47,837 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:47,837 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,837 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,837 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,837 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,837 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,837 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:47,837 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:47,838 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,838 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,838 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:47,838 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:47,838 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,838 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,838 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,838 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:47,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 08:49:47 BoogieIcfgContainer [2021-12-06 20:49:47,841 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 20:49:47,841 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 20:49:47,841 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 20:49:47,841 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 20:49:47,842 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:49:26" (3/4) ... [2021-12-06 20:49:47,844 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-06 20:49:47,848 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-06 20:49:47,848 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-12-06 20:49:47,848 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2021-12-06 20:49:47,848 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-06 20:49:47,848 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-06 20:49:47,858 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 117 nodes and edges [2021-12-06 20:49:47,860 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2021-12-06 20:49:47,861 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-12-06 20:49:47,862 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-12-06 20:49:47,863 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-12-06 20:49:47,864 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-06 20:49:47,865 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-06 20:49:47,866 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-06 20:49:47,888 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && unknown-#res!capacity-unknown == capacity) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == capacity) && (((((unknown-#res!len-unknown == 0 && !(buf == 0)) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && buf == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] && !(unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] % 18446744073709551616 == 0))) || (((((unknown-#res!len-unknown == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && !(buf == 0)) && buf == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] && !(unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] % 18446744073709551616 == 0))))) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) || (((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && unknown-#res!capacity-unknown == capacity) && array == 0) && bytes == array) && aws_byte_buf_from_empty_array_#res#1.buffer == array) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == capacity) && (((((unknown-#res!len-unknown == 0 && !(buf == 0)) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && buf == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] && !(unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] % 18446744073709551616 == 0))) || (((((unknown-#res!len-unknown == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && !(buf == 0)) && buf == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] && !(unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] % 18446744073709551616 == 0))))) && bytes == 0)) || (((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && unknown-#res!capacity-unknown == capacity) && unknown-#res!len-unknown == 0) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616) + 36028797018963967) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == capacity) && buf == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) [2021-12-06 20:49:48,549 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 20:49:48,549 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 20:49:48,549 INFO L158 Benchmark]: Toolchain (without parser) took 25570.56ms. Allocated memory was 104.9MB in the beginning and 237.0MB in the end (delta: 132.1MB). Free memory was 59.4MB in the beginning and 65.4MB in the end (delta: -6.0MB). Peak memory consumption was 165.8MB. Max. memory is 16.1GB. [2021-12-06 20:49:48,549 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 20:49:48,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2062.06ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 81.3MB in the beginning and 65.9MB in the end (delta: 15.4MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. [2021-12-06 20:49:48,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 143.47ms. Allocated memory is still 127.9MB. Free memory was 65.9MB in the beginning and 54.8MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 20:49:48,550 INFO L158 Benchmark]: Boogie Preprocessor took 65.21ms. Allocated memory is still 127.9MB. Free memory was 54.8MB in the beginning and 48.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-06 20:49:48,550 INFO L158 Benchmark]: RCFGBuilder took 1088.93ms. Allocated memory was 127.9MB in the beginning and 163.6MB in the end (delta: 35.7MB). Free memory was 48.5MB in the beginning and 67.8MB in the end (delta: -19.2MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2021-12-06 20:49:48,550 INFO L158 Benchmark]: TraceAbstraction took 21494.54ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 66.7MB in the beginning and 77.8MB in the end (delta: -11.1MB). Peak memory consumption was 108.9MB. Max. memory is 16.1GB. [2021-12-06 20:49:48,551 INFO L158 Benchmark]: Witness Printer took 707.41ms. Allocated memory is still 237.0MB. Free memory was 77.8MB in the beginning and 65.4MB in the end (delta: 12.4MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. [2021-12-06 20:49:48,552 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.15ms. Allocated memory is still 104.9MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2062.06ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 81.3MB in the beginning and 65.9MB in the end (delta: 15.4MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 143.47ms. Allocated memory is still 127.9MB. Free memory was 65.9MB in the beginning and 54.8MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.21ms. Allocated memory is still 127.9MB. Free memory was 54.8MB in the beginning and 48.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1088.93ms. Allocated memory was 127.9MB in the beginning and 163.6MB in the end (delta: 35.7MB). Free memory was 48.5MB in the beginning and 67.8MB in the end (delta: -19.2MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 21494.54ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 66.7MB in the beginning and 77.8MB in the end (delta: -11.1MB). Peak memory consumption was 108.9MB. Max. memory is 16.1GB. * Witness Printer took 707.41ms. Allocated memory is still 237.0MB. Free memory was 77.8MB in the beginning and 65.4MB in the end (delta: 12.4MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled * 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.4s, OverallIterations: 29, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2118 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2048 mSDsluCounter, 8505 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 832 IncrementalHoareTripleChecker+Unchecked, 6310 mSDsCounter, 676 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8455 IncrementalHoareTripleChecker+Invalid, 9963 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 676 mSolverCounterUnsat, 2195 mSDtfsCounter, 8455 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1074 GetRequests, 677 SyntacticMatches, 6 SemanticMatches, 391 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=17, InterpolantAutomatonStates: 292, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 29 MinimizatonAttempts, 275 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 220 PreInvPairs, 245 NumberOfFragments, 2140 HoareAnnotationTreeSize, 220 FomulaSimplifications, 970 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 21 FomulaSimplificationsInter, 8258 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 1909 NumberOfCodeBlocks, 1909 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1875 ConstructedInterpolants, 37 QuantifiedInterpolants, 7929 SizeOfPredicates, 27 NumberOfNonLiveVariables, 12376 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 34 InterpolantComputations, 28 PerfectInterpolantSequences, 612/653 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 1 specifications checked. All of them hold - InvariantResult [Line: 8976]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8218]: Loop Invariant [2021-12-06 20:49:48,557 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,557 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,557 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,558 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:48,558 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:48,558 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,558 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,558 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:48,558 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:48,558 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,558 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,558 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,558 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,559 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,559 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:48,559 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:48,559 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,559 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,559 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:48,559 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:48,559 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,559 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,559 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,559 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,561 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,561 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,561 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,561 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:48,561 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:48,561 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,561 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,561 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:48,562 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:48,562 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,562 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,562 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,562 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,562 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,562 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:48,562 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:48,562 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,562 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,562 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:48,563 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2021-12-06 20:49:48,563 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,563 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,563 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-12-06 20:49:48,563 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled Derived loop invariant: (((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && unknown-#res!capacity-unknown == capacity) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == capacity) && (((((unknown-#res!len-unknown == 0 && !(buf == 0)) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && buf == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] && !(unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] % 18446744073709551616 == 0))) || (((((unknown-#res!len-unknown == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && !(buf == 0)) && buf == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] && !(unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] % 18446744073709551616 == 0))))) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) || (((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && unknown-#res!capacity-unknown == capacity) && array == 0) && bytes == array) && aws_byte_buf_from_empty_array_#res#1.buffer == array) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == capacity) && (((((unknown-#res!len-unknown == 0 && !(buf == 0)) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && buf == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] && !(unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] % 18446744073709551616 == 0))) || (((((unknown-#res!len-unknown == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && !(buf == 0)) && buf == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] && !(unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] % 18446744073709551616 == 0))))) && bytes == 0)) || (((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && unknown-#res!capacity-unknown == capacity) && unknown-#res!len-unknown == 0) && capacity <= 18446744073709551616 * (capacity / 18446744073709551616) + 36028797018963967) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == capacity) && buf == 0) && aws_byte_buf_from_empty_array_#res#1.buffer == 0) RESULT: Ultimate proved your program to be correct! [2021-12-06 20:49:48,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9431d67c-59f1-488d-9781-c87af3d2c561/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE