./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN --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 7d8c1ced61af2c61b36782af6d28a32546abe33f0c852d8f862ae04f74aae5e5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 10:47:45,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:47:45,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:47:45,539 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:47:45,539 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:47:45,543 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:47:45,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:47:45,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:47:45,553 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:47:45,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:47:45,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:47:45,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:47:45,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:47:45,564 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:47:45,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:47:45,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:47:45,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:47:45,567 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:47:45,569 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:47:45,571 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:47:45,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:47:45,578 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:47:45,579 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:47:45,580 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:47:45,584 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:47:45,584 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:47:45,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:47:45,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:47:45,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:47:45,587 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:47:45,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:47:45,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:47:45,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:47:45,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:47:45,590 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:47:45,591 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:47:45,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:47:45,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:47:45,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:47:45,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:47:45,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:47:45,605 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-20 10:47:45,640 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:47:45,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:47:45,641 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:47:45,641 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:47:45,642 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:47:45,642 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:47:45,643 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:47:45,643 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:47:45,643 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:47:45,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:47:45,644 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:47:45,645 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:47:45,645 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:47:45,645 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:47:45,645 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:47:45,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:47:45,645 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:47:45,646 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:47:45,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:47:45,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:47:45,646 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:47:45,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:47:45,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:47:45,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:47:45,647 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:47:45,647 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:47:45,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:47:45,647 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:47:45,648 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:47:45,648 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:47:45,648 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_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/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_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN 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 -> 7d8c1ced61af2c61b36782af6d28a32546abe33f0c852d8f862ae04f74aae5e5 [2022-11-20 10:47:45,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:47:46,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:47:46,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:47:46,028 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:47:46,028 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:47:46,029 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i [2022-11-20 10:47:49,130 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:47:49,732 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:47:49,732 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i [2022-11-20 10:47:49,761 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/data/980945884/01cf8b184e5a4e39b55daaab5b7418dc/FLAGff7d4ec0a [2022-11-20 10:47:49,776 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/data/980945884/01cf8b184e5a4e39b55daaab5b7418dc [2022-11-20 10:47:49,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:47:49,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:47:49,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:47:49,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:47:49,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:47:49,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:47:49" (1/1) ... [2022-11-20 10:47:49,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40cf506f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:49, skipping insertion in model container [2022-11-20 10:47:49,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:47:49" (1/1) ... [2022-11-20 10:47:49,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:47:49,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:47:50,122 WARN L237 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_eeda15fe-dae7-4269-8221-e8ec6d8d31db/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4491,4504] [2022-11-20 10:47:50,130 WARN L237 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_eeda15fe-dae7-4269-8221-e8ec6d8d31db/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4551,4564] [2022-11-20 10:47:51,147 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:47:51,148 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:47:51,149 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:47:51,150 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:47:51,152 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:47:51,171 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:47:51,172 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:47:51,175 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:47:51,176 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:47:51,791 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-20 10:47:51,793 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-20 10:47:51,795 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-20 10:47:51,796 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-20 10:47:51,799 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-20 10:47:51,800 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-20 10:47:51,801 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-20 10:47:51,802 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-20 10:47:51,803 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-20 10:47:51,804 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-20 10:47:52,051 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-20 10:47:52,140 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:47:52,141 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:47:52,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:47:52,387 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:47:52,418 WARN L237 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_eeda15fe-dae7-4269-8221-e8ec6d8d31db/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4491,4504] [2022-11-20 10:47:52,428 WARN L237 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_eeda15fe-dae7-4269-8221-e8ec6d8d31db/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4551,4564] [2022-11-20 10:47:52,476 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:47:52,477 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:47:52,478 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:47:52,483 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:47:52,492 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:47:52,500 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:47:52,501 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:47:52,503 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:47:52,504 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:47:52,586 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-20 10:47:52,589 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-20 10:47:52,591 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-20 10:47:52,592 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-20 10:47:52,593 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-20 10:47:52,594 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-20 10:47:52,595 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-20 10:47:52,595 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-20 10:47:52,596 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-20 10:47:52,597 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-20 10:47:52,645 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-20 10:47:52,732 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:47:52,734 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:47:52,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:47:53,105 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:47:53,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:53 WrapperNode [2022-11-20 10:47:53,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:47:53,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:47:53,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:47:53,108 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:47:53,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:53" (1/1) ... [2022-11-20 10:47:53,256 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:53" (1/1) ... [2022-11-20 10:47:53,324 INFO L138 Inliner]: procedures = 690, calls = 2495, calls flagged for inlining = 54, calls inlined = 5, statements flattened = 778 [2022-11-20 10:47:53,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:47:53,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:47:53,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:47:53,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:47:53,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:53" (1/1) ... [2022-11-20 10:47:53,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:53" (1/1) ... [2022-11-20 10:47:53,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:53" (1/1) ... [2022-11-20 10:47:53,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:53" (1/1) ... [2022-11-20 10:47:53,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:53" (1/1) ... [2022-11-20 10:47:53,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:53" (1/1) ... [2022-11-20 10:47:53,382 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:53" (1/1) ... [2022-11-20 10:47:53,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:53" (1/1) ... [2022-11-20 10:47:53,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:47:53,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:47:53,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:47:53,395 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:47:53,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:53" (1/1) ... [2022-11-20 10:47:53,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:47:53,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:47:53,451 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:47:53,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:47:53,501 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-11-20 10:47:53,501 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-11-20 10:47:53,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:47:53,502 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-20 10:47:53,502 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-20 10:47:53,502 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-11-20 10:47:53,502 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-11-20 10:47:53,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:47:53,503 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-11-20 10:47:53,503 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-11-20 10:47:53,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-20 10:47:53,504 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-20 10:47:53,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:47:53,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:47:53,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 10:47:53,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:47:53,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:47:53,506 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-20 10:47:53,506 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-20 10:47:53,507 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-11-20 10:47:53,507 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-11-20 10:47:53,508 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-20 10:47:53,508 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-20 10:47:53,508 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2022-11-20 10:47:53,508 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2022-11-20 10:47:53,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:47:53,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 10:47:53,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 10:47:53,509 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-11-20 10:47:53,509 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-11-20 10:47:53,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:47:53,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:47:53,795 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:47:53,797 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:47:55,263 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:47:55,279 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:47:55,284 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 10:47:55,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:47:55 BoogieIcfgContainer [2022-11-20 10:47:55,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:47:55,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:47:55,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:47:55,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:47:55,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:47:49" (1/3) ... [2022-11-20 10:47:55,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e75dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:47:55, skipping insertion in model container [2022-11-20 10:47:55,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:53" (2/3) ... [2022-11-20 10:47:55,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e75dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:47:55, skipping insertion in model container [2022-11-20 10:47:55,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:47:55" (3/3) ... [2022-11-20 10:47:55,303 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_init_harness.i [2022-11-20 10:47:55,323 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:47:55,324 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 10:47:55,393 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:47:55,400 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2ce1ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:47:55,400 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 10:47:55,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 68 states have internal predecessors, (83), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-20 10:47:55,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-20 10:47:55,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:55,412 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:55,413 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:47:55,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:55,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1013294361, now seen corresponding path program 1 times [2022-11-20 10:47:55,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:55,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675128211] [2022-11-20 10:47:55,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:55,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:55,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:47:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:56,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:47:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:56,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:47:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:56,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:47:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:47:56,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:56,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675128211] [2022-11-20 10:47:56,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675128211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:56,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:56,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:47:56,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714891786] [2022-11-20 10:47:56,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:56,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 10:47:56,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:56,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 10:47:56,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:47:56,122 INFO L87 Difference]: Start difference. First operand has 99 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 68 states have internal predecessors, (83), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:47:56,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:56,186 INFO L93 Difference]: Finished difference Result 193 states and 252 transitions. [2022-11-20 10:47:56,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 10:47:56,189 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-11-20 10:47:56,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:56,201 INFO L225 Difference]: With dead ends: 193 [2022-11-20 10:47:56,201 INFO L226 Difference]: Without dead ends: 93 [2022-11-20 10:47:56,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:47:56,208 INFO L413 NwaCegarLoop]: 121 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, 121 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 [2022-11-20 10:47:56,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:47:56,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-20 10:47:56,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-20 10:47:56,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 63 states have internal predecessors, (75), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-20 10:47:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2022-11-20 10:47:56,254 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 31 [2022-11-20 10:47:56,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:56,256 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2022-11-20 10:47:56,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:47:56,257 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2022-11-20 10:47:56,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-20 10:47:56,258 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:56,259 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:56,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:47:56,259 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:47:56,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:56,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1912179751, now seen corresponding path program 1 times [2022-11-20 10:47:56,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:56,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328885863] [2022-11-20 10:47:56,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:56,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:56,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:47:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:56,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:47:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:56,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:47:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:56,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:47:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:47:56,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:56,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328885863] [2022-11-20 10:47:56,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328885863] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:56,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:56,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:56,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764346491] [2022-11-20 10:47:56,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:56,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:47:56,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:56,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:47:56,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:47:56,849 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:47:56,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:56,970 INFO L93 Difference]: Finished difference Result 147 states and 189 transitions. [2022-11-20 10:47:56,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:56,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-11-20 10:47:56,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:56,974 INFO L225 Difference]: With dead ends: 147 [2022-11-20 10:47:56,975 INFO L226 Difference]: Without dead ends: 110 [2022-11-20 10:47:56,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:56,977 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 10 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:56,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 339 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:56,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-20 10:47:56,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2022-11-20 10:47:56,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-20 10:47:56,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2022-11-20 10:47:56,993 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 31 [2022-11-20 10:47:56,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:56,994 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2022-11-20 10:47:56,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:47:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2022-11-20 10:47:56,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-20 10:47:56,995 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:56,996 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:56,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:47:56,996 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:47:56,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:56,997 INFO L85 PathProgramCache]: Analyzing trace with hash -2124622107, now seen corresponding path program 1 times [2022-11-20 10:47:56,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:56,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727875606] [2022-11-20 10:47:56,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:56,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:57,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:47:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:57,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:47:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:57,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:47:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:57,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:47:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:58,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:47:58,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:58,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727875606] [2022-11-20 10:47:58,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727875606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:58,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:58,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:47:58,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224876165] [2022-11-20 10:47:58,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:58,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:47:58,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:58,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:47:58,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:47:58,047 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:47:58,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:58,247 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2022-11-20 10:47:58,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:47:58,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-11-20 10:47:58,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:58,257 INFO L225 Difference]: With dead ends: 134 [2022-11-20 10:47:58,257 INFO L226 Difference]: Without dead ends: 96 [2022-11-20 10:47:58,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:47:58,264 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 46 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:58,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 456 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:47:58,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-20 10:47:58,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-11-20 10:47:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-20 10:47:58,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2022-11-20 10:47:58,285 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 31 [2022-11-20 10:47:58,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:58,286 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2022-11-20 10:47:58,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:47:58,287 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-11-20 10:47:58,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 10:47:58,299 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:58,299 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:58,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:47:58,300 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:47:58,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:58,300 INFO L85 PathProgramCache]: Analyzing trace with hash 966724818, now seen corresponding path program 1 times [2022-11-20 10:47:58,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:58,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040540089] [2022-11-20 10:47:58,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:58,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:58,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:47:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:58,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:47:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:58,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:47:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:58,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:47:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:47:58,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:58,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040540089] [2022-11-20 10:47:58,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040540089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:58,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:58,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:47:58,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353095393] [2022-11-20 10:47:58,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:58,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:47:58,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:58,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:47:58,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:47:58,823 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 10:47:58,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:58,860 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2022-11-20 10:47:58,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:58,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-11-20 10:47:58,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:58,862 INFO L225 Difference]: With dead ends: 141 [2022-11-20 10:47:58,862 INFO L226 Difference]: Without dead ends: 106 [2022-11-20 10:47:58,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:58,864 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 29 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:58,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 320 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:47:58,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-20 10:47:58,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2022-11-20 10:47:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-20 10:47:58,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2022-11-20 10:47:58,877 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 37 [2022-11-20 10:47:58,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:58,878 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2022-11-20 10:47:58,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 10:47:58,878 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2022-11-20 10:47:58,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-20 10:47:58,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:58,880 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:58,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:47:58,880 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:47:58,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:58,881 INFO L85 PathProgramCache]: Analyzing trace with hash 265660240, now seen corresponding path program 1 times [2022-11-20 10:47:58,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:58,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035953183] [2022-11-20 10:47:58,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:58,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:59,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:47:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:59,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:47:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:59,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:47:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:59,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:47:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:47:59,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:59,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035953183] [2022-11-20 10:47:59,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035953183] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:59,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:59,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:47:59,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685873092] [2022-11-20 10:47:59,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:59,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:47:59,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:59,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:47:59,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:47:59,917 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 10:47:59,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:59,999 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2022-11-20 10:48:00,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:48:00,000 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-11-20 10:48:00,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:00,002 INFO L225 Difference]: With dead ends: 110 [2022-11-20 10:48:00,003 INFO L226 Difference]: Without dead ends: 108 [2022-11-20 10:48:00,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:48:00,004 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 23 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:00,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 726 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:48:00,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-20 10:48:00,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2022-11-20 10:48:00,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 75 states have internal predecessors, (85), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2022-11-20 10:48:00,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2022-11-20 10:48:00,015 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 37 [2022-11-20 10:48:00,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:00,015 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2022-11-20 10:48:00,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 10:48:00,016 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2022-11-20 10:48:00,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 10:48:00,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:00,017 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:00,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:48:00,017 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:00,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:00,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1062822234, now seen corresponding path program 1 times [2022-11-20 10:48:00,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:00,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025367638] [2022-11-20 10:48:00,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:00,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:01,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:01,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:48:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:01,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:01,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:48:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:48:01,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:01,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025367638] [2022-11-20 10:48:01,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025367638] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:01,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:01,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:48:01,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794911300] [2022-11-20 10:48:01,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:01,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:48:01,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:01,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:48:01,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:48:01,384 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:48:01,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:01,812 INFO L93 Difference]: Finished difference Result 184 states and 229 transitions. [2022-11-20 10:48:01,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:48:01,813 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-11-20 10:48:01,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:01,815 INFO L225 Difference]: With dead ends: 184 [2022-11-20 10:48:01,816 INFO L226 Difference]: Without dead ends: 143 [2022-11-20 10:48:01,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:48:01,818 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 80 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:01,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 633 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:48:01,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-20 10:48:01,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 121. [2022-11-20 10:48:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 86 states have (on average 1.186046511627907) internal successors, (102), 89 states have internal predecessors, (102), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2022-11-20 10:48:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 146 transitions. [2022-11-20 10:48:01,835 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 146 transitions. Word has length 41 [2022-11-20 10:48:01,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:01,836 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 146 transitions. [2022-11-20 10:48:01,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:48:01,837 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 146 transitions. [2022-11-20 10:48:01,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 10:48:01,838 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:01,838 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:01,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:48:01,839 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:01,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:01,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1952281384, now seen corresponding path program 1 times [2022-11-20 10:48:01,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:01,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956192813] [2022-11-20 10:48:01,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:01,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:02,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:02,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:48:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:02,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:02,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:48:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:48:03,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:03,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956192813] [2022-11-20 10:48:03,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956192813] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:03,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:03,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:48:03,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890552004] [2022-11-20 10:48:03,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:03,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:48:03,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:03,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:48:03,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:48:03,262 INFO L87 Difference]: Start difference. First operand 121 states and 146 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:48:03,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:03,637 INFO L93 Difference]: Finished difference Result 210 states and 261 transitions. [2022-11-20 10:48:03,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:48:03,638 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-11-20 10:48:03,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:03,639 INFO L225 Difference]: With dead ends: 210 [2022-11-20 10:48:03,640 INFO L226 Difference]: Without dead ends: 155 [2022-11-20 10:48:03,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:48:03,641 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 56 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:03,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 622 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:48:03,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-20 10:48:03,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 123. [2022-11-20 10:48:03,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 91 states have internal predecessors, (105), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2022-11-20 10:48:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2022-11-20 10:48:03,655 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 41 [2022-11-20 10:48:03,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:03,656 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2022-11-20 10:48:03,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:48:03,657 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2022-11-20 10:48:03,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 10:48:03,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:03,658 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:03,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:48:03,659 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:03,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:03,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1694115946, now seen corresponding path program 1 times [2022-11-20 10:48:03,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:03,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607919319] [2022-11-20 10:48:03,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:03,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:06,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:06,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:48:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:06,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:06,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:48:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:06,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:48:06,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:06,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607919319] [2022-11-20 10:48:06,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607919319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:06,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:06,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-20 10:48:06,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624219738] [2022-11-20 10:48:06,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:06,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 10:48:06,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:06,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 10:48:06,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:48:06,687 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 10:48:07,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:07,434 INFO L93 Difference]: Finished difference Result 212 states and 270 transitions. [2022-11-20 10:48:07,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:48:07,434 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2022-11-20 10:48:07,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:07,436 INFO L225 Difference]: With dead ends: 212 [2022-11-20 10:48:07,436 INFO L226 Difference]: Without dead ends: 155 [2022-11-20 10:48:07,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-11-20 10:48:07,438 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 245 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:07,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 568 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:48:07,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-20 10:48:07,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 137. [2022-11-20 10:48:07,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 100 states have (on average 1.21) internal successors, (121), 105 states have internal predecessors, (121), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (27), 20 states have call predecessors, (27), 21 states have call successors, (27) [2022-11-20 10:48:07,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 170 transitions. [2022-11-20 10:48:07,457 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 170 transitions. Word has length 41 [2022-11-20 10:48:07,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:07,458 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 170 transitions. [2022-11-20 10:48:07,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 10:48:07,458 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2022-11-20 10:48:07,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 10:48:07,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:07,460 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:07,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:48:07,460 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:07,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:07,461 INFO L85 PathProgramCache]: Analyzing trace with hash -267360230, now seen corresponding path program 1 times [2022-11-20 10:48:07,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:07,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959571443] [2022-11-20 10:48:07,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:07,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:08,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:08,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:48:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:08,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:08,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:48:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:48:08,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:08,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959571443] [2022-11-20 10:48:08,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959571443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:08,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:08,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:48:08,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744434871] [2022-11-20 10:48:08,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:08,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:48:08,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:08,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:48:08,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:48:08,482 INFO L87 Difference]: Start difference. First operand 137 states and 170 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 10:48:08,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:08,620 INFO L93 Difference]: Finished difference Result 225 states and 287 transitions. [2022-11-20 10:48:08,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:48:08,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2022-11-20 10:48:08,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:08,623 INFO L225 Difference]: With dead ends: 225 [2022-11-20 10:48:08,623 INFO L226 Difference]: Without dead ends: 156 [2022-11-20 10:48:08,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:48:08,626 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 32 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:08,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 340 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:48:08,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-20 10:48:08,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 138. [2022-11-20 10:48:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 101 states have (on average 1.198019801980198) internal successors, (121), 106 states have internal predecessors, (121), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (27), 20 states have call predecessors, (27), 21 states have call successors, (27) [2022-11-20 10:48:08,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 170 transitions. [2022-11-20 10:48:08,652 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 170 transitions. Word has length 41 [2022-11-20 10:48:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:08,653 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 170 transitions. [2022-11-20 10:48:08,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 10:48:08,653 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 170 transitions. [2022-11-20 10:48:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 10:48:08,654 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:08,654 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:08,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:48:08,655 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:08,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:08,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1627279489, now seen corresponding path program 1 times [2022-11-20 10:48:08,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:08,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30629019] [2022-11-20 10:48:08,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:08,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:09,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:09,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:48:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:09,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:09,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:48:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:09,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:48:09,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:09,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30629019] [2022-11-20 10:48:09,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30629019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:09,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:09,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:48:09,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720590921] [2022-11-20 10:48:09,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:09,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:48:09,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:09,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:48:09,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:48:09,878 INFO L87 Difference]: Start difference. First operand 138 states and 170 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 10:48:10,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:10,073 INFO L93 Difference]: Finished difference Result 164 states and 199 transitions. [2022-11-20 10:48:10,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:48:10,075 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-11-20 10:48:10,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:10,077 INFO L225 Difference]: With dead ends: 164 [2022-11-20 10:48:10,078 INFO L226 Difference]: Without dead ends: 162 [2022-11-20 10:48:10,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-20 10:48:10,079 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 31 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:10,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 925 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:48:10,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-20 10:48:10,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2022-11-20 10:48:10,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 108 states have (on average 1.1851851851851851) internal successors, (128), 114 states have internal predecessors, (128), 22 states have call successors, (22), 11 states have call predecessors, (22), 15 states have return successors, (29), 20 states have call predecessors, (29), 21 states have call successors, (29) [2022-11-20 10:48:10,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 179 transitions. [2022-11-20 10:48:10,101 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 179 transitions. Word has length 43 [2022-11-20 10:48:10,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:10,102 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 179 transitions. [2022-11-20 10:48:10,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 10:48:10,102 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2022-11-20 10:48:10,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 10:48:10,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:10,104 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:10,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:48:10,105 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:10,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:10,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1966623229, now seen corresponding path program 1 times [2022-11-20 10:48:10,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:10,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573285622] [2022-11-20 10:48:10,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:10,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:11,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:11,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:48:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:11,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:11,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:48:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:11,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:48:11,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:11,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573285622] [2022-11-20 10:48:11,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573285622] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:11,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:11,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:48:11,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541129658] [2022-11-20 10:48:11,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:11,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:48:11,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:11,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:48:11,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:48:11,410 INFO L87 Difference]: Start difference. First operand 146 states and 179 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:48:11,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:11,656 INFO L93 Difference]: Finished difference Result 250 states and 311 transitions. [2022-11-20 10:48:11,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:48:11,656 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2022-11-20 10:48:11,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:11,658 INFO L225 Difference]: With dead ends: 250 [2022-11-20 10:48:11,658 INFO L226 Difference]: Without dead ends: 172 [2022-11-20 10:48:11,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:48:11,659 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 46 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:11,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 458 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:48:11,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-20 10:48:11,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 139. [2022-11-20 10:48:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 102 states have (on average 1.196078431372549) internal successors, (122), 107 states have internal predecessors, (122), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-11-20 10:48:11,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 170 transitions. [2022-11-20 10:48:11,671 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 170 transitions. Word has length 43 [2022-11-20 10:48:11,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:11,672 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 170 transitions. [2022-11-20 10:48:11,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:48:11,672 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 170 transitions. [2022-11-20 10:48:11,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 10:48:11,673 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:11,673 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:11,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:48:11,674 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:11,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:11,674 INFO L85 PathProgramCache]: Analyzing trace with hash 598348136, now seen corresponding path program 1 times [2022-11-20 10:48:11,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:11,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274425744] [2022-11-20 10:48:11,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:11,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:12,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:12,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:48:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:12,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:12,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:48:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:12,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:48:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:12,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 10:48:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 10:48:12,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:12,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274425744] [2022-11-20 10:48:12,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274425744] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:12,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:12,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:48:12,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270157413] [2022-11-20 10:48:12,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:12,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:48:12,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:12,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:48:12,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:48:12,502 INFO L87 Difference]: Start difference. First operand 139 states and 170 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-20 10:48:12,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:12,608 INFO L93 Difference]: Finished difference Result 151 states and 184 transitions. [2022-11-20 10:48:12,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:48:12,609 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 57 [2022-11-20 10:48:12,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:12,611 INFO L225 Difference]: With dead ends: 151 [2022-11-20 10:48:12,611 INFO L226 Difference]: Without dead ends: 149 [2022-11-20 10:48:12,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:48:12,612 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 23 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:12,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 741 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:48:12,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-20 10:48:12,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2022-11-20 10:48:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.1851851851851851) internal successors, (128), 114 states have internal predecessors, (128), 23 states have call successors, (23), 12 states have call predecessors, (23), 16 states have return successors, (30), 21 states have call predecessors, (30), 22 states have call successors, (30) [2022-11-20 10:48:12,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 181 transitions. [2022-11-20 10:48:12,628 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 181 transitions. Word has length 57 [2022-11-20 10:48:12,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:12,629 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 181 transitions. [2022-11-20 10:48:12,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-20 10:48:12,629 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 181 transitions. [2022-11-20 10:48:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-20 10:48:12,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:12,631 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:12,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:48:12,632 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:12,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:12,632 INFO L85 PathProgramCache]: Analyzing trace with hash 803127154, now seen corresponding path program 1 times [2022-11-20 10:48:12,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:12,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32703460] [2022-11-20 10:48:12,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:12,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:13,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:13,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:48:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:13,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:13,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:48:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:13,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:48:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:13,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 10:48:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:48:14,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:14,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32703460] [2022-11-20 10:48:14,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32703460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:14,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:14,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:48:14,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376407102] [2022-11-20 10:48:14,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:14,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:48:14,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:14,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:48:14,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:48:14,099 INFO L87 Difference]: Start difference. First operand 148 states and 181 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:48:14,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:14,515 INFO L93 Difference]: Finished difference Result 191 states and 238 transitions. [2022-11-20 10:48:14,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:48:14,516 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 61 [2022-11-20 10:48:14,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:14,517 INFO L225 Difference]: With dead ends: 191 [2022-11-20 10:48:14,517 INFO L226 Difference]: Without dead ends: 178 [2022-11-20 10:48:14,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:48:14,519 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 132 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:14,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 603 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:48:14,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-20 10:48:14,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 157. [2022-11-20 10:48:14,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.173913043478261) internal successors, (135), 123 states have internal predecessors, (135), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (36), 21 states have call predecessors, (36), 23 states have call successors, (36) [2022-11-20 10:48:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2022-11-20 10:48:14,536 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 61 [2022-11-20 10:48:14,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:14,537 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 195 transitions. [2022-11-20 10:48:14,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:48:14,537 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2022-11-20 10:48:14,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-20 10:48:14,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:14,539 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:14,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:48:14,540 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:14,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:14,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2082990832, now seen corresponding path program 1 times [2022-11-20 10:48:14,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:14,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964827758] [2022-11-20 10:48:14,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:14,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:15,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:15,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:48:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:15,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:15,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:48:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:15,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:48:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:15,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 10:48:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:16,186 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:48:16,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:16,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964827758] [2022-11-20 10:48:16,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964827758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:16,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:16,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:48:16,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250251675] [2022-11-20 10:48:16,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:16,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:48:16,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:16,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:48:16,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:48:16,190 INFO L87 Difference]: Start difference. First operand 157 states and 195 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:48:16,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:16,565 INFO L93 Difference]: Finished difference Result 204 states and 252 transitions. [2022-11-20 10:48:16,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:48:16,566 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 61 [2022-11-20 10:48:16,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:16,567 INFO L225 Difference]: With dead ends: 204 [2022-11-20 10:48:16,568 INFO L226 Difference]: Without dead ends: 191 [2022-11-20 10:48:16,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:48:16,569 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 66 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:16,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 752 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:48:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-20 10:48:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 157. [2022-11-20 10:48:16,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.173913043478261) internal successors, (135), 123 states have internal predecessors, (135), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (36), 21 states have call predecessors, (36), 23 states have call successors, (36) [2022-11-20 10:48:16,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2022-11-20 10:48:16,601 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 61 [2022-11-20 10:48:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:16,601 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 195 transitions. [2022-11-20 10:48:16,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:48:16,602 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2022-11-20 10:48:16,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-20 10:48:16,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:16,603 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:16,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 10:48:16,604 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:16,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:16,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1953811026, now seen corresponding path program 1 times [2022-11-20 10:48:16,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:16,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020238182] [2022-11-20 10:48:16,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:16,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:18,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:18,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:48:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:18,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:18,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:48:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:18,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:48:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:18,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 10:48:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:19,091 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 10:48:19,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:19,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020238182] [2022-11-20 10:48:19,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020238182] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:48:19,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808333723] [2022-11-20 10:48:19,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:19,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:48:19,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:19,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:48:19,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:48:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:19,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 2455 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-20 10:48:19,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:48:20,975 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:48:20,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:48:21,643 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-20 10:48:21,644 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 25 [2022-11-20 10:48:21,665 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-20 10:48:21,665 INFO L350 Elim1Store]: Elim1 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 12 [2022-11-20 10:48:21,934 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-20 10:48:21,935 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 25 [2022-11-20 10:48:21,949 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-20 10:48:21,950 INFO L350 Elim1Store]: Elim1 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 12 [2022-11-20 10:48:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:48:22,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808333723] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:48:22,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:48:22,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 12] total 31 [2022-11-20 10:48:22,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886152011] [2022-11-20 10:48:22,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:48:22,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-20 10:48:22,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:22,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-20 10:48:22,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2022-11-20 10:48:22,013 INFO L87 Difference]: Start difference. First operand 157 states and 195 transitions. Second operand has 31 states, 30 states have (on average 3.2) internal successors, (96), 31 states have internal predecessors, (96), 8 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-11-20 10:48:24,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:24,151 INFO L93 Difference]: Finished difference Result 288 states and 345 transitions. [2022-11-20 10:48:24,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 10:48:24,152 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.2) internal successors, (96), 31 states have internal predecessors, (96), 8 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 61 [2022-11-20 10:48:24,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:24,153 INFO L225 Difference]: With dead ends: 288 [2022-11-20 10:48:24,154 INFO L226 Difference]: Without dead ends: 234 [2022-11-20 10:48:24,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 113 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=313, Invalid=1849, Unknown=0, NotChecked=0, Total=2162 [2022-11-20 10:48:24,157 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 382 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1765 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:24,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1765 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 795 Invalid, 0 Unknown, 178 Unchecked, 1.1s Time] [2022-11-20 10:48:24,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-11-20 10:48:24,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 207. [2022-11-20 10:48:24,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 153 states have (on average 1.1568627450980393) internal successors, (177), 162 states have internal predecessors, (177), 31 states have call successors, (31), 16 states have call predecessors, (31), 22 states have return successors, (43), 28 states have call predecessors, (43), 29 states have call successors, (43) [2022-11-20 10:48:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 251 transitions. [2022-11-20 10:48:24,180 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 251 transitions. Word has length 61 [2022-11-20 10:48:24,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:24,181 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 251 transitions. [2022-11-20 10:48:24,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.2) internal successors, (96), 31 states have internal predecessors, (96), 8 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-11-20 10:48:24,181 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 251 transitions. [2022-11-20 10:48:24,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-20 10:48:24,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:24,186 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:24,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:24,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 10:48:24,397 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:24,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:24,398 INFO L85 PathProgramCache]: Analyzing trace with hash 151989603, now seen corresponding path program 1 times [2022-11-20 10:48:24,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:24,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400923165] [2022-11-20 10:48:24,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:24,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:26,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:26,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:48:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:26,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:26,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:48:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:26,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:48:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:26,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 10:48:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:26,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 10:48:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 10:48:26,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:26,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400923165] [2022-11-20 10:48:26,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400923165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:26,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:26,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:48:26,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322971157] [2022-11-20 10:48:26,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:26,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:48:26,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:26,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:48:26,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:48:26,205 INFO L87 Difference]: Start difference. First operand 207 states and 251 transitions. Second operand has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-20 10:48:26,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:26,560 INFO L93 Difference]: Finished difference Result 225 states and 272 transitions. [2022-11-20 10:48:26,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:48:26,561 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2022-11-20 10:48:26,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:26,562 INFO L225 Difference]: With dead ends: 225 [2022-11-20 10:48:26,563 INFO L226 Difference]: Without dead ends: 223 [2022-11-20 10:48:26,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:48:26,564 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 41 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:26,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 570 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:48:26,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-20 10:48:26,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2022-11-20 10:48:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 160 states have (on average 1.15) internal successors, (184), 169 states have internal predecessors, (184), 34 states have call successors, (34), 18 states have call predecessors, (34), 24 states have return successors, (46), 31 states have call predecessors, (46), 32 states have call successors, (46) [2022-11-20 10:48:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 264 transitions. [2022-11-20 10:48:26,589 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 264 transitions. Word has length 63 [2022-11-20 10:48:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:26,590 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 264 transitions. [2022-11-20 10:48:26,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-20 10:48:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 264 transitions. [2022-11-20 10:48:26,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-20 10:48:26,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:26,593 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:26,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 10:48:26,594 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:26,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:26,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1802659993, now seen corresponding path program 1 times [2022-11-20 10:48:26,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:26,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215549994] [2022-11-20 10:48:26,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:26,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:27,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:27,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:48:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:27,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:27,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:48:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:27,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:48:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:27,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 10:48:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 10:48:27,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:27,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215549994] [2022-11-20 10:48:27,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215549994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:27,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:27,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:48:27,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623205592] [2022-11-20 10:48:27,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:27,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:48:27,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:27,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:48:27,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:48:27,708 INFO L87 Difference]: Start difference. First operand 219 states and 264 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-20 10:48:27,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:27,896 INFO L93 Difference]: Finished difference Result 247 states and 294 transitions. [2022-11-20 10:48:27,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:48:27,897 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2022-11-20 10:48:27,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:27,899 INFO L225 Difference]: With dead ends: 247 [2022-11-20 10:48:27,899 INFO L226 Difference]: Without dead ends: 245 [2022-11-20 10:48:27,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-20 10:48:27,900 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 31 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:27,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 946 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:48:27,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-11-20 10:48:27,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 227. [2022-11-20 10:48:27,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 167 states have (on average 1.1437125748502994) internal successors, (191), 177 states have internal predecessors, (191), 34 states have call successors, (34), 18 states have call predecessors, (34), 25 states have return successors, (47), 31 states have call predecessors, (47), 32 states have call successors, (47) [2022-11-20 10:48:27,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 272 transitions. [2022-11-20 10:48:27,929 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 272 transitions. Word has length 63 [2022-11-20 10:48:27,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:27,930 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 272 transitions. [2022-11-20 10:48:27,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-20 10:48:27,930 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 272 transitions. [2022-11-20 10:48:27,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-20 10:48:27,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:27,932 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:27,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 10:48:27,932 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:27,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:27,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1791242725, now seen corresponding path program 1 times [2022-11-20 10:48:27,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:27,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628213018] [2022-11-20 10:48:27,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:27,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:28,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:28,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:48:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:28,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:28,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:48:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:28,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:48:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:28,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 10:48:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:48:29,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:29,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628213018] [2022-11-20 10:48:29,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628213018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:29,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:29,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:48:29,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658868359] [2022-11-20 10:48:29,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:29,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:48:29,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:29,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:48:29,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:48:29,096 INFO L87 Difference]: Start difference. First operand 227 states and 272 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:48:29,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:29,423 INFO L93 Difference]: Finished difference Result 269 states and 317 transitions. [2022-11-20 10:48:29,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:48:29,424 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 63 [2022-11-20 10:48:29,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:29,425 INFO L225 Difference]: With dead ends: 269 [2022-11-20 10:48:29,426 INFO L226 Difference]: Without dead ends: 231 [2022-11-20 10:48:29,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:48:29,427 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 52 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:29,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 604 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:48:29,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-11-20 10:48:29,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 214. [2022-11-20 10:48:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 157 states have (on average 1.1464968152866242) internal successors, (180), 165 states have internal predecessors, (180), 33 states have call successors, (33), 18 states have call predecessors, (33), 23 states have return successors, (43), 30 states have call predecessors, (43), 31 states have call successors, (43) [2022-11-20 10:48:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 256 transitions. [2022-11-20 10:48:29,449 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 256 transitions. Word has length 63 [2022-11-20 10:48:29,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:29,450 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 256 transitions. [2022-11-20 10:48:29,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:48:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 256 transitions. [2022-11-20 10:48:29,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-20 10:48:29,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:29,452 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:29,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 10:48:29,452 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:29,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:29,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1204360676, now seen corresponding path program 1 times [2022-11-20 10:48:29,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:29,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035630216] [2022-11-20 10:48:29,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:29,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:30,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:30,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:48:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:30,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:30,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:48:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:30,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:48:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:30,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 10:48:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:30,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 10:48:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:30,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 10:48:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:30,762 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 10:48:30,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:30,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035630216] [2022-11-20 10:48:30,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035630216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:30,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:30,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:48:30,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248035111] [2022-11-20 10:48:30,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:30,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:48:30,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:30,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:48:30,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:48:30,766 INFO L87 Difference]: Start difference. First operand 214 states and 256 transitions. Second operand has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-20 10:48:31,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:31,018 INFO L93 Difference]: Finished difference Result 228 states and 270 transitions. [2022-11-20 10:48:31,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:48:31,019 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 69 [2022-11-20 10:48:31,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:31,021 INFO L225 Difference]: With dead ends: 228 [2022-11-20 10:48:31,021 INFO L226 Difference]: Without dead ends: 224 [2022-11-20 10:48:31,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:48:31,022 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 21 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:31,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 670 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:48:31,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-11-20 10:48:31,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2022-11-20 10:48:31,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 163 states have (on average 1.1349693251533743) internal successors, (185), 170 states have internal predecessors, (185), 34 states have call successors, (34), 20 states have call predecessors, (34), 24 states have return successors, (44), 31 states have call predecessors, (44), 32 states have call successors, (44) [2022-11-20 10:48:31,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 263 transitions. [2022-11-20 10:48:31,047 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 263 transitions. Word has length 69 [2022-11-20 10:48:31,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:31,048 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 263 transitions. [2022-11-20 10:48:31,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-20 10:48:31,048 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 263 transitions. [2022-11-20 10:48:31,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-20 10:48:31,050 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:31,050 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:31,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 10:48:31,051 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:31,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:31,051 INFO L85 PathProgramCache]: Analyzing trace with hash 348625887, now seen corresponding path program 1 times [2022-11-20 10:48:31,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:31,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771072401] [2022-11-20 10:48:31,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:31,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:33,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:33,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:48:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:33,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:33,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:48:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:33,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:48:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:33,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 10:48:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:33,875 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:48:33,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:33,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771072401] [2022-11-20 10:48:33,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771072401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:33,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:33,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-20 10:48:33,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476506247] [2022-11-20 10:48:33,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:33,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 10:48:33,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:33,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 10:48:33,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:48:33,877 INFO L87 Difference]: Start difference. First operand 222 states and 263 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:48:34,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:34,996 INFO L93 Difference]: Finished difference Result 280 states and 334 transitions. [2022-11-20 10:48:34,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:48:34,999 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 67 [2022-11-20 10:48:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:35,001 INFO L225 Difference]: With dead ends: 280 [2022-11-20 10:48:35,001 INFO L226 Difference]: Without dead ends: 254 [2022-11-20 10:48:35,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-11-20 10:48:35,003 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 230 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:35,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 571 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 10:48:35,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-11-20 10:48:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 227. [2022-11-20 10:48:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 166 states have (on average 1.1325301204819278) internal successors, (188), 173 states have internal predecessors, (188), 36 states have call successors, (36), 20 states have call predecessors, (36), 24 states have return successors, (47), 33 states have call predecessors, (47), 34 states have call successors, (47) [2022-11-20 10:48:35,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 271 transitions. [2022-11-20 10:48:35,033 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 271 transitions. Word has length 67 [2022-11-20 10:48:35,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:35,033 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 271 transitions. [2022-11-20 10:48:35,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 10:48:35,034 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 271 transitions. [2022-11-20 10:48:35,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-20 10:48:35,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:35,036 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:35,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 10:48:35,036 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:35,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:35,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2139701523, now seen corresponding path program 1 times [2022-11-20 10:48:35,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:35,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939172519] [2022-11-20 10:48:35,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:35,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:37,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:37,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:48:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:37,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:37,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:48:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:37,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:48:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:37,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 10:48:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:37,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 10:48:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:37,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 10:48:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:37,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:48:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:37,885 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-20 10:48:37,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:37,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939172519] [2022-11-20 10:48:37,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939172519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:37,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:37,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 10:48:37,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79890446] [2022-11-20 10:48:37,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:37,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:48:37,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:37,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:48:37,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:48:37,891 INFO L87 Difference]: Start difference. First operand 227 states and 271 transitions. Second operand has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 10:48:38,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:38,455 INFO L93 Difference]: Finished difference Result 235 states and 278 transitions. [2022-11-20 10:48:38,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:48:38,455 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 75 [2022-11-20 10:48:38,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:38,457 INFO L225 Difference]: With dead ends: 235 [2022-11-20 10:48:38,457 INFO L226 Difference]: Without dead ends: 154 [2022-11-20 10:48:38,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:48:38,459 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 158 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:38,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 648 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:48:38,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-20 10:48:38,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 140. [2022-11-20 10:48:38,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 100 states have (on average 1.17) internal successors, (117), 105 states have internal predecessors, (117), 24 states have call successors, (24), 12 states have call predecessors, (24), 15 states have return successors, (26), 22 states have call predecessors, (26), 22 states have call successors, (26) [2022-11-20 10:48:38,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 167 transitions. [2022-11-20 10:48:38,477 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 167 transitions. Word has length 75 [2022-11-20 10:48:38,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:38,478 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 167 transitions. [2022-11-20 10:48:38,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 10:48:38,478 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 167 transitions. [2022-11-20 10:48:38,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-20 10:48:38,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:38,481 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:38,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 10:48:38,481 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:38,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:38,482 INFO L85 PathProgramCache]: Analyzing trace with hash 35307555, now seen corresponding path program 1 times [2022-11-20 10:48:38,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:38,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541795584] [2022-11-20 10:48:38,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:38,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:38,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:38,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:48:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:38,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:38,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:48:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:38,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:48:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:38,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:48:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:38,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:48:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:38,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:48:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:38,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:48:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:39,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:48:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:39,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 10:48:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:39,084 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 10:48:39,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:39,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541795584] [2022-11-20 10:48:39,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541795584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:39,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:39,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:48:39,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022374488] [2022-11-20 10:48:39,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:39,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:48:39,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:39,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:48:39,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:48:39,089 INFO L87 Difference]: Start difference. First operand 140 states and 167 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-20 10:48:39,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:39,593 INFO L93 Difference]: Finished difference Result 243 states and 292 transitions. [2022-11-20 10:48:39,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:48:39,593 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 79 [2022-11-20 10:48:39,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:39,594 INFO L225 Difference]: With dead ends: 243 [2022-11-20 10:48:39,595 INFO L226 Difference]: Without dead ends: 153 [2022-11-20 10:48:39,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:48:39,596 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 61 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:39,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 254 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:48:39,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-20 10:48:39,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2022-11-20 10:48:39,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 104 states have (on average 1.1634615384615385) internal successors, (121), 109 states have internal predecessors, (121), 24 states have call successors, (24), 12 states have call predecessors, (24), 16 states have return successors, (27), 23 states have call predecessors, (27), 22 states have call successors, (27) [2022-11-20 10:48:39,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 172 transitions. [2022-11-20 10:48:39,611 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 172 transitions. Word has length 79 [2022-11-20 10:48:39,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:39,611 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 172 transitions. [2022-11-20 10:48:39,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-20 10:48:39,611 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 172 transitions. [2022-11-20 10:48:39,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-20 10:48:39,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:39,613 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:39,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 10:48:39,613 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:39,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:39,614 INFO L85 PathProgramCache]: Analyzing trace with hash -277501736, now seen corresponding path program 1 times [2022-11-20 10:48:39,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:39,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326251751] [2022-11-20 10:48:39,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:39,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:40,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:40,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:48:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:40,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:40,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:48:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:40,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:48:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:40,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:48:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:40,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:48:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:40,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:48:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:40,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:48:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:40,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:48:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:40,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:48:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:40,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:48:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 10:48:40,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:40,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326251751] [2022-11-20 10:48:40,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326251751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:40,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:40,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 10:48:40,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268804539] [2022-11-20 10:48:40,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:40,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:48:40,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:40,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:48:40,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:48:40,667 INFO L87 Difference]: Start difference. First operand 145 states and 172 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-20 10:48:41,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:41,641 INFO L93 Difference]: Finished difference Result 244 states and 298 transitions. [2022-11-20 10:48:41,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 10:48:41,642 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 85 [2022-11-20 10:48:41,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:41,644 INFO L225 Difference]: With dead ends: 244 [2022-11-20 10:48:41,644 INFO L226 Difference]: Without dead ends: 177 [2022-11-20 10:48:41,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-11-20 10:48:41,646 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 78 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:41,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 290 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 10:48:41,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-11-20 10:48:41,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 152. [2022-11-20 10:48:41,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 110 states have (on average 1.1636363636363636) internal successors, (128), 115 states have internal predecessors, (128), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (28), 24 states have call predecessors, (28), 22 states have call successors, (28) [2022-11-20 10:48:41,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 180 transitions. [2022-11-20 10:48:41,666 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 180 transitions. Word has length 85 [2022-11-20 10:48:41,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:41,667 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 180 transitions. [2022-11-20 10:48:41,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-20 10:48:41,667 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 180 transitions. [2022-11-20 10:48:41,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-20 10:48:41,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:41,670 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:41,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 10:48:41,671 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:41,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:41,671 INFO L85 PathProgramCache]: Analyzing trace with hash -58647018, now seen corresponding path program 1 times [2022-11-20 10:48:41,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:41,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076864003] [2022-11-20 10:48:41,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:41,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:41,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:41,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:48:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:41,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:41,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:48:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:42,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:48:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:42,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:48:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:42,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:48:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:42,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:48:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:42,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:48:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:42,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:48:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:42,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:48:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:42,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:48:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 10:48:42,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:42,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076864003] [2022-11-20 10:48:42,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076864003] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:42,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:42,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:48:42,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012899264] [2022-11-20 10:48:42,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:42,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:48:42,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:42,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:48:42,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:48:42,088 INFO L87 Difference]: Start difference. First operand 152 states and 180 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-20 10:48:42,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:42,554 INFO L93 Difference]: Finished difference Result 224 states and 264 transitions. [2022-11-20 10:48:42,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:48:42,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 85 [2022-11-20 10:48:42,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:42,556 INFO L225 Difference]: With dead ends: 224 [2022-11-20 10:48:42,556 INFO L226 Difference]: Without dead ends: 156 [2022-11-20 10:48:42,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:48:42,558 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 74 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:42,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 164 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:48:42,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-20 10:48:42,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2022-11-20 10:48:42,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 109 states have (on average 1.146788990825688) internal successors, (125), 114 states have internal predecessors, (125), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (28), 24 states have call predecessors, (28), 22 states have call successors, (28) [2022-11-20 10:48:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 177 transitions. [2022-11-20 10:48:42,576 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 177 transitions. Word has length 85 [2022-11-20 10:48:42,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:42,576 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 177 transitions. [2022-11-20 10:48:42,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-20 10:48:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 177 transitions. [2022-11-20 10:48:42,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-20 10:48:42,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:42,578 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:42,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 10:48:42,579 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:42,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:42,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2136981433, now seen corresponding path program 1 times [2022-11-20 10:48:42,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:42,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850841707] [2022-11-20 10:48:42,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:42,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:42,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:42,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:48:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:42,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:42,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:48:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:42,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:48:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:42,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:48:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:42,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:48:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:42,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:48:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:42,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:48:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:42,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:48:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:42,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:48:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:42,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-20 10:48:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-20 10:48:42,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:42,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850841707] [2022-11-20 10:48:42,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850841707] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:42,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:42,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:48:42,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305389438] [2022-11-20 10:48:42,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:42,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:48:42,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:42,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:48:42,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:48:42,928 INFO L87 Difference]: Start difference. First operand 151 states and 177 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-20 10:48:43,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:43,298 INFO L93 Difference]: Finished difference Result 211 states and 245 transitions. [2022-11-20 10:48:43,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:48:43,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 87 [2022-11-20 10:48:43,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:43,300 INFO L225 Difference]: With dead ends: 211 [2022-11-20 10:48:43,300 INFO L226 Difference]: Without dead ends: 100 [2022-11-20 10:48:43,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:48:43,301 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 65 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:43,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 157 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:48:43,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-20 10:48:43,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2022-11-20 10:48:43,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 71 states have internal predecessors, (74), 17 states have call successors, (17), 10 states have call predecessors, (17), 11 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-11-20 10:48:43,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2022-11-20 10:48:43,313 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 87 [2022-11-20 10:48:43,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:43,314 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2022-11-20 10:48:43,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-20 10:48:43,314 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2022-11-20 10:48:43,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-20 10:48:43,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:43,316 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:43,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-20 10:48:43,316 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:43,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:43,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1322477714, now seen corresponding path program 1 times [2022-11-20 10:48:43,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:43,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709023617] [2022-11-20 10:48:43,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:43,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:45,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:45,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:48:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:45,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:45,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:48:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:45,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:48:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:45,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:48:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:45,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:48:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:45,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:48:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:45,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:48:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:45,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:48:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:45,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:48:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:45,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:48:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:45,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 10:48:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:45,408 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-20 10:48:45,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:45,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709023617] [2022-11-20 10:48:45,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709023617] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:48:45,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:48:45,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 10:48:45,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124400321] [2022-11-20 10:48:45,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:48:45,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 10:48:45,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:45,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 10:48:45,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:48:45,411 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-11-20 10:48:46,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:46,196 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2022-11-20 10:48:46,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:48:46,197 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 90 [2022-11-20 10:48:46,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:46,198 INFO L225 Difference]: With dead ends: 152 [2022-11-20 10:48:46,198 INFO L226 Difference]: Without dead ends: 95 [2022-11-20 10:48:46,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2022-11-20 10:48:46,199 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 193 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:46,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 169 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 10:48:46,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-20 10:48:46,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-11-20 10:48:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 69 states have internal predecessors, (70), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-20 10:48:46,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2022-11-20 10:48:46,211 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 90 [2022-11-20 10:48:46,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:46,212 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2022-11-20 10:48:46,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-11-20 10:48:46,213 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2022-11-20 10:48:46,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-20 10:48:46,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:48:46,217 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:46,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-20 10:48:46,218 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:48:46,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:48:46,219 INFO L85 PathProgramCache]: Analyzing trace with hash -11289161, now seen corresponding path program 1 times [2022-11-20 10:48:46,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:48:46,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483314448] [2022-11-20 10:48:46,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:46,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:48:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:48,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:48:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:48,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:48:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:48,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:48:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:48,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:48:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:48,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:48:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:48,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:48:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:48,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 10:48:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:48,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:48:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:48,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 10:48:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:48,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:48:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:48,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:48:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:48,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:48:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:48,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 10:48:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:49,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 10:48:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:49,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 10:48:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:48:49,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:48:49,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483314448] [2022-11-20 10:48:49,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483314448] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:48:49,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392826941] [2022-11-20 10:48:49,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:48:49,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:48:49,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:48:49,907 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:48:49,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:48:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:48:50,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 2613 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-20 10:48:50,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:48:51,794 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-20 10:48:51,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:48:52,221 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-20 10:48:52,222 INFO L350 Elim1Store]: Elim1 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 19 [2022-11-20 10:48:52,394 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-20 10:48:52,395 INFO L350 Elim1Store]: Elim1 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 19 [2022-11-20 10:48:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-20 10:48:52,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392826941] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:48:52,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:48:52,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 10] total 33 [2022-11-20 10:48:52,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927648018] [2022-11-20 10:48:52,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:48:52,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 10:48:52,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:48:52,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 10:48:52,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2022-11-20 10:48:52,548 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 33 states, 31 states have (on average 4.516129032258065) internal successors, (140), 31 states have internal predecessors, (140), 11 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2022-11-20 10:48:54,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:48:54,584 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2022-11-20 10:48:54,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 10:48:54,585 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 4.516129032258065) internal successors, (140), 31 states have internal predecessors, (140), 11 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) Word has length 116 [2022-11-20 10:48:54,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:48:54,585 INFO L225 Difference]: With dead ends: 124 [2022-11-20 10:48:54,586 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 10:48:54,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 242 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=258, Invalid=1722, Unknown=0, NotChecked=0, Total=1980 [2022-11-20 10:48:54,587 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 271 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:48:54,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 517 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 680 Invalid, 0 Unknown, 152 Unchecked, 1.0s Time] [2022-11-20 10:48:54,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 10:48:54,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 10:48:54,588 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) [2022-11-20 10:48:54,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 10:48:54,589 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2022-11-20 10:48:54,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:48:54,589 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 10:48:54,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 4.516129032258065) internal successors, (140), 31 states have internal predecessors, (140), 11 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2022-11-20 10:48:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 10:48:54,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 10:48:54,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 10:48:54,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:48:54,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-20 10:48:54,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 10:48:58,325 INFO L895 garLoopResultBuilder]: At program point L6894(line 6894) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-11-20 10:48:58,325 INFO L895 garLoopResultBuilder]: At program point can_fail_mallocENTRY(lines 6893 6897) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-11-20 10:48:58,325 INFO L899 garLoopResultBuilder]: For program point L6896-1(line 6896) no Hoare annotation was computed. [2022-11-20 10:48:58,325 INFO L895 garLoopResultBuilder]: At program point L6896(line 6896) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-11-20 10:48:58,326 INFO L899 garLoopResultBuilder]: For program point L6894-3(lines 6894 6896) no Hoare annotation was computed. [2022-11-20 10:48:58,326 INFO L899 garLoopResultBuilder]: For program point L6894-1(lines 6894 6896) no Hoare annotation was computed. [2022-11-20 10:48:58,326 INFO L899 garLoopResultBuilder]: For program point can_fail_mallocFINAL(lines 6893 6897) no Hoare annotation was computed. [2022-11-20 10:48:58,326 INFO L899 garLoopResultBuilder]: For program point can_fail_mallocEXIT(lines 6893 6897) no Hoare annotation was computed. [2022-11-20 10:48:58,326 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6876 6881) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-11-20 10:48:58,326 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6876 6881) no Hoare annotation was computed. [2022-11-20 10:48:58,327 INFO L899 garLoopResultBuilder]: For program point L6877-1(lines 6877 6879) no Hoare annotation was computed. [2022-11-20 10:48:58,327 INFO L895 garLoopResultBuilder]: At program point L6877(lines 6877 6879) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-11-20 10:48:58,327 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6876 6881) no Hoare annotation was computed. [2022-11-20 10:48:58,327 INFO L895 garLoopResultBuilder]: At program point aws_mem_acquireENTRY(lines 6922 6932) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-11-20 10:48:58,327 INFO L899 garLoopResultBuilder]: For program point aws_mem_acquireEXIT(lines 6922 6932) no Hoare annotation was computed. [2022-11-20 10:48:58,327 INFO L899 garLoopResultBuilder]: For program point L6928-2(lines 6928 6930) no Hoare annotation was computed. [2022-11-20 10:48:58,328 INFO L899 garLoopResultBuilder]: For program point L6927(line 6927) no Hoare annotation was computed. [2022-11-20 10:48:58,328 INFO L899 garLoopResultBuilder]: For program point L6928(lines 6928 6930) no Hoare annotation was computed. [2022-11-20 10:48:58,328 INFO L899 garLoopResultBuilder]: For program point L6929-1(line 6929) no Hoare annotation was computed. [2022-11-20 10:48:58,328 INFO L895 garLoopResultBuilder]: At program point L6929(line 6929) the Hoare annotation is: (or (and (< 0 (+ aws_mem_acquire_~mem~0.offset 1)) (<= aws_mem_acquire_~mem~0.base 0) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (<= aws_mem_acquire_~mem~0.offset 0) (< 0 (+ aws_mem_acquire_~mem~0.base 1))) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-11-20 10:48:58,328 INFO L895 garLoopResultBuilder]: At program point L6923-1(line 6923) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-11-20 10:48:58,328 INFO L895 garLoopResultBuilder]: At program point L6923(line 6923) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-11-20 10:48:58,329 INFO L895 garLoopResultBuilder]: At program point L6925-1(line 6925) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-11-20 10:48:58,329 INFO L895 garLoopResultBuilder]: At program point L6925(line 6925) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-11-20 10:48:58,329 INFO L899 garLoopResultBuilder]: For program point aws_mem_acquireFINAL(lines 6922 6932) no Hoare annotation was computed. [2022-11-20 10:48:58,329 INFO L899 garLoopResultBuilder]: For program point L6923-2(line 6923) no Hoare annotation was computed. [2022-11-20 10:48:58,329 INFO L899 garLoopResultBuilder]: For program point L7162(line 7162) no Hoare annotation was computed. [2022-11-20 10:48:58,330 INFO L899 garLoopResultBuilder]: For program point L7162-4(line 7162) no Hoare annotation was computed. [2022-11-20 10:48:58,330 INFO L899 garLoopResultBuilder]: For program point L7162-3(line 7162) no Hoare annotation was computed. [2022-11-20 10:48:58,330 INFO L899 garLoopResultBuilder]: For program point L7162-2(line 7162) no Hoare annotation was computed. [2022-11-20 10:48:58,330 INFO L899 garLoopResultBuilder]: For program point L7162-8(line 7162) no Hoare annotation was computed. [2022-11-20 10:48:58,330 INFO L902 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7157 7163) the Hoare annotation is: true [2022-11-20 10:48:58,330 INFO L899 garLoopResultBuilder]: For program point L7162-6(line 7162) no Hoare annotation was computed. [2022-11-20 10:48:58,330 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7157 7163) no Hoare annotation was computed. [2022-11-20 10:48:58,331 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7157 7163) no Hoare annotation was computed. [2022-11-20 10:48:58,331 INFO L899 garLoopResultBuilder]: For program point L7159-1(line 7159) no Hoare annotation was computed. [2022-11-20 10:48:58,331 INFO L899 garLoopResultBuilder]: For program point L7159(lines 7159 7162) no Hoare annotation was computed. [2022-11-20 10:48:58,331 INFO L899 garLoopResultBuilder]: For program point L7159-4(lines 7159 7160) no Hoare annotation was computed. [2022-11-20 10:48:58,331 INFO L899 garLoopResultBuilder]: For program point L7159-3(line 7159) no Hoare annotation was computed. [2022-11-20 10:48:58,331 INFO L899 garLoopResultBuilder]: For program point L7159-9(lines 7159 7162) no Hoare annotation was computed. [2022-11-20 10:48:58,332 INFO L899 garLoopResultBuilder]: For program point L7159-7(lines 7159 7162) no Hoare annotation was computed. [2022-11-20 10:48:58,332 INFO L899 garLoopResultBuilder]: For program point L7159-6(lines 7159 7160) no Hoare annotation was computed. [2022-11-20 10:48:58,332 INFO L899 garLoopResultBuilder]: For program point L7159-11(lines 7159 7162) no Hoare annotation was computed. [2022-11-20 10:48:58,332 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-11-20 10:48:58,332 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-11-20 10:48:58,332 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-11-20 10:48:58,332 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-11-20 10:48:58,333 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-11-20 10:48:58,333 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-20 10:48:58,333 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-11-20 10:48:58,333 INFO L895 garLoopResultBuilder]: At program point aws_raise_errorENTRY(lines 1988 1999) the Hoare annotation is: (or (= ~tl_last_error~0 |old(~tl_last_error~0)|) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-11-20 10:48:58,333 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7101) no Hoare annotation was computed. [2022-11-20 10:48:58,333 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2022-11-20 10:48:58,334 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2022-11-20 10:48:58,334 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6883 6885) no Hoare annotation was computed. [2022-11-20 10:48:58,334 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6883 6885) no Hoare annotation was computed. [2022-11-20 10:48:58,334 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6883 6885) the Hoare annotation is: true [2022-11-20 10:48:58,334 INFO L899 garLoopResultBuilder]: For program point aws_allocator_is_validFINAL(lines 6917 6920) no Hoare annotation was computed. [2022-11-20 10:48:58,334 INFO L899 garLoopResultBuilder]: For program point L6919-1(line 6919) no Hoare annotation was computed. [2022-11-20 10:48:58,335 INFO L902 garLoopResultBuilder]: At program point L6919(line 6919) the Hoare annotation is: true [2022-11-20 10:48:58,335 INFO L902 garLoopResultBuilder]: At program point aws_allocator_is_validENTRY(lines 6917 6920) the Hoare annotation is: true [2022-11-20 10:48:58,335 INFO L899 garLoopResultBuilder]: For program point aws_allocator_is_validEXIT(lines 6917 6920) no Hoare annotation was computed. [2022-11-20 10:48:58,335 INFO L899 garLoopResultBuilder]: For program point L7117-2(lines 7117 7121) no Hoare annotation was computed. [2022-11-20 10:48:58,335 INFO L895 garLoopResultBuilder]: At program point L8752(line 8752) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24))) (and (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1141#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1141#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0))) [2022-11-20 10:48:58,336 INFO L899 garLoopResultBuilder]: For program point L8752-1(line 8752) no Hoare annotation was computed. [2022-11-20 10:48:58,336 INFO L899 garLoopResultBuilder]: For program point L7117(lines 7117 7118) no Hoare annotation was computed. [2022-11-20 10:48:58,336 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 10:48:58,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 10:48:58,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 10:48:58,337 INFO L895 garLoopResultBuilder]: At program point L7126(line 7126) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (let ((.cse0 (= (select .cse15 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse13 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse13)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse14 (select .cse15 (+ 16 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)))) (<= .cse14 (+ 18446744073709551615 (* (div (+ (- 1) .cse14) 18446744073709551616) 18446744073709551616)))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2022-11-20 10:48:58,337 INFO L902 garLoopResultBuilder]: At program point L8757(line 8757) the Hoare annotation is: true [2022-11-20 10:48:58,337 INFO L899 garLoopResultBuilder]: For program point L7126-2(line 7126) no Hoare annotation was computed. [2022-11-20 10:48:58,337 INFO L895 garLoopResultBuilder]: At program point L7126-1(line 7126) the Hoare annotation is: (let ((.cse19 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse18 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (let ((.cse0 (= (select .cse18 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse4 (<= 1 |ULTIMATE.start_aws_byte_buf_init_#t~ret587#1|)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 0)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.base| 0))) (.cse9 (<= |ULTIMATE.start_aws_byte_buf_init_#t~ret587#1| 1)) (.cse10 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse19) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse12 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse13 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse19))) (.cse14 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse15 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse16 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse16)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (let ((.cse17 (select .cse18 (+ 16 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)))) (<= .cse17 (+ 18446744073709551615 (* (div (+ (- 1) .cse17) 18446744073709551616) 18446744073709551616)))) .cse12 .cse13 .cse14 .cse15 .cse16)))) [2022-11-20 10:48:58,338 INFO L899 garLoopResultBuilder]: For program point L8749(lines 8749 8755) no Hoare annotation was computed. [2022-11-20 10:48:58,338 INFO L899 garLoopResultBuilder]: For program point L8749-2(lines 8749 8755) no Hoare annotation was computed. [2022-11-20 10:48:58,338 INFO L895 garLoopResultBuilder]: At program point L8753(line 8753) the Hoare annotation is: (and (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1142#1| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2022-11-20 10:48:58,338 INFO L899 garLoopResultBuilder]: For program point L8753-1(line 8753) no Hoare annotation was computed. [2022-11-20 10:48:58,338 INFO L899 garLoopResultBuilder]: For program point L8741(lines 8741 8756) no Hoare annotation was computed. [2022-11-20 10:48:58,339 INFO L899 garLoopResultBuilder]: For program point L7114-1(lines 7114 7116) no Hoare annotation was computed. [2022-11-20 10:48:58,339 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 10:48:58,339 INFO L895 garLoopResultBuilder]: At program point L7127(lines 7110 7128) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|))) (let ((.cse0 (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select .cse15 (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16))) (.cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse13 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse13)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (let ((.cse14 (select .cse15 16))) (or (<= .cse14 (+ 18446744073709551615 (* (div (+ (- 36028797018963968) .cse14) 18446744073709551616) 18446744073709551616))) (<= .cse14 (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) .cse14) 18446744073709551616)))))) .cse10 .cse11 .cse12 .cse13) (and .cse3 .cse4 .cse5 .cse7 .cse8 (<= (+ |ULTIMATE.start_aws_byte_buf_init_#res#1| 1) 0) .cse10 .cse11 (not (= (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) .cse12 .cse13)))) [2022-11-20 10:48:58,339 INFO L895 garLoopResultBuilder]: At program point L8754(line 8754) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= (+ |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (* (div |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1143#1| 18446744073709551616) 18446744073709551616)) (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1143#1|)) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2022-11-20 10:48:58,340 INFO L895 garLoopResultBuilder]: At program point L8746(line 8746) the Hoare annotation is: (and (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2022-11-20 10:48:58,340 INFO L899 garLoopResultBuilder]: For program point L8754-1(line 8754) no Hoare annotation was computed. [2022-11-20 10:48:58,340 INFO L895 garLoopResultBuilder]: At program point L7111-1(line 7111) the Hoare annotation is: (and (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2022-11-20 10:48:58,340 INFO L895 garLoopResultBuilder]: At program point L7111(line 7111) the Hoare annotation is: (and (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2022-11-20 10:48:58,340 INFO L899 garLoopResultBuilder]: For program point L8746-1(line 8746) no Hoare annotation was computed. [2022-11-20 10:48:58,341 INFO L899 garLoopResultBuilder]: For program point L8751-2(line 8751) no Hoare annotation was computed. [2022-11-20 10:48:58,341 INFO L899 garLoopResultBuilder]: For program point L7116-1(line 7116) no Hoare annotation was computed. [2022-11-20 10:48:58,341 INFO L895 garLoopResultBuilder]: At program point L7116(line 7116) the Hoare annotation is: (and (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (< (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2022-11-20 10:48:58,341 INFO L895 garLoopResultBuilder]: At program point L8751(line 8751) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|))) (let ((.cse0 (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select .cse15 (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse13 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse13)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (let ((.cse14 (select .cse15 16))) (or (<= .cse14 (+ 18446744073709551615 (* (div (+ (- 36028797018963968) .cse14) 18446744073709551616) 18446744073709551616))) (<= .cse14 (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) .cse14) 18446744073709551616)))))) .cse10 .cse11 .cse12 .cse13)))) [2022-11-20 10:48:58,342 INFO L895 garLoopResultBuilder]: At program point L8751-1(line 8751) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24))) (and (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (<= |ULTIMATE.start_aws_byte_buf_init_harness_#t~ret1140#1| 1) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (<= 1 |ULTIMATE.start_aws_byte_buf_init_harness_#t~ret1140#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0))) [2022-11-20 10:48:58,342 INFO L899 garLoopResultBuilder]: For program point L7112(lines 7110 7128) no Hoare annotation was computed. [2022-11-20 10:48:58,342 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-11-20 10:48:58,342 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-11-20 10:48:58,342 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-11-20 10:48:58,342 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-11-20 10:48:58,343 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-11-20 10:48:58,343 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-11-20 10:48:58,346 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:48:58,348 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:48:58,356 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 10:48:58,357 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 10:48:58,358 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 10:48:58,358 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 10:48:58,358 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 10:48:58,359 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 10:48:58,366 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 10:48:58,366 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 10:48:58,366 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 10:48:58,367 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 10:48:58,367 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 10:48:58,367 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 10:48:58,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:48:58 BoogieIcfgContainer [2022-11-20 10:48:58,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:48:58,371 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:48:58,371 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:48:58,371 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:48:58,372 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:47:55" (3/4) ... [2022-11-20 10:48:58,375 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 10:48:58,381 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_allocator_is_valid [2022-11-20 10:48:58,381 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_malloc [2022-11-20 10:48:58,382 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-11-20 10:48:58,382 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_acquire [2022-11-20 10:48:58,382 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2022-11-20 10:48:58,382 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-11-20 10:48:58,382 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-20 10:48:58,383 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-20 10:48:58,383 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2022-11-20 10:48:58,383 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-11-20 10:48:58,394 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 123 nodes and edges [2022-11-20 10:48:58,395 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2022-11-20 10:48:58,396 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-11-20 10:48:58,397 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-11-20 10:48:58,398 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-20 10:48:58,399 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-20 10:48:58,400 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 10:48:58,401 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 10:48:58,430 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && #memory_$Pointer$[buf][8 + buf] == 0) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && buf == buf) && allocator == allocator) && allocator == allocator) && #memory_$Pointer$[buf][8 + buf] == 0) && s_can_fail_allocator_static <= 0) || (((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && (unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + (-36028797018963968 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616 * 18446744073709551616 || unknown-#memory_int-unknown[buf][16] <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616))) && buf == buf) && allocator == allocator) && allocator == allocator) && s_can_fail_allocator_static <= 0)) || ((((((((((0 <= s_can_fail_allocator_static && buf == 0) && capacity == capacity) && buf == buf) && !(buf == 0)) && \result + 1 <= 0) && buf == buf) && allocator == allocator) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && allocator == allocator) && s_can_fail_allocator_static <= 0) [2022-11-20 10:48:58,910 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:48:58,911 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:48:58,911 INFO L158 Benchmark]: Toolchain (without parser) took 69131.15ms. Allocated memory was 138.4MB in the beginning and 1.1GB in the end (delta: 918.6MB). Free memory was 102.9MB in the beginning and 881.7MB in the end (delta: -778.8MB). Peak memory consumption was 689.0MB. Max. memory is 16.1GB. [2022-11-20 10:48:58,912 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 115.3MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:48:58,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3324.87ms. Allocated memory was 138.4MB in the beginning and 241.2MB in the end (delta: 102.8MB). Free memory was 102.7MB in the beginning and 182.0MB in the end (delta: -79.3MB). Peak memory consumption was 106.1MB. Max. memory is 16.1GB. [2022-11-20 10:48:58,913 INFO L158 Benchmark]: Boogie Procedure Inliner took 217.80ms. Allocated memory is still 241.2MB. Free memory was 182.0MB in the beginning and 171.6MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 10:48:58,913 INFO L158 Benchmark]: Boogie Preprocessor took 68.47ms. Allocated memory is still 241.2MB. Free memory was 171.6MB in the beginning and 165.4MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-20 10:48:58,913 INFO L158 Benchmark]: RCFGBuilder took 1893.43ms. Allocated memory is still 241.2MB. Free memory was 165.4MB in the beginning and 176.0MB in the end (delta: -10.6MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. [2022-11-20 10:48:58,914 INFO L158 Benchmark]: TraceAbstraction took 63078.21ms. Allocated memory was 241.2MB in the beginning and 1.1GB in the end (delta: 815.8MB). Free memory was 176.0MB in the beginning and 383.2MB in the end (delta: -207.2MB). Peak memory consumption was 608.6MB. Max. memory is 16.1GB. [2022-11-20 10:48:58,914 INFO L158 Benchmark]: Witness Printer took 539.62ms. Allocated memory is still 1.1GB. Free memory was 383.2MB in the beginning and 881.7MB in the end (delta: -498.6MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2022-11-20 10:48:58,916 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.26ms. Allocated memory is still 115.3MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3324.87ms. Allocated memory was 138.4MB in the beginning and 241.2MB in the end (delta: 102.8MB). Free memory was 102.7MB in the beginning and 182.0MB in the end (delta: -79.3MB). Peak memory consumption was 106.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 217.80ms. Allocated memory is still 241.2MB. Free memory was 182.0MB in the beginning and 171.6MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.47ms. Allocated memory is still 241.2MB. Free memory was 171.6MB in the beginning and 165.4MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1893.43ms. Allocated memory is still 241.2MB. Free memory was 165.4MB in the beginning and 176.0MB in the end (delta: -10.6MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. * TraceAbstraction took 63078.21ms. Allocated memory was 241.2MB in the beginning and 1.1GB in the end (delta: 815.8MB). Free memory was 176.0MB in the beginning and 383.2MB in the end (delta: -207.2MB). Peak memory consumption was 608.6MB. Max. memory is 16.1GB. * Witness Printer took 539.62ms. Allocated memory is still 1.1GB. Free memory was 383.2MB in the beginning and 881.7MB in the end (delta: -498.6MB). Peak memory consumption was 48.8MB. 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$.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$.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$.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$.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 * 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 11 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 63.0s, OverallIterations: 27, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2599 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2476 mSDsluCounter, 14929 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 330 IncrementalHoareTripleChecker+Unchecked, 12382 mSDsCounter, 581 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6166 IncrementalHoareTripleChecker+Invalid, 7077 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 581 mSolverCounterUnsat, 2547 mSDtfsCounter, 6166 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1062 GetRequests, 726 SyntacticMatches, 8 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=17, InterpolantAutomatonStates: 250, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 367 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 185 PreInvPairs, 212 NumberOfFragments, 1337 HoareAnnotationTreeSize, 185 FomulaSimplifications, 45 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 32 FomulaSimplificationsInter, 104329 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 39.3s InterpolantComputationTime, 1776 NumberOfCodeBlocks, 1776 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1922 ConstructedInterpolants, 38 QuantifiedInterpolants, 10990 SizeOfPredicates, 40 NumberOfNonLiveVariables, 5068 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 31 InterpolantComputations, 25 PerfectInterpolantSequences, 576/635 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: 7110]: Loop Invariant [2022-11-20 10:48:58,922 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 10:48:58,923 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 10:48:58,923 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 10:48:58,923 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 10:48:58,924 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 10:48:58,925 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 10:48:58,931 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 10:48:58,932 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 10:48:58,932 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 10:48:58,932 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 10:48:58,933 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 10:48:58,933 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && #memory_$Pointer$[buf][8 + buf] == 0) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && buf == buf) && allocator == allocator) && allocator == allocator) && #memory_$Pointer$[buf][8 + buf] == 0) && s_can_fail_allocator_static <= 0) || (((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && (unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + (-36028797018963968 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616 * 18446744073709551616 || unknown-#memory_int-unknown[buf][16] <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616))) && buf == buf) && allocator == allocator) && allocator == allocator) && s_can_fail_allocator_static <= 0)) || ((((((((((0 <= s_can_fail_allocator_static && buf == 0) && capacity == capacity) && buf == buf) && !(buf == 0)) && \result + 1 <= 0) && buf == buf) && allocator == allocator) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && allocator == allocator) && s_can_fail_allocator_static <= 0) - InvariantResult [Line: 8757]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-20 10:48:58,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeda15fe-dae7-4269-8221-e8ec6d8d31db/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE