./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_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_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/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_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/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_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/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 0aec0bb8b8715e014581c4eef5e1e25c7e0452a528f8abdf2f2a721d17b0fa7f --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 01:16:34,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 01:16:34,684 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 01:16:34,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 01:16:34,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 01:16:34,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 01:16:34,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 01:16:34,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 01:16:34,712 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 01:16:34,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 01:16:34,713 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 01:16:34,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 01:16:34,715 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 01:16:34,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 01:16:34,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 01:16:34,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 01:16:34,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 01:16:34,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 01:16:34,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 01:16:34,723 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 01:16:34,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 01:16:34,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 01:16:34,727 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 01:16:34,728 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 01:16:34,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 01:16:34,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 01:16:34,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 01:16:34,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 01:16:34,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 01:16:34,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 01:16:34,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 01:16:34,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 01:16:34,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 01:16:34,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 01:16:34,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 01:16:34,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 01:16:34,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 01:16:34,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 01:16:34,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 01:16:34,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 01:16:34,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 01:16:34,742 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-07 01:16:34,766 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 01:16:34,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 01:16:34,767 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 01:16:34,767 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 01:16:34,768 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 01:16:34,768 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 01:16:34,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 01:16:34,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 01:16:34,769 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 01:16:34,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 01:16:34,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 01:16:34,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 01:16:34,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-07 01:16:34,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 01:16:34,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-07 01:16:34,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-07 01:16:34,770 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 01:16:34,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-07 01:16:34,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 01:16:34,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 01:16:34,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 01:16:34,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:16:34,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 01:16:34,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 01:16:34,772 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-07 01:16:34,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 01:16:34,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-07 01:16:34,772 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-07 01:16:34,772 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-07 01:16:34,773 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-07 01:16:34,773 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 01:16:34,773 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_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/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_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/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 -> 0aec0bb8b8715e014581c4eef5e1e25c7e0452a528f8abdf2f2a721d17b0fa7f [2021-12-07 01:16:34,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 01:16:34,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 01:16:34,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 01:16:34,967 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 01:16:34,968 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 01:16:34,969 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2021-12-07 01:16:35,017 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/data/7fa1ec16d/b81aa4f385814a06806308ffe4d157e9/FLAG44ecda485 [2021-12-07 01:16:35,564 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 01:16:35,565 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2021-12-07 01:16:35,586 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/data/7fa1ec16d/b81aa4f385814a06806308ffe4d157e9/FLAG44ecda485 [2021-12-07 01:16:36,045 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/data/7fa1ec16d/b81aa4f385814a06806308ffe4d157e9 [2021-12-07 01:16:36,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 01:16:36,048 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 01:16:36,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 01:16:36,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 01:16:36,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 01:16:36,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:16:36" (1/1) ... [2021-12-07 01:16:36,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56a277c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:16:36, skipping insertion in model container [2021-12-07 01:16:36,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:16:36" (1/1) ... [2021-12-07 01:16:36,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 01:16:36,133 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 01:16:36,297 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_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2021-12-07 01:16:36,301 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_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2021-12-07 01:16:36,929 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:36,930 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:36,930 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:36,931 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:36,932 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:36,942 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:36,943 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:36,944 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:36,945 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:36,946 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:36,947 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:36,947 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:36,948 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:37,186 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-07 01:16:37,187 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-07 01:16:37,188 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-07 01:16:37,189 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-07 01:16:37,190 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-07 01:16:37,191 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-07 01:16:37,191 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-07 01:16:37,192 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-07 01:16:37,192 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-07 01:16:37,193 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-07 01:16:37,299 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-07 01:16:37,315 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:16:37,327 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 01:16:37,337 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_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2021-12-07 01:16:37,338 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_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2021-12-07 01:16:37,368 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:37,368 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:37,369 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:37,369 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:37,370 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:37,375 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:37,376 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:37,376 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:37,377 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:37,378 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:37,378 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:37,379 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:37,379 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:16:37,408 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-07 01:16:37,408 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-07 01:16:37,409 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-07 01:16:37,410 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-07 01:16:37,410 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-07 01:16:37,411 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-07 01:16:37,411 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-07 01:16:37,412 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-07 01:16:37,412 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-07 01:16:37,412 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-07 01:16:37,431 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-07 01:16:37,443 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:16:37,578 INFO L208 MainTranslator]: Completed translation [2021-12-07 01:16:37,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:16:37 WrapperNode [2021-12-07 01:16:37,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 01:16:37,579 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 01:16:37,579 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 01:16:37,579 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 01:16:37,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:16:37" (1/1) ... [2021-12-07 01:16:37,642 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:16:37" (1/1) ... [2021-12-07 01:16:37,669 INFO L137 Inliner]: procedures = 679, calls = 1039, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 58 [2021-12-07 01:16:37,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 01:16:37,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 01:16:37,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 01:16:37,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 01:16:37,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:16:37" (1/1) ... [2021-12-07 01:16:37,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:16:37" (1/1) ... [2021-12-07 01:16:37,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:16:37" (1/1) ... [2021-12-07 01:16:37,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:16:37" (1/1) ... [2021-12-07 01:16:37,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:16:37" (1/1) ... [2021-12-07 01:16:37,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:16:37" (1/1) ... [2021-12-07 01:16:37,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:16:37" (1/1) ... [2021-12-07 01:16:37,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 01:16:37,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 01:16:37,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 01:16:37,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 01:16:37,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:16:37" (1/1) ... [2021-12-07 01:16:37,707 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:16:37,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:16:37,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 01:16:37,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 01:16:37,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-07 01:16:37,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-07 01:16:37,773 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-07 01:16:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2021-12-07 01:16:37,773 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2021-12-07 01:16:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 01:16:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-07 01:16:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 01:16:37,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 01:16:37,773 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-07 01:16:37,773 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-07 01:16:37,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-07 01:16:37,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-07 01:16:37,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-07 01:16:37,774 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2021-12-07 01:16:37,774 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2021-12-07 01:16:37,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-07 01:16:37,916 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 01:16:37,917 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 01:16:38,043 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 01:16:38,048 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 01:16:38,048 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-07 01:16:38,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:16:38 BoogieIcfgContainer [2021-12-07 01:16:38,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 01:16:38,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 01:16:38,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 01:16:38,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 01:16:38,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:16:36" (1/3) ... [2021-12-07 01:16:38,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5a325c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:16:38, skipping insertion in model container [2021-12-07 01:16:38,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:16:37" (2/3) ... [2021-12-07 01:16:38,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5a325c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:16:38, skipping insertion in model container [2021-12-07 01:16:38,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:16:38" (3/3) ... [2021-12-07 01:16:38,055 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_linked_list_prev_harness.i [2021-12-07 01:16:38,059 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 01:16:38,059 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-07 01:16:38,092 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 01:16:38,096 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-07 01:16:38,096 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-07 01:16:38,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-12-07 01:16:38,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-07 01:16:38,113 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:16:38,113 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:16:38,114 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:16:38,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:16:38,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1117195627, now seen corresponding path program 1 times [2021-12-07 01:16:38,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:16:38,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234549065] [2021-12-07 01:16:38,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:38,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:16:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:38,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:16:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:38,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:16:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:38,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 01:16:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-07 01:16:38,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:16:38,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234549065] [2021-12-07 01:16:38,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234549065] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:16:38,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:16:38,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 01:16:38,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168260314] [2021-12-07 01:16:38,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:16:38,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-07 01:16:38,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:16:38,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-07 01:16:38,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-07 01:16:38,470 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-07 01:16:38,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:16:38,488 INFO L93 Difference]: Finished difference Result 94 states and 124 transitions. [2021-12-07 01:16:38,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-07 01:16:38,490 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2021-12-07 01:16:38,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:16:38,498 INFO L225 Difference]: With dead ends: 94 [2021-12-07 01:16:38,498 INFO L226 Difference]: Without dead ends: 45 [2021-12-07 01:16:38,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-07 01:16:38,505 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:16:38,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:16:38,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-07 01:16:38,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-12-07 01:16:38,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-07 01:16:38,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2021-12-07 01:16:38,546 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 28 [2021-12-07 01:16:38,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:16:38,547 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2021-12-07 01:16:38,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-07 01:16:38,547 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2021-12-07 01:16:38,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-07 01:16:38,549 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:16:38,549 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:16:38,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-07 01:16:38,550 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:16:38,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:16:38,550 INFO L85 PathProgramCache]: Analyzing trace with hash 96127273, now seen corresponding path program 1 times [2021-12-07 01:16:38,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:16:38,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589342432] [2021-12-07 01:16:38,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:38,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:16:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:38,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:16:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:38,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:16:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:38,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 01:16:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:38,937 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:16:38,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:16:38,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589342432] [2021-12-07 01:16:38,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589342432] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:16:38,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:16:38,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-07 01:16:38,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644454018] [2021-12-07 01:16:38,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:16:38,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 01:16:38,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:16:38,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 01:16:38,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:16:38,941 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-07 01:16:39,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:16:39,179 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2021-12-07 01:16:39,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 01:16:39,180 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2021-12-07 01:16:39,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:16:39,182 INFO L225 Difference]: With dead ends: 56 [2021-12-07 01:16:39,182 INFO L226 Difference]: Without dead ends: 54 [2021-12-07 01:16:39,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-07 01:16:39,184 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 18 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:16:39,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 271 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:16:39,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-12-07 01:16:39,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2021-12-07 01:16:39,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-12-07 01:16:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2021-12-07 01:16:39,194 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 28 [2021-12-07 01:16:39,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:16:39,194 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2021-12-07 01:16:39,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-07 01:16:39,195 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2021-12-07 01:16:39,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-07 01:16:39,195 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:16:39,196 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:16:39,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-07 01:16:39,196 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:16:39,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:16:39,196 INFO L85 PathProgramCache]: Analyzing trace with hash -713219353, now seen corresponding path program 1 times [2021-12-07 01:16:39,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:16:39,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103715304] [2021-12-07 01:16:39,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:39,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:16:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:39,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:16:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:39,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:16:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:39,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 01:16:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:16:39,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:16:39,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103715304] [2021-12-07 01:16:39,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103715304] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:16:39,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:16:39,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:16:39,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203538170] [2021-12-07 01:16:39,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:16:39,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:16:39,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:16:39,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:16:39,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:16:39,404 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-07 01:16:39,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:16:39,581 INFO L93 Difference]: Finished difference Result 109 states and 136 transitions. [2021-12-07 01:16:39,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-07 01:16:39,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2021-12-07 01:16:39,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:16:39,583 INFO L225 Difference]: With dead ends: 109 [2021-12-07 01:16:39,583 INFO L226 Difference]: Without dead ends: 59 [2021-12-07 01:16:39,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-07 01:16:39,586 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 21 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:16:39,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 150 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:16:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-07 01:16:39,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2021-12-07 01:16:39,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2021-12-07 01:16:39,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2021-12-07 01:16:39,598 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 28 [2021-12-07 01:16:39,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:16:39,598 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2021-12-07 01:16:39,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-07 01:16:39,599 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2021-12-07 01:16:39,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-07 01:16:39,600 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:16:39,600 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:16:39,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-07 01:16:39,601 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:16:39,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:16:39,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1106246363, now seen corresponding path program 1 times [2021-12-07 01:16:39,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:16:39,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286156457] [2021-12-07 01:16:39,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:39,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:16:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:39,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:16:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:39,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:16:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:39,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 01:16:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:39,702 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:16:39,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:16:39,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286156457] [2021-12-07 01:16:39,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286156457] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:16:39,703 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:16:39,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 01:16:39,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323684908] [2021-12-07 01:16:39,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:16:39,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:16:39,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:16:39,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:16:39,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:16:39,704 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-07 01:16:39,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:16:39,728 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2021-12-07 01:16:39,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:16:39,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2021-12-07 01:16:39,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:16:39,730 INFO L225 Difference]: With dead ends: 115 [2021-12-07 01:16:39,730 INFO L226 Difference]: Without dead ends: 60 [2021-12-07 01:16:39,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:16:39,731 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 12 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:16:39,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 191 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:16:39,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-07 01:16:39,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2021-12-07 01:16:39,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 37 states have internal predecessors, (41), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2021-12-07 01:16:39,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2021-12-07 01:16:39,738 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 28 [2021-12-07 01:16:39,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:16:39,739 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2021-12-07 01:16:39,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-07 01:16:39,739 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2021-12-07 01:16:39,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-07 01:16:39,740 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:16:39,740 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] [2021-12-07 01:16:39,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-07 01:16:39,740 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:16:39,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:16:39,741 INFO L85 PathProgramCache]: Analyzing trace with hash 695086179, now seen corresponding path program 1 times [2021-12-07 01:16:39,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:16:39,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638536841] [2021-12-07 01:16:39,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:39,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:16:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:39,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:16:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:40,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:16:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:40,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 01:16:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:40,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 01:16:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:40,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:16:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:40,214 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:16:40,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:16:40,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638536841] [2021-12-07 01:16:40,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638536841] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:16:40,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693259706] [2021-12-07 01:16:40,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:40,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:16:40,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:16:40,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:16:40,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-07 01:16:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:40,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 95 conjunts are in the unsatisfiable core [2021-12-07 01:16:40,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:16:40,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:16:40,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:16:40,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2021-12-07 01:16:40,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:16:40,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-12-07 01:16:40,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:16:40,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2021-12-07 01:16:40,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-07 01:16:40,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2021-12-07 01:16:40,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-07 01:16:41,910 INFO L354 Elim1Store]: treesize reduction 69, result has 25.0 percent of original size [2021-12-07 01:16:41,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 221 treesize of output 133 [2021-12-07 01:16:41,934 INFO L354 Elim1Store]: treesize reduction 74, result has 8.6 percent of original size [2021-12-07 01:16:41,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 81 treesize of output 43 [2021-12-07 01:16:41,980 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:16:41,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:16:54,710 WARN L227 SmtUtils]: Spent 10.16s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-07 01:17:07,053 WARN L227 SmtUtils]: Spent 10.13s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-07 01:17:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:17:21,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693259706] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:17:21,002 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:17:21,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 16] total 45 [2021-12-07 01:17:21,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986587890] [2021-12-07 01:17:21,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:17:21,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-07 01:17:21,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:17:21,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-07 01:17:21,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1816, Unknown=2, NotChecked=0, Total=1980 [2021-12-07 01:17:21,004 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 45 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 37 states have internal predecessors, (83), 14 states have call successors, (17), 4 states have call predecessors, (17), 11 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15) [2021-12-07 01:17:21,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:17:21,667 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2021-12-07 01:17:21,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-07 01:17:21,668 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 37 states have internal predecessors, (83), 14 states have call successors, (17), 4 states have call predecessors, (17), 11 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15) Word has length 42 [2021-12-07 01:17:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:17:21,669 INFO L225 Difference]: With dead ends: 91 [2021-12-07 01:17:21,669 INFO L226 Difference]: Without dead ends: 81 [2021-12-07 01:17:21,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 39.8s TimeCoverageRelationStatistics Valid=195, Invalid=2353, Unknown=2, NotChecked=0, Total=2550 [2021-12-07 01:17:21,671 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 46 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:17:21,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 897 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 279 Invalid, 0 Unknown, 176 Unchecked, 0.3s Time] [2021-12-07 01:17:21,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-07 01:17:21,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2021-12-07 01:17:21,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 50 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2021-12-07 01:17:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2021-12-07 01:17:21,682 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 42 [2021-12-07 01:17:21,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:17:21,683 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2021-12-07 01:17:21,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 37 states have internal predecessors, (83), 14 states have call successors, (17), 4 states have call predecessors, (17), 11 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15) [2021-12-07 01:17:21,683 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2021-12-07 01:17:21,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-07 01:17:21,684 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:17:21,685 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] [2021-12-07 01:17:21,705 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-07 01:17:21,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:17:21,887 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:17:21,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:17:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash -114260447, now seen corresponding path program 1 times [2021-12-07 01:17:21,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:17:21,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265413960] [2021-12-07 01:17:21,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:17:21,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:17:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:22,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:17:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:22,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:17:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:22,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 01:17:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:22,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 01:17:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:22,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:17:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:22,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-07 01:17:22,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:17:22,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265413960] [2021-12-07 01:17:22,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265413960] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:17:22,168 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:17:22,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-07 01:17:22,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834814748] [2021-12-07 01:17:22,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:17:22,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 01:17:22,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:17:22,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 01:17:22,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:17:22,170 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-07 01:17:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:17:22,419 INFO L93 Difference]: Finished difference Result 115 states and 134 transitions. [2021-12-07 01:17:22,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-07 01:17:22,419 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2021-12-07 01:17:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:17:22,420 INFO L225 Difference]: With dead ends: 115 [2021-12-07 01:17:22,421 INFO L226 Difference]: Without dead ends: 80 [2021-12-07 01:17:22,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-12-07 01:17:22,422 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 35 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:17:22,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 170 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:17:22,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-07 01:17:22,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2021-12-07 01:17:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.14) internal successors, (57), 52 states have internal predecessors, (57), 13 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2021-12-07 01:17:22,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2021-12-07 01:17:22,431 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 42 [2021-12-07 01:17:22,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:17:22,431 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2021-12-07 01:17:22,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-07 01:17:22,432 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2021-12-07 01:17:22,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-07 01:17:22,432 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:17:22,433 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] [2021-12-07 01:17:22,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-07 01:17:22,433 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:17:22,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:17:22,433 INFO L85 PathProgramCache]: Analyzing trace with hash -507287457, now seen corresponding path program 1 times [2021-12-07 01:17:22,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:17:22,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320780307] [2021-12-07 01:17:22,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:17:22,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:17:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:22,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:17:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:22,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:17:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:22,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 01:17:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:22,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 01:17:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:22,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:17:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-07 01:17:22,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:17:22,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320780307] [2021-12-07 01:17:22,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320780307] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:17:22,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:17:22,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 01:17:22,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788986382] [2021-12-07 01:17:22,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:17:22,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 01:17:22,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:17:22,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 01:17:22,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:17:22,619 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-07 01:17:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:17:22,722 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2021-12-07 01:17:22,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 01:17:22,723 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2021-12-07 01:17:22,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:17:22,724 INFO L225 Difference]: With dead ends: 117 [2021-12-07 01:17:22,724 INFO L226 Difference]: Without dead ends: 72 [2021-12-07 01:17:22,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:17:22,726 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 25 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:17:22,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 164 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:17:22,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-07 01:17:22,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2021-12-07 01:17:22,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.108695652173913) internal successors, (51), 47 states have internal predecessors, (51), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-07 01:17:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2021-12-07 01:17:22,736 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 42 [2021-12-07 01:17:22,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:17:22,737 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2021-12-07 01:17:22,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-07 01:17:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2021-12-07 01:17:22,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-07 01:17:22,738 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:17:22,738 INFO L514 BasicCegarLoop]: trace histogram [3, 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-07 01:17:22,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-07 01:17:22,739 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:17:22,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:17:22,739 INFO L85 PathProgramCache]: Analyzing trace with hash 709260864, now seen corresponding path program 1 times [2021-12-07 01:17:22,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:17:22,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981217271] [2021-12-07 01:17:22,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:17:22,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:17:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:22,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:17:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:22,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:17:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:22,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 01:17:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:22,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 01:17:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:22,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:17:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:22,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-07 01:17:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:22,920 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-07 01:17:22,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:17:22,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981217271] [2021-12-07 01:17:22,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981217271] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:17:22,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:17:22,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 01:17:22,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004908771] [2021-12-07 01:17:22,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:17:22,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:17:22,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:17:22,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:17:22,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:17:22,922 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-07 01:17:23,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:17:23,044 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2021-12-07 01:17:23,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 01:17:23,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2021-12-07 01:17:23,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:17:23,046 INFO L225 Difference]: With dead ends: 73 [2021-12-07 01:17:23,046 INFO L226 Difference]: Without dead ends: 71 [2021-12-07 01:17:23,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:17:23,047 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 9 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:17:23,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 219 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:17:23,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-07 01:17:23,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-07 01:17:23,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 50 states have internal predecessors, (54), 12 states have call successors, (12), 9 states have call predecessors, (12), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-07 01:17:23,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2021-12-07 01:17:23,057 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 48 [2021-12-07 01:17:23,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:17:23,058 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2021-12-07 01:17:23,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-07 01:17:23,058 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2021-12-07 01:17:23,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-07 01:17:23,059 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:17:23,059 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:17:23,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-07 01:17:23,060 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:17:23,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:17:23,060 INFO L85 PathProgramCache]: Analyzing trace with hash -593356994, now seen corresponding path program 1 times [2021-12-07 01:17:23,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:17:23,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841929101] [2021-12-07 01:17:23,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:17:23,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:17:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:23,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:17:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:23,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:17:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:23,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 01:17:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:23,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 01:17:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:23,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:17:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:23,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-07 01:17:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:23,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-07 01:17:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:23,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 01:17:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:23,455 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-07 01:17:23,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:17:23,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841929101] [2021-12-07 01:17:23,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841929101] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:17:23,456 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:17:23,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-07 01:17:23,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994816377] [2021-12-07 01:17:23,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:17:23,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 01:17:23,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:17:23,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 01:17:23,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:17:23,457 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-07 01:17:23,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:17:23,760 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2021-12-07 01:17:23,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 01:17:23,760 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 63 [2021-12-07 01:17:23,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:17:23,761 INFO L225 Difference]: With dead ends: 82 [2021-12-07 01:17:23,761 INFO L226 Difference]: Without dead ends: 80 [2021-12-07 01:17:23,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-07 01:17:23,762 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 19 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:17:23,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 309 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:17:23,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-07 01:17:23,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2021-12-07 01:17:23,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 56 states have internal predecessors, (59), 13 states have call successors, (13), 10 states have call predecessors, (13), 11 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2021-12-07 01:17:23,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2021-12-07 01:17:23,769 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 63 [2021-12-07 01:17:23,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:17:23,770 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2021-12-07 01:17:23,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-07 01:17:23,770 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2021-12-07 01:17:23,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-07 01:17:23,771 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:17:23,771 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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-07 01:17:23,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-07 01:17:23,771 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:17:23,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:17:23,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1402703620, now seen corresponding path program 1 times [2021-12-07 01:17:23,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:17:23,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066963485] [2021-12-07 01:17:23,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:17:23,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:17:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:23,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:17:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:23,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:17:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:23,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 01:17:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:23,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 01:17:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:23,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:17:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:23,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-07 01:17:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:23,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-07 01:17:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:23,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 01:17:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:23,979 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-07 01:17:23,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:17:23,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066963485] [2021-12-07 01:17:23,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066963485] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:17:23,980 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:17:23,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:17:23,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832029568] [2021-12-07 01:17:23,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:17:23,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:17:23,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:17:23,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:17:23,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:17:23,981 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-07 01:17:24,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:17:24,169 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2021-12-07 01:17:24,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:17:24,170 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 63 [2021-12-07 01:17:24,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:17:24,171 INFO L225 Difference]: With dead ends: 104 [2021-12-07 01:17:24,171 INFO L226 Difference]: Without dead ends: 82 [2021-12-07 01:17:24,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:17:24,172 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:17:24,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 171 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:17:24,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-07 01:17:24,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2021-12-07 01:17:24,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 58 states have internal predecessors, (61), 13 states have call successors, (13), 10 states have call predecessors, (13), 11 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2021-12-07 01:17:24,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2021-12-07 01:17:24,178 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 63 [2021-12-07 01:17:24,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:17:24,178 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2021-12-07 01:17:24,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-07 01:17:24,178 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2021-12-07 01:17:24,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-07 01:17:24,179 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:17:24,179 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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-07 01:17:24,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-07 01:17:24,179 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:17:24,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:17:24,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1795730630, now seen corresponding path program 1 times [2021-12-07 01:17:24,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:17:24,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518868956] [2021-12-07 01:17:24,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:17:24,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:17:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:24,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:17:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:24,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:17:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:24,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 01:17:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:24,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 01:17:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:24,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:17:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:24,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-07 01:17:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:24,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-07 01:17:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:24,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 01:17:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:24,286 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-07 01:17:24,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:17:24,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518868956] [2021-12-07 01:17:24,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518868956] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:17:24,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:17:24,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 01:17:24,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906270324] [2021-12-07 01:17:24,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:17:24,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:17:24,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:17:24,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:17:24,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:17:24,288 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-12-07 01:17:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:17:24,309 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2021-12-07 01:17:24,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:17:24,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 63 [2021-12-07 01:17:24,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:17:24,310 INFO L225 Difference]: With dead ends: 107 [2021-12-07 01:17:24,310 INFO L226 Difference]: Without dead ends: 75 [2021-12-07 01:17:24,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:17:24,311 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 8 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:17:24,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 193 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:17:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-07 01:17:24,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-12-07 01:17:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 53 states have internal predecessors, (55), 12 states have call successors, (12), 10 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-07 01:17:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2021-12-07 01:17:24,317 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 63 [2021-12-07 01:17:24,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:17:24,317 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2021-12-07 01:17:24,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-12-07 01:17:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2021-12-07 01:17:24,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-07 01:17:24,318 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:17:24,318 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 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-07 01:17:24,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-07 01:17:24,326 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:17:24,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:17:24,326 INFO L85 PathProgramCache]: Analyzing trace with hash 180273006, now seen corresponding path program 1 times [2021-12-07 01:17:24,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:17:24,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060838230] [2021-12-07 01:17:24,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:17:24,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:17:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:24,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:17:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:24,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:17:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:24,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 01:17:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:24,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 01:17:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:24,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:17:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:24,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-07 01:17:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:24,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-07 01:17:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:24,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 01:17:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:24,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-07 01:17:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:24,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 01:17:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:24,872 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-12-07 01:17:24,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:17:24,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060838230] [2021-12-07 01:17:24,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060838230] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:17:24,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:17:24,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-07 01:17:24,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68614466] [2021-12-07 01:17:24,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:17:24,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-07 01:17:24,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:17:24,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-07 01:17:24,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-12-07 01:17:24,875 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 7 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2021-12-07 01:17:25,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:17:25,423 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2021-12-07 01:17:25,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-07 01:17:25,424 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 7 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) Word has length 77 [2021-12-07 01:17:25,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:17:25,424 INFO L225 Difference]: With dead ends: 86 [2021-12-07 01:17:25,424 INFO L226 Difference]: Without dead ends: 84 [2021-12-07 01:17:25,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2021-12-07 01:17:25,425 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 48 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:17:25,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 321 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:17:25,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-07 01:17:25,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2021-12-07 01:17:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 59 states have internal predecessors, (60), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2021-12-07 01:17:25,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2021-12-07 01:17:25,434 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 77 [2021-12-07 01:17:25,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:17:25,434 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2021-12-07 01:17:25,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 7 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2021-12-07 01:17:25,434 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2021-12-07 01:17:25,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-07 01:17:25,435 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:17:25,435 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 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-07 01:17:25,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-07 01:17:25,435 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:17:25,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:17:25,436 INFO L85 PathProgramCache]: Analyzing trace with hash -629073620, now seen corresponding path program 1 times [2021-12-07 01:17:25,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:17:25,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97771303] [2021-12-07 01:17:25,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:17:25,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:17:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:25,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:17:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:25,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:17:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:25,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 01:17:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:25,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 01:17:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:25,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:17:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:25,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-07 01:17:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:25,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-07 01:17:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:25,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 01:17:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:25,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-07 01:17:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:25,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 01:17:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-07 01:17:25,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:17:25,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97771303] [2021-12-07 01:17:25,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97771303] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:17:25,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506561593] [2021-12-07 01:17:25,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:17:25,775 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:17:25,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:17:25,776 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:17:25,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-07 01:17:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:17:25,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-07 01:17:25,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:17:28,064 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_7|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_7|) 0)))) is different from true [2021-12-07 01:17:30,118 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_8| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_8| Int)) (not (= 0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_8|))))) is different from true [2021-12-07 01:17:32,173 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|) 0)))) is different from true [2021-12-07 01:17:34,244 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|) 0)))) is different from true [2021-12-07 01:17:36,312 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|) 0)))) is different from true [2021-12-07 01:17:44,403 WARN L227 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-07 01:17:52,510 WARN L227 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-07 01:18:00,624 WARN L227 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-07 01:18:08,735 WARN L227 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-07 01:18:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 38 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 12 not checked. [2021-12-07 01:18:08,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:18:09,152 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-07 01:18:09,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2021-12-07 01:18:09,160 INFO L354 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-12-07 01:18:09,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2021-12-07 01:18:09,194 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-12-07 01:18:09,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506561593] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:18:09,194 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:18:09,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 13] total 26 [2021-12-07 01:18:09,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650797798] [2021-12-07 01:18:09,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:18:09,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-07 01:18:09,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:18:09,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-07 01:18:09,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=358, Unknown=9, NotChecked=210, Total=650 [2021-12-07 01:18:09,196 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 4 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2021-12-07 01:18:17,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:18:17,615 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2021-12-07 01:18:17,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-07 01:18:17,615 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 4 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 77 [2021-12-07 01:18:17,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:18:17,616 INFO L225 Difference]: With dead ends: 97 [2021-12-07 01:18:17,616 INFO L226 Difference]: Without dead ends: 85 [2021-12-07 01:18:17,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 155 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 51.0s TimeCoverageRelationStatistics Valid=144, Invalid=619, Unknown=13, NotChecked=280, Total=1056 [2021-12-07 01:18:17,617 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 42 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 499 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:18:17,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 309 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 0 Unknown, 499 Unchecked, 0.1s Time] [2021-12-07 01:18:17,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-07 01:18:17,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-12-07 01:18:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 61 states have internal predecessors, (62), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2021-12-07 01:18:17,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2021-12-07 01:18:17,627 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 77 [2021-12-07 01:18:17,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:18:17,627 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2021-12-07 01:18:17,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 4 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2021-12-07 01:18:17,627 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2021-12-07 01:18:17,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-07 01:18:17,628 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:18:17,628 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 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-07 01:18:17,648 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-07 01:18:17,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-07 01:18:17,830 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:18:17,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:18:17,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1022100630, now seen corresponding path program 1 times [2021-12-07 01:18:17,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:18:17,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493192539] [2021-12-07 01:18:17,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:18:17,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:18:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:17,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:18:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:17,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:18:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:17,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 01:18:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:17,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 01:18:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:17,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:18:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:18,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-07 01:18:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:18,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-07 01:18:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:18,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 01:18:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:18,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-07 01:18:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:18,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 01:18:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-12-07 01:18:18,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:18:18,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493192539] [2021-12-07 01:18:18,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493192539] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:18:18,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336588425] [2021-12-07 01:18:18,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:18:18,132 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:18:18,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:18:18,132 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:18:18,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-07 01:18:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:18,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-07 01:18:18,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:18:18,447 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-07 01:18:18,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:18:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-12-07 01:18:18,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336588425] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:18:18,713 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:18:18,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 12 [2021-12-07 01:18:18,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347256531] [2021-12-07 01:18:18,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:18:18,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-07 01:18:18,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:18:18,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-07 01:18:18,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-07 01:18:18,714 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-07 01:18:18,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:18:18,899 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2021-12-07 01:18:18,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 01:18:18,900 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 77 [2021-12-07 01:18:18,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:18:18,901 INFO L225 Difference]: With dead ends: 101 [2021-12-07 01:18:18,901 INFO L226 Difference]: Without dead ends: 77 [2021-12-07 01:18:18,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 165 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-12-07 01:18:18,902 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 19 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:18:18,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 244 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:18:18,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-07 01:18:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-12-07 01:18:18,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.0) internal successors, (54), 54 states have internal predecessors, (54), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-07 01:18:18,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2021-12-07 01:18:18,911 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 77 [2021-12-07 01:18:18,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:18:18,912 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2021-12-07 01:18:18,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-07 01:18:18,912 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2021-12-07 01:18:18,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-07 01:18:18,912 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:18:18,912 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 3, 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] [2021-12-07 01:18:18,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-07 01:18:19,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-07 01:18:19,114 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:18:19,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:18:19,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1529037313, now seen corresponding path program 1 times [2021-12-07 01:18:19,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:18:19,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063715201] [2021-12-07 01:18:19,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:18:19,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:18:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:19,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:18:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:19,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:18:19,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:19,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 01:18:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:19,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-07 01:18:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:19,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:18:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:19,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-07 01:18:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:19,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-07 01:18:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:19,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-07 01:18:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:19,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-07 01:18:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:19,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 01:18:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:19,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-07 01:18:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:19,460 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-12-07 01:18:19,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:18:19,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063715201] [2021-12-07 01:18:19,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063715201] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:18:19,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:18:19,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-07 01:18:19,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212768863] [2021-12-07 01:18:19,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:18:19,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 01:18:19,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:18:19,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 01:18:19,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:18:19,461 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2021-12-07 01:18:19,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:18:19,688 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2021-12-07 01:18:19,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-07 01:18:19,688 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 83 [2021-12-07 01:18:19,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:18:19,688 INFO L225 Difference]: With dead ends: 77 [2021-12-07 01:18:19,689 INFO L226 Difference]: Without dead ends: 0 [2021-12-07 01:18:19,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2021-12-07 01:18:19,689 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 23 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:18:19,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 252 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:18:19,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-07 01:18:19,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-07 01:18:19,690 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-07 01:18:19,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-07 01:18:19,690 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2021-12-07 01:18:19,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:18:19,690 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-07 01:18:19,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2021-12-07 01:18:19,690 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-07 01:18:19,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-07 01:18:19,692 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-07 01:18:19,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-07 01:18:19,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-07 01:18:20,836 INFO L858 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validFINAL(lines 4717 4721) no Hoare annotation was computed. [2021-12-07 01:18:20,837 INFO L858 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validEXIT(lines 4717 4721) no Hoare annotation was computed. [2021-12-07 01:18:20,837 INFO L858 garLoopResultBuilder]: For program point L4720-2(line 4720) no Hoare annotation was computed. [2021-12-07 01:18:20,837 INFO L858 garLoopResultBuilder]: For program point L4720(line 4720) no Hoare annotation was computed. [2021-12-07 01:18:20,837 INFO L858 garLoopResultBuilder]: For program point L4720-5(line 4720) no Hoare annotation was computed. [2021-12-07 01:18:20,837 INFO L858 garLoopResultBuilder]: For program point L4720-3(line 4720) no Hoare annotation was computed. [2021-12-07 01:18:20,837 INFO L861 garLoopResultBuilder]: At program point aws_linked_list_node_next_is_validENTRY(lines 4717 4721) the Hoare annotation is: true [2021-12-07 01:18:20,837 INFO L858 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validFINAL(lines 4728 4732) no Hoare annotation was computed. [2021-12-07 01:18:20,837 INFO L858 garLoopResultBuilder]: For program point L4731(line 4731) no Hoare annotation was computed. [2021-12-07 01:18:20,837 INFO L858 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validEXIT(lines 4728 4732) no Hoare annotation was computed. [2021-12-07 01:18:20,837 INFO L858 garLoopResultBuilder]: For program point L4731-5(line 4731) no Hoare annotation was computed. [2021-12-07 01:18:20,837 INFO L858 garLoopResultBuilder]: For program point L4731-2(line 4731) no Hoare annotation was computed. [2021-12-07 01:18:20,837 INFO L858 garLoopResultBuilder]: For program point L4731-3(line 4731) no Hoare annotation was computed. [2021-12-07 01:18:20,837 INFO L861 garLoopResultBuilder]: At program point aws_linked_list_node_prev_is_validENTRY(lines 4728 4732) the Hoare annotation is: true [2021-12-07 01:18:20,838 INFO L858 garLoopResultBuilder]: For program point L7391-1(line 7391) no Hoare annotation was computed. [2021-12-07 01:18:20,838 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-07 01:18:20,838 INFO L854 garLoopResultBuilder]: At program point L7391(line 7391) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2021-12-07 01:18:20,838 INFO L861 garLoopResultBuilder]: At program point L7393(line 7393) the Hoare annotation is: true [2021-12-07 01:18:20,838 INFO L858 garLoopResultBuilder]: For program point L7389-2(line 7389) no Hoare annotation was computed. [2021-12-07 01:18:20,838 INFO L854 garLoopResultBuilder]: At program point L7389-1(line 7389) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (<= |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret675#1| 1) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (<= 1 |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret675#1|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2021-12-07 01:18:20,838 INFO L854 garLoopResultBuilder]: At program point L7389(line 7389) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2021-12-07 01:18:20,838 INFO L854 garLoopResultBuilder]: At program point L4854(lines 4848 4855) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0))) [2021-12-07 01:18:20,838 INFO L854 garLoopResultBuilder]: At program point L4852-1(line 4852) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (<= 1 |ULTIMATE.start_aws_linked_list_prev_#t~ret337#1|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (<= |ULTIMATE.start_aws_linked_list_prev_#t~ret337#1| 1))) [2021-12-07 01:18:20,838 INFO L858 garLoopResultBuilder]: For program point L4852-2(line 4852) no Hoare annotation was computed. [2021-12-07 01:18:20,839 INFO L854 garLoopResultBuilder]: At program point L4852(line 4852) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)))) [2021-12-07 01:18:20,839 INFO L854 garLoopResultBuilder]: At program point L7390(line 7390) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2021-12-07 01:18:20,839 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-07 01:18:20,839 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-07 01:18:20,839 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-07 01:18:20,839 INFO L858 garLoopResultBuilder]: For program point L7390-2(line 7390) no Hoare annotation was computed. [2021-12-07 01:18:20,839 INFO L854 garLoopResultBuilder]: At program point L7390-1(line 7390) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (<= 1 |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret676#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (<= |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret676#1| 1) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2021-12-07 01:18:20,839 INFO L854 garLoopResultBuilder]: At program point L4851(line 4851) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse3 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse1 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select .cse0 .cse1) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= (select (select |#memory_$Pointer$.base| .cse2) .cse3) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse3)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse3))) (not (= (select .cse0 8) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse1)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)))) [2021-12-07 01:18:20,839 INFO L854 garLoopResultBuilder]: At program point L4851-1(line 4851) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (<= |ULTIMATE.start_aws_linked_list_prev_#t~ret336#1| 1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (<= 1 |ULTIMATE.start_aws_linked_list_prev_#t~ret336#1|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)))) [2021-12-07 01:18:20,839 INFO L854 garLoopResultBuilder]: At program point L4853(line 4853) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| |ULTIMATE.start_aws_linked_list_prev_#t~mem338#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_#t~mem338#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)))) [2021-12-07 01:18:20,839 INFO L858 garLoopResultBuilder]: For program point L4853-1(line 4853) no Hoare annotation was computed. [2021-12-07 01:18:20,840 INFO L858 garLoopResultBuilder]: For program point L4849-2(line 4849) no Hoare annotation was computed. [2021-12-07 01:18:20,840 INFO L854 garLoopResultBuilder]: At program point L4849(line 4849) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|))) (let ((.cse1 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)) (.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse2 (select .cse0 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select .cse0 .cse1) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| (select .cse3 .cse1)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (let ((.cse4 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse4)))) (= (select .cse3 8) 0) (not (= .cse2 0)) (not (= .cse2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|))))) [2021-12-07 01:18:20,840 INFO L858 garLoopResultBuilder]: For program point L4851-2(line 4851) no Hoare annotation was computed. [2021-12-07 01:18:20,840 INFO L858 garLoopResultBuilder]: For program point L7376(lines 7376 7392) no Hoare annotation was computed. [2021-12-07 01:18:20,840 INFO L854 garLoopResultBuilder]: At program point L4849-1(line 4849) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|))) (let ((.cse1 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)) (.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse2 (select .cse0 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select .cse0 .cse1) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| (select .cse3 .cse1)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (let ((.cse4 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse4)))) (= (select .cse3 8) 0) (not (= .cse2 0)) (not (= .cse2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|))))) [2021-12-07 01:18:20,840 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-07 01:18:20,840 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-07 01:18:20,840 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-07 01:18:20,840 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-07 01:18:20,840 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-07 01:18:20,840 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-07 01:18:20,840 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-07 01:18:20,840 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-07 01:18:20,840 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-07 01:18:20,841 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-07 01:18:20,843 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:18:20,844 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-07 01:18:20,851 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:18:20,852 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:18:20,852 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:18:20,852 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:18:20,853 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:18:20,853 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:18:20,853 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:18:20,853 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:18:20,853 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:18:20,856 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:18:20,856 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:18:20,856 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:18:20,856 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:18:20,857 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:18:20,857 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:18:20,857 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:18:20,857 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:18:20,857 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:18:20,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:18:20 BoogieIcfgContainer [2021-12-07 01:18:20,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-07 01:18:20,859 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-07 01:18:20,859 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-07 01:18:20,860 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-07 01:18:20,860 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:16:38" (3/4) ... [2021-12-07 01:18:20,862 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-07 01:18:20,866 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2021-12-07 01:18:20,866 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2021-12-07 01:18:20,866 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-07 01:18:20,866 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-07 01:18:20,869 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2021-12-07 01:18:20,870 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-12-07 01:18:20,870 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-07 01:18:20,870 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-07 01:18:20,886 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((node == node && #memory_$Pointer$[node][node + 8] == before) && before == \result) && node == node) && #memory_$Pointer$[rval][rval] == node) && #memory_$Pointer$[#memory_$Pointer$[rval][rval]][node + 8] == rval) && !(node == 0)) && !(before == node)) && node == #memory_$Pointer$[#memory_$Pointer$[node][node + 8]][#memory_$Pointer$[node][node + 8]]) && before == \result) && rval == #memory_$Pointer$[node][node + 8]) && rval == 0) && before == rval) && !(rval == 0)) && #memory_$Pointer$[\result][\result] == 0 [2021-12-07 01:18:20,902 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-07 01:18:20,902 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-07 01:18:20,903 INFO L158 Benchmark]: Toolchain (without parser) took 104854.10ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 53.4MB in the beginning and 80.6MB in the end (delta: -27.2MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2021-12-07 01:18:20,903 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 76.7MB in the beginning and 76.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 01:18:20,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1528.73ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 53.3MB in the beginning and 60.7MB in the end (delta: -7.4MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2021-12-07 01:18:20,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.27ms. Allocated memory is still 117.4MB. Free memory was 60.7MB in the beginning and 55.3MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-07 01:18:20,904 INFO L158 Benchmark]: Boogie Preprocessor took 27.64ms. Allocated memory is still 117.4MB. Free memory was 55.3MB in the beginning and 53.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 01:18:20,905 INFO L158 Benchmark]: RCFGBuilder took 351.53ms. Allocated memory is still 117.4MB. Free memory was 53.2MB in the beginning and 68.2MB in the end (delta: -15.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-07 01:18:20,905 INFO L158 Benchmark]: TraceAbstraction took 102808.51ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 67.6MB in the beginning and 84.8MB in the end (delta: -17.2MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. [2021-12-07 01:18:20,905 INFO L158 Benchmark]: Witness Printer took 42.72ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 80.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-07 01:18:20,907 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.17ms. Allocated memory is still 96.5MB. Free memory was 76.7MB in the beginning and 76.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1528.73ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 53.3MB in the beginning and 60.7MB in the end (delta: -7.4MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.27ms. Allocated memory is still 117.4MB. Free memory was 60.7MB in the beginning and 55.3MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.64ms. Allocated memory is still 117.4MB. Free memory was 55.3MB in the beginning and 53.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 351.53ms. Allocated memory is still 117.4MB. Free memory was 53.2MB in the beginning and 68.2MB in the end (delta: -15.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 102808.51ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 67.6MB in the beginning and 84.8MB in the end (delta: -17.2MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. * Witness Printer took 42.72ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 80.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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 5 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 102.8s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 416 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 349 mSDsluCounter, 3922 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 675 IncrementalHoareTripleChecker+Unchecked, 3164 mSDsCounter, 201 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1642 IncrementalHoareTripleChecker+Invalid, 2518 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 201 mSolverCounterUnsat, 758 mSDtfsCounter, 1642 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 760 GetRequests, 542 SyntacticMatches, 20 SemanticMatches, 198 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 92.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=13, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 33 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 89 PreInvPairs, 102 NumberOfFragments, 1254 HoareAnnotationTreeSize, 89 FomulaSimplifications, 135 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 3601 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 88.2s InterpolantComputationTime, 985 NumberOfCodeBlocks, 985 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1160 ConstructedInterpolants, 61 QuantifiedInterpolants, 10002 SizeOfPredicates, 58 NumberOfNonLiveVariables, 963 ConjunctsInSsa, 161 ConjunctsInUnsatCore, 21 InterpolantComputations, 12 PerfectInterpolantSequences, 651/703 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: 7393]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4848]: Loop Invariant [2021-12-07 01:18:20,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:18:20,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:18:20,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:18:20,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:18:20,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:18:20,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:18:20,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:18:20,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:18:20,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:18:20,918 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:18:20,918 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:18:20,918 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:18:20,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:18:20,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:18:20,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:18:20,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:18:20,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:18:20,920 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((node == node && #memory_$Pointer$[node][node + 8] == before) && before == \result) && node == node) && #memory_$Pointer$[rval][rval] == node) && #memory_$Pointer$[#memory_$Pointer$[rval][rval]][node + 8] == rval) && !(node == 0)) && !(before == node)) && node == #memory_$Pointer$[#memory_$Pointer$[node][node + 8]][#memory_$Pointer$[node][node + 8]]) && before == \result) && rval == #memory_$Pointer$[node][node + 8]) && rval == 0) && before == rval) && !(rval == 0)) && #memory_$Pointer$[\result][\result] == 0 RESULT: Ultimate proved your program to be correct! [2021-12-07 01:18:21,001 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee2a9adf-be8a-411a-b0f7-f254f5354b7f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE