./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 5e519f3a 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_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/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_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc --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-5e519f3 [2022-11-02 20:11:06,793 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:11:06,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:11:06,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:11:06,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:11:06,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:11:06,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:11:06,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:11:06,831 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:11:06,832 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:11:06,833 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:11:06,834 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:11:06,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:11:06,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:11:06,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:11:06,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:11:06,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:11:06,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:11:06,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:11:06,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:11:06,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:11:06,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:11:06,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:11:06,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:11:06,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:11:06,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:11:06,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:11:06,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:11:06,857 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:11:06,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:11:06,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:11:06,860 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:11:06,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:11:06,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:11:06,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:11:06,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:11:06,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:11:06,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:11:06,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:11:06,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:11:06,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:11:06,868 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:11:06,892 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:11:06,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:11:06,892 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:11:06,893 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:11:06,893 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:11:06,894 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:11:06,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:11:06,895 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:11:06,895 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:11:06,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:11:06,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:11:06,896 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:11:06,896 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:11:06,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:11:06,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:11:06,897 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:11:06,897 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:11:06,897 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:11:06,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:11:06,898 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:11:06,898 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:11:06,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:11:06,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:11:06,899 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:11:06,899 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:11:06,899 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:11:06,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:11:06,900 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:11:06,900 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:11:06,900 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:11:06,900 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_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/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_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc 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-02 20:11:07,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:11:07,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:11:07,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:11:07,202 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:11:07,203 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:11:07,204 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i [2022-11-02 20:11:07,279 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/data/99c7183b7/7765127fe5c1473b8d16358d25b1cb98/FLAG25dd58f93 [2022-11-02 20:11:08,186 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:11:08,187 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i [2022-11-02 20:11:08,227 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/data/99c7183b7/7765127fe5c1473b8d16358d25b1cb98/FLAG25dd58f93 [2022-11-02 20:11:08,648 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/data/99c7183b7/7765127fe5c1473b8d16358d25b1cb98 [2022-11-02 20:11:08,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:11:08,652 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:11:08,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:11:08,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:11:08,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:11:08,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:11:08" (1/1) ... [2022-11-02 20:11:08,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d71d0f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:11:08, skipping insertion in model container [2022-11-02 20:11:08,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:11:08" (1/1) ... [2022-11-02 20:11:08,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:11:08,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:11:09,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4491,4504] [2022-11-02 20:11:09,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4551,4564] [2022-11-02 20:11:10,039 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:11:10,040 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:11:10,041 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:11:10,042 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:11:10,043 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:11:10,079 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:11:10,080 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:11:10,082 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:11:10,083 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:11:10,475 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-02 20:11:10,477 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-02 20:11:10,478 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-02 20:11:10,479 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-02 20:11:10,481 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-02 20:11:10,481 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-02 20:11:10,482 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-02 20:11:10,483 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-02 20:11:10,484 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-02 20:11:10,484 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-02 20:11:10,672 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-02 20:11:10,775 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:11:10,782 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:11:10,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:11:11,038 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:11:11,065 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4491,4504] [2022-11-02 20:11:11,065 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4551,4564] [2022-11-02 20:11:11,126 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:11:11,127 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:11:11,128 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:11:11,132 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:11:11,133 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:11:11,138 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:11:11,139 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:11:11,141 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:11:11,141 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:11:11,195 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-02 20:11:11,196 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-02 20:11:11,197 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-02 20:11:11,197 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-02 20:11:11,198 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-02 20:11:11,198 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-02 20:11:11,199 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-02 20:11:11,200 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-02 20:11:11,200 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-02 20:11:11,201 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-02 20:11:11,235 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-02 20:11:11,302 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:11:11,303 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:11:11,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:11:11,610 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:11:11,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:11:11 WrapperNode [2022-11-02 20:11:11,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:11:11,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:11:11,613 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:11:11,613 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:11:11,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:11:11" (1/1) ... [2022-11-02 20:11:11,714 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:11:11" (1/1) ... [2022-11-02 20:11:11,772 INFO L138 Inliner]: procedures = 690, calls = 2496, calls flagged for inlining = 54, calls inlined = 5, statements flattened = 779 [2022-11-02 20:11:11,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:11:11,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:11:11,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:11:11,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:11:11,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:11:11" (1/1) ... [2022-11-02 20:11:11,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:11:11" (1/1) ... [2022-11-02 20:11:11,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:11:11" (1/1) ... [2022-11-02 20:11:11,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:11:11" (1/1) ... [2022-11-02 20:11:11,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:11:11" (1/1) ... [2022-11-02 20:11:11,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:11:11" (1/1) ... [2022-11-02 20:11:11,857 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:11:11" (1/1) ... [2022-11-02 20:11:11,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:11:11" (1/1) ... [2022-11-02 20:11:11,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:11:11,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:11:11,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:11:11,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:11:11,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:11:11" (1/1) ... [2022-11-02 20:11:11,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:11:11,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:11:11,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:11:11,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:11:11,966 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-11-02 20:11:11,966 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-11-02 20:11:11,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:11:11,967 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-02 20:11:11,967 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-02 20:11:11,967 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-11-02 20:11:11,968 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-11-02 20:11:11,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:11:11,968 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-11-02 20:11:11,968 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-11-02 20:11:11,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-02 20:11:11,970 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-02 20:11:11,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:11:11,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:11:11,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:11:11,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:11:11,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:11:11,971 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-02 20:11:11,971 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-02 20:11:11,971 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-11-02 20:11:11,971 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-11-02 20:11:11,971 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 20:11:11,972 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 20:11:11,972 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2022-11-02 20:11:11,972 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2022-11-02 20:11:11,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:11:11,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:11:11,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:11:11,973 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-11-02 20:11:11,973 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-11-02 20:11:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:11:11,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:11:12,301 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:11:12,303 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:11:13,577 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:11:13,584 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:11:13,593 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:11:13,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:11:13 BoogieIcfgContainer [2022-11-02 20:11:13,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:11:13,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:11:13,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:11:13,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:11:13,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:11:08" (1/3) ... [2022-11-02 20:11:13,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a6a45be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:11:13, skipping insertion in model container [2022-11-02 20:11:13,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:11:11" (2/3) ... [2022-11-02 20:11:13,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a6a45be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:11:13, skipping insertion in model container [2022-11-02 20:11:13,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:11:13" (3/3) ... [2022-11-02 20:11:13,608 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_init_harness.i [2022-11-02 20:11:13,628 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:11:13,628 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:11:13,715 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:11:13,726 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;@ae62151, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:11:13,727 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:11:13,735 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-02 20:11:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:11:13,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:13,746 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-02 20:11:13,746 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:13,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:13,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1013294361, now seen corresponding path program 1 times [2022-11-02 20:11:13,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:13,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846735316] [2022-11-02 20:11:13,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:13,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:14,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:14,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:14,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:14,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:14,459 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-02 20:11:14,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:14,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846735316] [2022-11-02 20:11:14,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846735316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:14,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:14,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:11:14,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723142220] [2022-11-02 20:11:14,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:14,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:11:14,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:14,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:11:14,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:11:14,530 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-02 20:11:14,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:14,600 INFO L93 Difference]: Finished difference Result 193 states and 252 transitions. [2022-11-02 20:11:14,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:11:14,602 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-02 20:11:14,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:14,613 INFO L225 Difference]: With dead ends: 193 [2022-11-02 20:11:14,614 INFO L226 Difference]: Without dead ends: 93 [2022-11-02 20:11:14,617 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-02 20:11:14,623 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-02 20:11:14,624 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-02 20:11:14,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-02 20:11:14,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-02 20:11:14,663 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-02 20:11:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2022-11-02 20:11:14,667 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 31 [2022-11-02 20:11:14,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:14,668 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2022-11-02 20:11:14,668 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-02 20:11:14,669 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2022-11-02 20:11:14,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:11:14,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:14,671 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-02 20:11:14,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:11:14,671 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:14,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:14,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1912179751, now seen corresponding path program 1 times [2022-11-02 20:11:14,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:14,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579101269] [2022-11-02 20:11:14,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:14,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:15,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:15,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:15,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:15,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:15,237 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-02 20:11:15,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:15,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579101269] [2022-11-02 20:11:15,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579101269] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:15,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:15,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:11:15,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140556408] [2022-11-02 20:11:15,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:15,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:11:15,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:15,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:11:15,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:11:15,241 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-02 20:11:15,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:15,360 INFO L93 Difference]: Finished difference Result 147 states and 189 transitions. [2022-11-02 20:11:15,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:11:15,361 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-02 20:11:15,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:15,366 INFO L225 Difference]: With dead ends: 147 [2022-11-02 20:11:15,366 INFO L226 Difference]: Without dead ends: 110 [2022-11-02 20:11:15,370 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-02 20:11:15,372 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 9 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:15,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 339 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:11:15,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-02 20:11:15,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2022-11-02 20:11:15,398 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-02 20:11:15,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2022-11-02 20:11:15,403 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 31 [2022-11-02 20:11:15,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:15,404 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2022-11-02 20:11:15,404 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-02 20:11:15,405 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2022-11-02 20:11:15,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:11:15,406 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:15,406 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-02 20:11:15,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:11:15,407 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:15,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:15,408 INFO L85 PathProgramCache]: Analyzing trace with hash -2124622107, now seen corresponding path program 1 times [2022-11-02 20:11:15,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:15,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741025895] [2022-11-02 20:11:15,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:15,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:16,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:16,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:16,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:16,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:16,158 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-02 20:11:16,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:16,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741025895] [2022-11-02 20:11:16,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741025895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:16,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:16,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:11:16,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548337689] [2022-11-02 20:11:16,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:16,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:11:16,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:16,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:11:16,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:11:16,163 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-02 20:11:16,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:16,287 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2022-11-02 20:11:16,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:11:16,288 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-02 20:11:16,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:16,293 INFO L225 Difference]: With dead ends: 134 [2022-11-02 20:11:16,293 INFO L226 Difference]: Without dead ends: 96 [2022-11-02 20:11:16,294 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-02 20:11:16,298 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-02 20:11:16,299 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-02 20:11:16,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-02 20:11:16,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-11-02 20:11:16,317 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-02 20:11:16,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2022-11-02 20:11:16,318 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 31 [2022-11-02 20:11:16,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:16,318 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2022-11-02 20:11:16,319 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-02 20:11:16,319 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-11-02 20:11:16,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:11:16,327 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:16,327 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-02 20:11:16,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:11:16,328 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:16,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:16,328 INFO L85 PathProgramCache]: Analyzing trace with hash 966724818, now seen corresponding path program 1 times [2022-11-02 20:11:16,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:16,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656725555] [2022-11-02 20:11:16,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:16,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:16,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:16,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:16,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:16,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:16,770 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-02 20:11:16,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:16,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656725555] [2022-11-02 20:11:16,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656725555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:16,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:16,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:11:16,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056218763] [2022-11-02 20:11:16,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:16,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:11:16,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:16,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:11:16,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:11:16,773 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-02 20:11:16,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:16,812 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2022-11-02 20:11:16,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:11:16,813 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-02 20:11:16,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:16,816 INFO L225 Difference]: With dead ends: 141 [2022-11-02 20:11:16,816 INFO L226 Difference]: Without dead ends: 106 [2022-11-02 20:11:16,818 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-02 20:11:16,819 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-02 20:11:16,821 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-02 20:11:16,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-02 20:11:16,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2022-11-02 20:11:16,842 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-02 20:11:16,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2022-11-02 20:11:16,843 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 37 [2022-11-02 20:11:16,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:16,846 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2022-11-02 20:11:16,846 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-02 20:11:16,846 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2022-11-02 20:11:16,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:11:16,847 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:16,847 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-02 20:11:16,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:11:16,848 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:16,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:16,849 INFO L85 PathProgramCache]: Analyzing trace with hash 265660240, now seen corresponding path program 1 times [2022-11-02 20:11:16,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:16,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912695942] [2022-11-02 20:11:16,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:16,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:17,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:17,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:17,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:17,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:17,988 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-02 20:11:17,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:17,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912695942] [2022-11-02 20:11:17,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912695942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:17,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:17,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:11:17,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964683045] [2022-11-02 20:11:17,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:17,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:11:17,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:17,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:11:17,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:11:17,993 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-02 20:11:18,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:18,094 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2022-11-02 20:11:18,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:11:18,095 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-02 20:11:18,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:18,098 INFO L225 Difference]: With dead ends: 110 [2022-11-02 20:11:18,098 INFO L226 Difference]: Without dead ends: 108 [2022-11-02 20:11:18,099 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-02 20:11:18,100 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 22 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:18,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 726 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:11:18,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-02 20:11:18,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2022-11-02 20:11:18,123 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-02 20:11:18,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2022-11-02 20:11:18,125 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 37 [2022-11-02 20:11:18,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:18,125 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2022-11-02 20:11:18,125 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-02 20:11:18,126 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2022-11-02 20:11:18,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:11:18,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:18,127 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-02 20:11:18,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:11:18,127 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:18,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:18,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1062822234, now seen corresponding path program 1 times [2022-11-02 20:11:18,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:18,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184291855] [2022-11-02 20:11:18,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:18,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:19,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:19,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:19,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:19,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:19,527 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-02 20:11:19,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:19,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184291855] [2022-11-02 20:11:19,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184291855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:19,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:19,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:11:19,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893395097] [2022-11-02 20:11:19,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:19,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:11:19,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:19,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:11:19,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:11:19,529 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-02 20:11:19,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:19,861 INFO L93 Difference]: Finished difference Result 184 states and 229 transitions. [2022-11-02 20:11:19,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:11:19,862 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-02 20:11:19,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:19,863 INFO L225 Difference]: With dead ends: 184 [2022-11-02 20:11:19,863 INFO L226 Difference]: Without dead ends: 143 [2022-11-02 20:11:19,864 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-02 20:11:19,864 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 78 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:19,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 633 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:11:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-02 20:11:19,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 121. [2022-11-02 20:11:19,872 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-02 20:11:19,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 146 transitions. [2022-11-02 20:11:19,873 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 146 transitions. Word has length 41 [2022-11-02 20:11:19,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:19,873 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 146 transitions. [2022-11-02 20:11:19,873 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-02 20:11:19,873 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 146 transitions. [2022-11-02 20:11:19,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:11:19,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:19,875 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-02 20:11:19,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:11:19,876 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:19,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:19,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1952281384, now seen corresponding path program 1 times [2022-11-02 20:11:19,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:19,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631576068] [2022-11-02 20:11:19,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:19,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:21,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:21,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:21,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:21,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:21,366 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-02 20:11:21,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:21,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631576068] [2022-11-02 20:11:21,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631576068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:21,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:21,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:11:21,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704107854] [2022-11-02 20:11:21,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:21,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:11:21,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:21,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:11:21,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:11:21,369 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-02 20:11:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:21,713 INFO L93 Difference]: Finished difference Result 210 states and 261 transitions. [2022-11-02 20:11:21,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:11:21,713 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-02 20:11:21,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:21,715 INFO L225 Difference]: With dead ends: 210 [2022-11-02 20:11:21,715 INFO L226 Difference]: Without dead ends: 155 [2022-11-02 20:11:21,715 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-02 20:11:21,716 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-02 20:11:21,716 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-02 20:11:21,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-02 20:11:21,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 123. [2022-11-02 20:11:21,725 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-02 20:11:21,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2022-11-02 20:11:21,726 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 41 [2022-11-02 20:11:21,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:21,727 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2022-11-02 20:11:21,727 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-02 20:11:21,727 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2022-11-02 20:11:21,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:11:21,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:21,729 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-02 20:11:21,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:11:21,729 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:21,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:21,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1694115946, now seen corresponding path program 1 times [2022-11-02 20:11:21,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:21,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486923687] [2022-11-02 20:11:21,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:21,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:24,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:24,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:24,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:24,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:24,699 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-02 20:11:24,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:24,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486923687] [2022-11-02 20:11:24,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486923687] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:24,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:24,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:11:24,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667882938] [2022-11-02 20:11:24,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:24,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:11:24,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:24,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:11:24,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:11:24,704 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-02 20:11:25,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:25,476 INFO L93 Difference]: Finished difference Result 212 states and 270 transitions. [2022-11-02 20:11:25,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:11:25,477 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-02 20:11:25,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:25,478 INFO L225 Difference]: With dead ends: 212 [2022-11-02 20:11:25,479 INFO L226 Difference]: Without dead ends: 155 [2022-11-02 20:11:25,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:11:25,480 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 237 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:25,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 568 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:11:25,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-02 20:11:25,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 137. [2022-11-02 20:11:25,499 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-02 20:11:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 170 transitions. [2022-11-02 20:11:25,501 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 170 transitions. Word has length 41 [2022-11-02 20:11:25,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:25,501 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 170 transitions. [2022-11-02 20:11:25,502 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-02 20:11:25,502 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2022-11-02 20:11:25,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:11:25,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:25,503 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-02 20:11:25,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:11:25,503 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:25,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:25,504 INFO L85 PathProgramCache]: Analyzing trace with hash -267360230, now seen corresponding path program 1 times [2022-11-02 20:11:25,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:25,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598602623] [2022-11-02 20:11:25,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:25,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:26,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:26,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:26,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:26,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:26,447 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-02 20:11:26,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:26,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598602623] [2022-11-02 20:11:26,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598602623] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:26,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:26,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:11:26,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971558832] [2022-11-02 20:11:26,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:26,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:11:26,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:26,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:11:26,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:11:26,450 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-02 20:11:26,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:26,592 INFO L93 Difference]: Finished difference Result 225 states and 287 transitions. [2022-11-02 20:11:26,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:11:26,593 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-02 20:11:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:26,597 INFO L225 Difference]: With dead ends: 225 [2022-11-02 20:11:26,597 INFO L226 Difference]: Without dead ends: 156 [2022-11-02 20:11:26,598 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-02 20:11:26,601 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 30 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:26,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 340 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:11:26,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-02 20:11:26,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 138. [2022-11-02 20:11:26,621 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-02 20:11:26,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 170 transitions. [2022-11-02 20:11:26,624 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 170 transitions. Word has length 41 [2022-11-02 20:11:26,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:26,625 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 170 transitions. [2022-11-02 20:11:26,625 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-02 20:11:26,625 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 170 transitions. [2022-11-02 20:11:26,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:11:26,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:26,626 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-02 20:11:26,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:11:26,627 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:26,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:26,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1627279489, now seen corresponding path program 1 times [2022-11-02 20:11:26,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:26,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764685300] [2022-11-02 20:11:26,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:26,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:27,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:27,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:27,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:27,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:27,831 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-02 20:11:27,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:27,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764685300] [2022-11-02 20:11:27,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764685300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:27,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:27,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:11:27,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35451630] [2022-11-02 20:11:27,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:27,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:11:27,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:27,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:11:27,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:11:27,834 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-02 20:11:27,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:27,988 INFO L93 Difference]: Finished difference Result 164 states and 199 transitions. [2022-11-02 20:11:27,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:11:27,989 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-02 20:11:27,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:27,991 INFO L225 Difference]: With dead ends: 164 [2022-11-02 20:11:27,991 INFO L226 Difference]: Without dead ends: 162 [2022-11-02 20:11:27,991 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-02 20:11:27,992 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 26 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:27,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 925 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:11:27,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-02 20:11:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2022-11-02 20:11:28,004 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-02 20:11:28,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 179 transitions. [2022-11-02 20:11:28,005 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 179 transitions. Word has length 43 [2022-11-02 20:11:28,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:28,006 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 179 transitions. [2022-11-02 20:11:28,006 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-02 20:11:28,006 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2022-11-02 20:11:28,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:11:28,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:28,007 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-02 20:11:28,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:11:28,008 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:28,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:28,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1966623229, now seen corresponding path program 1 times [2022-11-02 20:11:28,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:28,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055119427] [2022-11-02 20:11:28,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:28,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:29,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:29,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:29,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:29,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:29,280 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-02 20:11:29,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:29,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055119427] [2022-11-02 20:11:29,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055119427] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:29,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:29,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:11:29,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915731910] [2022-11-02 20:11:29,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:29,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:11:29,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:29,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:11:29,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:11:29,283 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-02 20:11:29,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:29,510 INFO L93 Difference]: Finished difference Result 250 states and 311 transitions. [2022-11-02 20:11:29,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:11:29,511 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-02 20:11:29,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:29,512 INFO L225 Difference]: With dead ends: 250 [2022-11-02 20:11:29,512 INFO L226 Difference]: Without dead ends: 172 [2022-11-02 20:11:29,513 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-02 20:11:29,513 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 44 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:29,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 458 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:11:29,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-02 20:11:29,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 139. [2022-11-02 20:11:29,526 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-02 20:11:29,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 170 transitions. [2022-11-02 20:11:29,527 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 170 transitions. Word has length 43 [2022-11-02 20:11:29,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:29,529 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 170 transitions. [2022-11-02 20:11:29,529 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-02 20:11:29,530 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 170 transitions. [2022-11-02 20:11:29,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-02 20:11:29,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:29,532 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-02 20:11:29,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:11:29,532 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:29,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:29,533 INFO L85 PathProgramCache]: Analyzing trace with hash 598348136, now seen corresponding path program 1 times [2022-11-02 20:11:29,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:29,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069303477] [2022-11-02 20:11:29,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:29,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:30,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:30,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:30,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:30,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:30,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:11:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:30,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:11:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:30,374 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-02 20:11:30,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:30,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069303477] [2022-11-02 20:11:30,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069303477] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:30,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:30,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:11:30,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580970446] [2022-11-02 20:11:30,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:30,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:11:30,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:30,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:11:30,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:11:30,377 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-02 20:11:30,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:30,458 INFO L93 Difference]: Finished difference Result 151 states and 184 transitions. [2022-11-02 20:11:30,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:11:30,459 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-02 20:11:30,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:30,462 INFO L225 Difference]: With dead ends: 151 [2022-11-02 20:11:30,462 INFO L226 Difference]: Without dead ends: 149 [2022-11-02 20:11:30,463 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-02 20:11:30,463 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 22 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:30,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 741 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:11:30,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-02 20:11:30,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2022-11-02 20:11:30,477 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-02 20:11:30,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 181 transitions. [2022-11-02 20:11:30,479 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 181 transitions. Word has length 57 [2022-11-02 20:11:30,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:30,479 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 181 transitions. [2022-11-02 20:11:30,479 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-02 20:11:30,480 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 181 transitions. [2022-11-02 20:11:30,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-02 20:11:30,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:30,481 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-02 20:11:30,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:11:30,481 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:30,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:30,482 INFO L85 PathProgramCache]: Analyzing trace with hash 803127154, now seen corresponding path program 1 times [2022-11-02 20:11:30,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:30,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99535330] [2022-11-02 20:11:30,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:30,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:31,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:31,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:31,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:31,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:31,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:11:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:31,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:11:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:31,850 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-02 20:11:31,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:31,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99535330] [2022-11-02 20:11:31,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99535330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:31,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:31,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:11:31,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136314531] [2022-11-02 20:11:31,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:31,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:11:31,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:31,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:11:31,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:11:31,853 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-02 20:11:32,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:32,196 INFO L93 Difference]: Finished difference Result 191 states and 238 transitions. [2022-11-02 20:11:32,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:11:32,198 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-02 20:11:32,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:32,199 INFO L225 Difference]: With dead ends: 191 [2022-11-02 20:11:32,199 INFO L226 Difference]: Without dead ends: 178 [2022-11-02 20:11:32,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:11:32,200 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 130 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:32,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 603 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:11:32,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-02 20:11:32,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 157. [2022-11-02 20:11:32,215 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-02 20:11:32,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2022-11-02 20:11:32,216 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 61 [2022-11-02 20:11:32,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:32,217 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 195 transitions. [2022-11-02 20:11:32,217 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-02 20:11:32,217 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2022-11-02 20:11:32,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-02 20:11:32,218 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:32,218 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-02 20:11:32,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:11:32,219 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:32,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:32,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2082990832, now seen corresponding path program 1 times [2022-11-02 20:11:32,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:32,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772647948] [2022-11-02 20:11:32,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:32,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:33,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:33,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:33,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:33,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:33,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:11:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:33,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:11:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:33,539 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-02 20:11:33,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:33,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772647948] [2022-11-02 20:11:33,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772647948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:33,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:33,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:11:33,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115058788] [2022-11-02 20:11:33,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:33,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:11:33,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:33,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:11:33,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:11:33,542 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-02 20:11:33,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:33,895 INFO L93 Difference]: Finished difference Result 204 states and 252 transitions. [2022-11-02 20:11:33,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:11:33,896 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-02 20:11:33,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:33,897 INFO L225 Difference]: With dead ends: 204 [2022-11-02 20:11:33,897 INFO L226 Difference]: Without dead ends: 191 [2022-11-02 20:11:33,898 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-02 20:11:33,899 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-02 20:11:33,899 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-02 20:11:33,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-02 20:11:33,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 157. [2022-11-02 20:11:33,916 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-02 20:11:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2022-11-02 20:11:33,919 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 61 [2022-11-02 20:11:33,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:33,919 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 195 transitions. [2022-11-02 20:11:33,919 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-02 20:11:33,920 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2022-11-02 20:11:33,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-02 20:11:33,921 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:33,923 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-02 20:11:33,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:11:33,924 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:33,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:33,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1953811026, now seen corresponding path program 1 times [2022-11-02 20:11:33,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:33,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458150877] [2022-11-02 20:11:33,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:33,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:35,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:35,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:35,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:35,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:35,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:11:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:35,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:11:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:36,197 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-02 20:11:36,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:36,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458150877] [2022-11-02 20:11:36,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458150877] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:11:36,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605800444] [2022-11-02 20:11:36,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:36,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:36,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:11:36,204 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:11:36,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:11:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:36,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 2459 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-02 20:11:36,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:11:37,870 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-02 20:11:37,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:11:38,425 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-02 20:11:38,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-11-02 20:11:38,438 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-02 20:11:38,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-11-02 20:11:38,609 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-02 20:11:38,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-11-02 20:11:38,624 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-02 20:11:38,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-11-02 20:11:38,676 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-02 20:11:38,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605800444] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:11:38,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:11:38,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 12] total 31 [2022-11-02 20:11:38,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475431624] [2022-11-02 20:11:38,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:11:38,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-02 20:11:38,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:38,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-02 20:11:38,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2022-11-02 20:11:38,679 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-02 20:11:40,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:40,500 INFO L93 Difference]: Finished difference Result 288 states and 345 transitions. [2022-11-02 20:11:40,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:11:40,502 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-02 20:11:40,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:40,504 INFO L225 Difference]: With dead ends: 288 [2022-11-02 20:11:40,504 INFO L226 Difference]: Without dead ends: 234 [2022-11-02 20:11:40,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 113 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=313, Invalid=1849, Unknown=0, NotChecked=0, Total=2162 [2022-11-02 20:11:40,506 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 382 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:40,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1765 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 795 Invalid, 0 Unknown, 178 Unchecked, 0.9s Time] [2022-11-02 20:11:40,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-11-02 20:11:40,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 207. [2022-11-02 20:11:40,530 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-02 20:11:40,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 251 transitions. [2022-11-02 20:11:40,532 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 251 transitions. Word has length 61 [2022-11-02 20:11:40,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:40,532 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 251 transitions. [2022-11-02 20:11:40,532 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-02 20:11:40,532 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 251 transitions. [2022-11-02 20:11:40,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 20:11:40,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:40,539 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-02 20:11:40,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:11:40,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 20:11:40,766 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:40,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:40,767 INFO L85 PathProgramCache]: Analyzing trace with hash 151989603, now seen corresponding path program 1 times [2022-11-02 20:11:40,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:40,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370480042] [2022-11-02 20:11:40,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:40,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:42,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:42,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:42,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:42,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:42,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:11:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:42,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:11:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:42,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:11:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:42,406 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-02 20:11:42,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:42,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370480042] [2022-11-02 20:11:42,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370480042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:42,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:42,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:11:42,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017051110] [2022-11-02 20:11:42,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:42,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:11:42,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:42,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:11:42,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:11:42,409 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-02 20:11:42,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:42,700 INFO L93 Difference]: Finished difference Result 225 states and 272 transitions. [2022-11-02 20:11:42,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:11:42,701 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-02 20:11:42,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:42,702 INFO L225 Difference]: With dead ends: 225 [2022-11-02 20:11:42,702 INFO L226 Difference]: Without dead ends: 223 [2022-11-02 20:11:42,703 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-02 20:11:42,704 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 39 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:42,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 570 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:11:42,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-02 20:11:42,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2022-11-02 20:11:42,724 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-02 20:11:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 264 transitions. [2022-11-02 20:11:42,726 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 264 transitions. Word has length 63 [2022-11-02 20:11:42,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:42,727 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 264 transitions. [2022-11-02 20:11:42,727 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-02 20:11:42,727 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 264 transitions. [2022-11-02 20:11:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 20:11:42,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:42,729 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-02 20:11:42,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:11:42,729 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:42,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:42,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1802659993, now seen corresponding path program 1 times [2022-11-02 20:11:42,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:42,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410743771] [2022-11-02 20:11:42,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:42,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:43,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:43,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:43,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:43,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:43,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:11:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:43,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:11:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:43,635 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-02 20:11:43,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:43,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410743771] [2022-11-02 20:11:43,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410743771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:43,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:43,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:11:43,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611347375] [2022-11-02 20:11:43,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:43,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:11:43,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:43,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:11:43,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:11:43,638 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-02 20:11:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:43,801 INFO L93 Difference]: Finished difference Result 247 states and 294 transitions. [2022-11-02 20:11:43,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:11:43,802 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-02 20:11:43,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:43,804 INFO L225 Difference]: With dead ends: 247 [2022-11-02 20:11:43,804 INFO L226 Difference]: Without dead ends: 245 [2022-11-02 20:11:43,804 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-02 20:11:43,805 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 26 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:43,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 946 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:11:43,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-11-02 20:11:43,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 227. [2022-11-02 20:11:43,825 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-02 20:11:43,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 272 transitions. [2022-11-02 20:11:43,827 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 272 transitions. Word has length 63 [2022-11-02 20:11:43,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:43,827 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 272 transitions. [2022-11-02 20:11:43,827 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-02 20:11:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 272 transitions. [2022-11-02 20:11:43,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 20:11:43,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:43,829 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-02 20:11:43,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:11:43,829 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:43,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:43,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1791242725, now seen corresponding path program 1 times [2022-11-02 20:11:43,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:43,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004124740] [2022-11-02 20:11:43,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:43,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:44,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:44,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:44,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:44,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:44,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:11:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:44,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:11:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:44,944 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-02 20:11:44,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:44,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004124740] [2022-11-02 20:11:44,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004124740] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:44,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:44,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:11:44,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331939409] [2022-11-02 20:11:44,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:44,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:11:44,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:44,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:11:44,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:11:44,947 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-02 20:11:45,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:45,237 INFO L93 Difference]: Finished difference Result 269 states and 317 transitions. [2022-11-02 20:11:45,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:11:45,237 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-02 20:11:45,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:45,239 INFO L225 Difference]: With dead ends: 269 [2022-11-02 20:11:45,239 INFO L226 Difference]: Without dead ends: 231 [2022-11-02 20:11:45,240 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-02 20:11:45,240 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 51 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:45,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 604 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:11:45,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-11-02 20:11:45,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 214. [2022-11-02 20:11:45,261 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-02 20:11:45,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 256 transitions. [2022-11-02 20:11:45,264 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 256 transitions. Word has length 63 [2022-11-02 20:11:45,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:45,264 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 256 transitions. [2022-11-02 20:11:45,265 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-02 20:11:45,265 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 256 transitions. [2022-11-02 20:11:45,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-02 20:11:45,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:45,267 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-02 20:11:45,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:11:45,268 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:45,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:45,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1204360676, now seen corresponding path program 1 times [2022-11-02 20:11:45,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:45,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589318612] [2022-11-02 20:11:45,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:45,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:46,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:46,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:46,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:46,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:46,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:11:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:46,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:11:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:46,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:11:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:46,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:11:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:46,509 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-02 20:11:46,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:46,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589318612] [2022-11-02 20:11:46,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589318612] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:46,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:46,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:11:46,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969821169] [2022-11-02 20:11:46,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:46,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:11:46,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:46,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:11:46,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:11:46,512 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-02 20:11:46,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:46,725 INFO L93 Difference]: Finished difference Result 228 states and 270 transitions. [2022-11-02 20:11:46,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:11:46,726 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-02 20:11:46,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:46,727 INFO L225 Difference]: With dead ends: 228 [2022-11-02 20:11:46,727 INFO L226 Difference]: Without dead ends: 224 [2022-11-02 20:11:46,728 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-02 20:11:46,729 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 20 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:46,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 670 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:11:46,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-11-02 20:11:46,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2022-11-02 20:11:46,749 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-02 20:11:46,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 263 transitions. [2022-11-02 20:11:46,751 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 263 transitions. Word has length 69 [2022-11-02 20:11:46,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:46,751 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 263 transitions. [2022-11-02 20:11:46,752 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-02 20:11:46,752 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 263 transitions. [2022-11-02 20:11:46,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-02 20:11:46,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:46,754 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-02 20:11:46,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:11:46,754 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:46,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:46,755 INFO L85 PathProgramCache]: Analyzing trace with hash 348625887, now seen corresponding path program 1 times [2022-11-02 20:11:46,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:46,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101075693] [2022-11-02 20:11:46,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:46,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:48,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:48,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:48,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:49,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:49,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:11:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:49,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:11:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:49,333 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-02 20:11:49,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:49,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101075693] [2022-11-02 20:11:49,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101075693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:49,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:49,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:11:49,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709884012] [2022-11-02 20:11:49,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:49,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:11:49,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:49,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:11:49,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:11:49,336 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-02 20:11:50,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:50,180 INFO L93 Difference]: Finished difference Result 280 states and 334 transitions. [2022-11-02 20:11:50,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:11:50,181 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-02 20:11:50,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:50,182 INFO L225 Difference]: With dead ends: 280 [2022-11-02 20:11:50,183 INFO L226 Difference]: Without dead ends: 254 [2022-11-02 20:11:50,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:11:50,185 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 222 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:50,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 571 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:11:50,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-11-02 20:11:50,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 227. [2022-11-02 20:11:50,221 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-02 20:11:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 271 transitions. [2022-11-02 20:11:50,223 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 271 transitions. Word has length 67 [2022-11-02 20:11:50,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:50,224 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 271 transitions. [2022-11-02 20:11:50,224 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-02 20:11:50,224 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 271 transitions. [2022-11-02 20:11:50,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-02 20:11:50,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:50,227 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-02 20:11:50,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:11:50,227 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:50,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:50,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2139701523, now seen corresponding path program 1 times [2022-11-02 20:11:50,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:50,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776912536] [2022-11-02 20:11:50,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:50,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:52,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:52,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:52,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:52,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:52,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:11:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:52,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:11:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:52,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:11:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:52,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:11:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:52,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:11:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:52,525 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-02 20:11:52,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:52,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776912536] [2022-11-02 20:11:52,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776912536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:52,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:52,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:11:52,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661224815] [2022-11-02 20:11:52,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:52,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:11:52,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:52,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:11:52,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:11:52,535 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-02 20:11:53,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:53,001 INFO L93 Difference]: Finished difference Result 235 states and 278 transitions. [2022-11-02 20:11:53,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:11:53,002 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-02 20:11:53,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:53,004 INFO L225 Difference]: With dead ends: 235 [2022-11-02 20:11:53,004 INFO L226 Difference]: Without dead ends: 154 [2022-11-02 20:11:53,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:11:53,006 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.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:53,006 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.3s Time] [2022-11-02 20:11:53,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-02 20:11:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 140. [2022-11-02 20:11:53,018 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-02 20:11:53,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 167 transitions. [2022-11-02 20:11:53,020 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 167 transitions. Word has length 75 [2022-11-02 20:11:53,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:53,020 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 167 transitions. [2022-11-02 20:11:53,020 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-02 20:11:53,020 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 167 transitions. [2022-11-02 20:11:53,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-02 20:11:53,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:53,023 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-02 20:11:53,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:11:53,023 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:53,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:53,024 INFO L85 PathProgramCache]: Analyzing trace with hash 35307555, now seen corresponding path program 1 times [2022-11-02 20:11:53,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:53,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809355187] [2022-11-02 20:11:53,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:53,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:53,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:53,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:53,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:53,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:11:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:53,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:11:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:53,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:11:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:53,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:11:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:53,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:11:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:53,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:53,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:11:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:53,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:11:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:53,558 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-02 20:11:53,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:53,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809355187] [2022-11-02 20:11:53,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809355187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:53,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:53,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:11:53,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319354834] [2022-11-02 20:11:53,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:53,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:11:53,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:53,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:11:53,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:11:53,561 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-02 20:11:54,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:54,031 INFO L93 Difference]: Finished difference Result 243 states and 292 transitions. [2022-11-02 20:11:54,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:11:54,034 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-02 20:11:54,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:54,035 INFO L225 Difference]: With dead ends: 243 [2022-11-02 20:11:54,035 INFO L226 Difference]: Without dead ends: 153 [2022-11-02 20:11:54,036 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-02 20:11:54,036 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 58 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:54,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 303 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:11:54,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-02 20:11:54,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2022-11-02 20:11:54,049 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-02 20:11:54,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 172 transitions. [2022-11-02 20:11:54,051 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 172 transitions. Word has length 79 [2022-11-02 20:11:54,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:54,051 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 172 transitions. [2022-11-02 20:11:54,051 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-02 20:11:54,051 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 172 transitions. [2022-11-02 20:11:54,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-02 20:11:54,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:54,053 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-02 20:11:54,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:11:54,053 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:54,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:54,054 INFO L85 PathProgramCache]: Analyzing trace with hash -277501736, now seen corresponding path program 1 times [2022-11-02 20:11:54,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:54,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92829123] [2022-11-02 20:11:54,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:54,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:54,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:54,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:54,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:54,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:11:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:55,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:11:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:55,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:11:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:55,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:11:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:55,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:11:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:55,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:55,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:11:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:55,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:11:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:55,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:11:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:55,167 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-02 20:11:55,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:55,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92829123] [2022-11-02 20:11:55,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92829123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:55,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:55,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:11:55,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410540825] [2022-11-02 20:11:55,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:55,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:11:55,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:55,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:11:55,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:11:55,170 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-02 20:11:55,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:55,947 INFO L93 Difference]: Finished difference Result 244 states and 298 transitions. [2022-11-02 20:11:55,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:11:55,948 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-02 20:11:55,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:55,949 INFO L225 Difference]: With dead ends: 244 [2022-11-02 20:11:55,949 INFO L226 Difference]: Without dead ends: 177 [2022-11-02 20:11:55,950 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-02 20:11:55,950 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 75 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:55,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 342 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:11:55,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-11-02 20:11:55,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 152. [2022-11-02 20:11:55,965 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-02 20:11:55,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 180 transitions. [2022-11-02 20:11:55,966 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 180 transitions. Word has length 85 [2022-11-02 20:11:55,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:55,966 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 180 transitions. [2022-11-02 20:11:55,967 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-02 20:11:55,967 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 180 transitions. [2022-11-02 20:11:55,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-02 20:11:55,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:55,968 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-02 20:11:55,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:11:55,969 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:55,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:55,969 INFO L85 PathProgramCache]: Analyzing trace with hash -58647018, now seen corresponding path program 1 times [2022-11-02 20:11:55,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:55,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660513719] [2022-11-02 20:11:55,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:55,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:56,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:56,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:56,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:56,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:11:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:56,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:11:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:56,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:11:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:56,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:11:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:56,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:11:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:56,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:56,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:11:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:56,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:11:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:56,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:11:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:56,340 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-02 20:11:56,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:56,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660513719] [2022-11-02 20:11:56,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660513719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:56,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:56,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:11:56,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171405223] [2022-11-02 20:11:56,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:56,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:11:56,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:56,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:11:56,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:11:56,343 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-02 20:11:56,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:56,752 INFO L93 Difference]: Finished difference Result 224 states and 264 transitions. [2022-11-02 20:11:56,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:11:56,752 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-02 20:11:56,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:56,754 INFO L225 Difference]: With dead ends: 224 [2022-11-02 20:11:56,754 INFO L226 Difference]: Without dead ends: 156 [2022-11-02 20:11:56,754 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-02 20:11:56,755 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 71 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:56,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 216 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:11:56,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-02 20:11:56,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2022-11-02 20:11:56,773 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-02 20:11:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 177 transitions. [2022-11-02 20:11:56,774 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 177 transitions. Word has length 85 [2022-11-02 20:11:56,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:56,775 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 177 transitions. [2022-11-02 20:11:56,775 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-02 20:11:56,775 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 177 transitions. [2022-11-02 20:11:56,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-02 20:11:56,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:56,777 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-02 20:11:56,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:11:56,777 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:56,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:56,778 INFO L85 PathProgramCache]: Analyzing trace with hash 2136981433, now seen corresponding path program 1 times [2022-11-02 20:11:56,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:56,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512741677] [2022-11-02 20:11:56,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:56,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:56,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:56,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:56,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:56,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:11:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:57,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:11:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:57,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:11:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:57,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:11:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:57,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:11:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:57,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:57,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:11:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:57,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:11:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:57,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:11:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:57,077 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-02 20:11:57,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:57,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512741677] [2022-11-02 20:11:57,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512741677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:57,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:57,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:11:57,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2867223] [2022-11-02 20:11:57,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:57,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:11:57,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:57,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:11:57,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:11:57,081 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-02 20:11:57,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:57,382 INFO L93 Difference]: Finished difference Result 211 states and 245 transitions. [2022-11-02 20:11:57,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:11:57,382 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-02 20:11:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:57,383 INFO L225 Difference]: With dead ends: 211 [2022-11-02 20:11:57,383 INFO L226 Difference]: Without dead ends: 100 [2022-11-02 20:11:57,384 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-02 20:11:57,384 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 63 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:57,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 209 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:11:57,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-02 20:11:57,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2022-11-02 20:11:57,393 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-02 20:11:57,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2022-11-02 20:11:57,394 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 87 [2022-11-02 20:11:57,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:57,395 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2022-11-02 20:11:57,395 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-02 20:11:57,395 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2022-11-02 20:11:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-02 20:11:57,396 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:57,397 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-02 20:11:57,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:11:57,397 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:11:57,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:57,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1322477714, now seen corresponding path program 1 times [2022-11-02 20:11:57,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:57,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324913112] [2022-11-02 20:11:57,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:57,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:59,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:11:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:59,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:11:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:59,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:11:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:59,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:11:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:59,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:11:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:59,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:11:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:59,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:11:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:59,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:11:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:59,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:11:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:59,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:11:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:59,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:11:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:59,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:11:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:59,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:11:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:59,523 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-02 20:11:59,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:59,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324913112] [2022-11-02 20:11:59,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324913112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:11:59,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:11:59,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:11:59,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456081583] [2022-11-02 20:11:59,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:11:59,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:11:59,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:59,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:11:59,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:11:59,526 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-02 20:12:00,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:12:00,252 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2022-11-02 20:12:00,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:12:00,253 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-02 20:12:00,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:12:00,254 INFO L225 Difference]: With dead ends: 152 [2022-11-02 20:12:00,254 INFO L226 Difference]: Without dead ends: 95 [2022-11-02 20:12:00,254 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-02 20:12:00,255 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 189 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:12:00,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 203 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:12:00,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-02 20:12:00,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-11-02 20:12:00,264 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-02 20:12:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2022-11-02 20:12:00,265 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 90 [2022-11-02 20:12:00,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:12:00,265 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2022-11-02 20:12:00,266 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-02 20:12:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2022-11-02 20:12:00,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-02 20:12:00,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:12:00,267 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-02 20:12:00,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:12:00,268 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:12:00,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:00,268 INFO L85 PathProgramCache]: Analyzing trace with hash -11289161, now seen corresponding path program 1 times [2022-11-02 20:12:00,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:00,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142597708] [2022-11-02 20:12:00,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:00,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:02,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:12:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:02,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:12:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:02,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:12:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:02,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:12:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:02,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:12:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:02,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:12:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:02,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:12:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:02,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:12:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:02,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:12:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:02,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:12:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:02,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:12:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:02,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:12:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:02,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:12:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:02,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-02 20:12:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:02,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:12:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:03,322 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-02 20:12:03,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:03,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142597708] [2022-11-02 20:12:03,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142597708] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:12:03,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612892525] [2022-11-02 20:12:03,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:03,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:12:03,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:12:03,327 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:12:03,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:12:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:03,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 2617 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-02 20:12:03,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:12:04,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-02 20:12:05,321 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-02 20:12:05,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:12:05,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612892525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:05,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:12:05,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 24 [2022-11-02 20:12:05,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235806960] [2022-11-02 20:12:05,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:05,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:12:05,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:05,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:12:05,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:12:05,325 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-02 20:12:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:12:05,494 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2022-11-02 20:12:05,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:12:05,494 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 116 [2022-11-02 20:12:05,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:12:05,495 INFO L225 Difference]: With dead ends: 95 [2022-11-02 20:12:05,495 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:12:05,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 132 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2022-11-02 20:12:05,496 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 20 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:12:05,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 394 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2022-11-02 20:12:05,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:12:05,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:12:05,497 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-02 20:12:05,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:12:05,497 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2022-11-02 20:12:05,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:12:05,498 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:12:05,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-02 20:12:05,498 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:12:05,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:12:05,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:12:05,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:12:05,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-02 20:12:05,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 20:12:09,112 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-02 20:12:09,112 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-02 20:12:09,113 INFO L899 garLoopResultBuilder]: For program point L6896-1(line 6896) no Hoare annotation was computed. [2022-11-02 20:12:09,113 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-02 20:12:09,113 INFO L899 garLoopResultBuilder]: For program point L6894-3(lines 6894 6896) no Hoare annotation was computed. [2022-11-02 20:12:09,113 INFO L899 garLoopResultBuilder]: For program point L6894-1(lines 6894 6896) no Hoare annotation was computed. [2022-11-02 20:12:09,113 INFO L899 garLoopResultBuilder]: For program point can_fail_mallocFINAL(lines 6893 6897) no Hoare annotation was computed. [2022-11-02 20:12:09,113 INFO L899 garLoopResultBuilder]: For program point can_fail_mallocEXIT(lines 6893 6897) no Hoare annotation was computed. [2022-11-02 20:12:09,113 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-02 20:12:09,113 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6876 6881) no Hoare annotation was computed. [2022-11-02 20:12:09,113 INFO L899 garLoopResultBuilder]: For program point L6877-1(lines 6877 6879) no Hoare annotation was computed. [2022-11-02 20:12:09,114 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-02 20:12:09,114 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6876 6881) no Hoare annotation was computed. [2022-11-02 20:12:09,114 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-02 20:12:09,114 INFO L899 garLoopResultBuilder]: For program point aws_mem_acquireEXIT(lines 6922 6932) no Hoare annotation was computed. [2022-11-02 20:12:09,114 INFO L899 garLoopResultBuilder]: For program point L6928-2(lines 6928 6930) no Hoare annotation was computed. [2022-11-02 20:12:09,114 INFO L899 garLoopResultBuilder]: For program point L6927(line 6927) no Hoare annotation was computed. [2022-11-02 20:12:09,114 INFO L899 garLoopResultBuilder]: For program point L6928(lines 6928 6930) no Hoare annotation was computed. [2022-11-02 20:12:09,114 INFO L899 garLoopResultBuilder]: For program point L6929-1(line 6929) no Hoare annotation was computed. [2022-11-02 20:12:09,114 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-02 20:12:09,114 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-02 20:12:09,115 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-02 20:12:09,115 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-02 20:12:09,115 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-02 20:12:09,115 INFO L899 garLoopResultBuilder]: For program point aws_mem_acquireFINAL(lines 6922 6932) no Hoare annotation was computed. [2022-11-02 20:12:09,115 INFO L899 garLoopResultBuilder]: For program point L6923-2(line 6923) no Hoare annotation was computed. [2022-11-02 20:12:09,115 INFO L899 garLoopResultBuilder]: For program point L7162(line 7162) no Hoare annotation was computed. [2022-11-02 20:12:09,115 INFO L899 garLoopResultBuilder]: For program point L7162-4(line 7162) no Hoare annotation was computed. [2022-11-02 20:12:09,115 INFO L899 garLoopResultBuilder]: For program point L7162-3(line 7162) no Hoare annotation was computed. [2022-11-02 20:12:09,115 INFO L899 garLoopResultBuilder]: For program point L7162-2(line 7162) no Hoare annotation was computed. [2022-11-02 20:12:09,116 INFO L899 garLoopResultBuilder]: For program point L7162-8(line 7162) no Hoare annotation was computed. [2022-11-02 20:12:09,116 INFO L902 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7157 7163) the Hoare annotation is: true [2022-11-02 20:12:09,116 INFO L899 garLoopResultBuilder]: For program point L7162-6(line 7162) no Hoare annotation was computed. [2022-11-02 20:12:09,116 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7157 7163) no Hoare annotation was computed. [2022-11-02 20:12:09,116 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7157 7163) no Hoare annotation was computed. [2022-11-02 20:12:09,116 INFO L899 garLoopResultBuilder]: For program point L7159-1(line 7159) no Hoare annotation was computed. [2022-11-02 20:12:09,116 INFO L899 garLoopResultBuilder]: For program point L7159(lines 7159 7162) no Hoare annotation was computed. [2022-11-02 20:12:09,116 INFO L899 garLoopResultBuilder]: For program point L7159-4(lines 7159 7160) no Hoare annotation was computed. [2022-11-02 20:12:09,116 INFO L899 garLoopResultBuilder]: For program point L7159-3(line 7159) no Hoare annotation was computed. [2022-11-02 20:12:09,116 INFO L899 garLoopResultBuilder]: For program point L7159-9(lines 7159 7162) no Hoare annotation was computed. [2022-11-02 20:12:09,116 INFO L899 garLoopResultBuilder]: For program point L7159-7(lines 7159 7162) no Hoare annotation was computed. [2022-11-02 20:12:09,117 INFO L899 garLoopResultBuilder]: For program point L7159-6(lines 7159 7160) no Hoare annotation was computed. [2022-11-02 20:12:09,117 INFO L899 garLoopResultBuilder]: For program point L7159-11(lines 7159 7162) no Hoare annotation was computed. [2022-11-02 20:12:09,117 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-11-02 20:12:09,117 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-11-02 20:12:09,117 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-11-02 20:12:09,117 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-11-02 20:12:09,117 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-11-02 20:12:09,117 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-02 20:12:09,117 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-11-02 20:12:09,117 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-02 20:12:09,118 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7101) no Hoare annotation was computed. [2022-11-02 20:12:09,118 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2022-11-02 20:12:09,118 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2022-11-02 20:12:09,118 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6883 6885) no Hoare annotation was computed. [2022-11-02 20:12:09,118 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6883 6885) no Hoare annotation was computed. [2022-11-02 20:12:09,118 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6883 6885) the Hoare annotation is: true [2022-11-02 20:12:09,118 INFO L899 garLoopResultBuilder]: For program point aws_allocator_is_validFINAL(lines 6917 6920) no Hoare annotation was computed. [2022-11-02 20:12:09,118 INFO L899 garLoopResultBuilder]: For program point L6919-1(line 6919) no Hoare annotation was computed. [2022-11-02 20:12:09,118 INFO L902 garLoopResultBuilder]: At program point L6919(line 6919) the Hoare annotation is: true [2022-11-02 20:12:09,118 INFO L902 garLoopResultBuilder]: At program point aws_allocator_is_validENTRY(lines 6917 6920) the Hoare annotation is: true [2022-11-02 20:12:09,118 INFO L899 garLoopResultBuilder]: For program point aws_allocator_is_validEXIT(lines 6917 6920) no Hoare annotation was computed. [2022-11-02 20:12:09,119 INFO L899 garLoopResultBuilder]: For program point L7117-2(lines 7117 7121) no Hoare annotation was computed. [2022-11-02 20:12:09,119 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 (= (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_~allocator~0#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1150#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_harness_#t~mem1150#1.offset|) (= |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-02 20:12:09,119 INFO L899 garLoopResultBuilder]: For program point L8752-1(line 8752) no Hoare annotation was computed. [2022-11-02 20:12:09,119 INFO L899 garLoopResultBuilder]: For program point L7117(lines 7117 7118) no Hoare annotation was computed. [2022-11-02 20:12:09,119 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 20:12:09,119 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-02 20:12:09,119 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-02 20:12:09,120 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_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-02 20:12:09,120 INFO L902 garLoopResultBuilder]: At program point L8757(line 8757) the Hoare annotation is: true [2022-11-02 20:12:09,120 INFO L899 garLoopResultBuilder]: For program point L7126-2(line 7126) no Hoare annotation was computed. [2022-11-02 20:12:09,120 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_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 .cse18 (+ 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 (<= 1 |ULTIMATE.start_aws_byte_buf_init_#t~ret591#1|)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse7 (not (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.base| 0))) (.cse8 (= (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|)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse10 (<= |ULTIMATE.start_aws_byte_buf_init_#t~ret591#1| 1)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse12 (= |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))) (.cse13 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.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 .cse12 (let ((.cse17 (select .cse18 16))) (or (<= .cse17 (+ 18446744073709551615 (* (div (+ (- 36028797018963968) .cse17) 18446744073709551616) 18446744073709551616))) (<= .cse17 (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) .cse17) 18446744073709551616)))))) .cse13 .cse14 .cse15 .cse16)))) [2022-11-02 20:12:09,120 INFO L899 garLoopResultBuilder]: For program point L8749(lines 8749 8755) no Hoare annotation was computed. [2022-11-02 20:12:09,120 INFO L899 garLoopResultBuilder]: For program point L8749-2(lines 8749 8755) no Hoare annotation was computed. [2022-11-02 20:12:09,120 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_~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_harness_#t~mem1151#1| 0) (= |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-02 20:12:09,121 INFO L899 garLoopResultBuilder]: For program point L8753-1(line 8753) no Hoare annotation was computed. [2022-11-02 20:12:09,121 INFO L899 garLoopResultBuilder]: For program point L8741(lines 8741 8756) no Hoare annotation was computed. [2022-11-02 20:12:09,121 INFO L899 garLoopResultBuilder]: For program point L7114-1(lines 7114 7116) no Hoare annotation was computed. [2022-11-02 20:12:09,121 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-02 20:12:09,121 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-02 20:12:09,121 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_~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_harness_#t~mem1152#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1152#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-02 20:12:09,121 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-02 20:12:09,121 INFO L899 garLoopResultBuilder]: For program point L8754-1(line 8754) no Hoare annotation was computed. [2022-11-02 20:12:09,122 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-02 20:12:09,122 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-02 20:12:09,122 INFO L899 garLoopResultBuilder]: For program point L8746-1(line 8746) no Hoare annotation was computed. [2022-11-02 20:12:09,122 INFO L899 garLoopResultBuilder]: For program point L8751-2(line 8751) no Hoare annotation was computed. [2022-11-02 20:12:09,122 INFO L899 garLoopResultBuilder]: For program point L7116-1(line 7116) no Hoare annotation was computed. [2022-11-02 20:12:09,124 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|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (or (<= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 36028797018963968) |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) 18446744073709551616)))) (<= |ULTIMATE.start_aws_byte_buf_init_~capacity#1| (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) 18446744073709551616))))) (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-02 20:12:09,125 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-02 20:12:09,125 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_~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_~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|) (<= 1 |ULTIMATE.start_aws_byte_buf_init_harness_#t~ret1149#1|) (<= |ULTIMATE.start_aws_byte_buf_init_harness_#t~ret1149#1| 1) (<= |~#s_can_fail_allocator_static~0.offset| 0))) [2022-11-02 20:12:09,125 INFO L899 garLoopResultBuilder]: For program point L7112(lines 7110 7128) no Hoare annotation was computed. [2022-11-02 20:12:09,125 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-11-02 20:12:09,125 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-11-02 20:12:09,126 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-11-02 20:12:09,126 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-11-02 20:12:09,126 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-11-02 20:12:09,126 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-11-02 20:12:09,129 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-02 20:12:09,131 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:12:09,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:12:09,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:12:09,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:12:09,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:12:09,141 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:12:09,142 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:12:09,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:12:09,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:12:09,149 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:12:09,150 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:12:09,150 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:12:09,150 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:12:09,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:12:09 BoogieIcfgContainer [2022-11-02 20:12:09,153 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:12:09,154 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:12:09,154 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:12:09,154 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:12:09,155 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:11:13" (3/4) ... [2022-11-02 20:12:09,158 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:12:09,164 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_allocator_is_valid [2022-11-02 20:12:09,164 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_malloc [2022-11-02 20:12:09,164 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-11-02 20:12:09,164 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_acquire [2022-11-02 20:12:09,164 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2022-11-02 20:12:09,165 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-11-02 20:12:09,165 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-02 20:12:09,165 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-02 20:12:09,165 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2022-11-02 20:12:09,165 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-11-02 20:12:09,177 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 123 nodes and edges [2022-11-02 20:12:09,179 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2022-11-02 20:12:09,180 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2022-11-02 20:12:09,181 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-11-02 20:12:09,182 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-02 20:12:09,183 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-02 20:12:09,184 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:12:09,185 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:12:09,215 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-02 20:12:09,875 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:12:09,876 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:12:09,876 INFO L158 Benchmark]: Toolchain (without parser) took 61224.46ms. Allocated memory was 102.8MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 63.9MB in the beginning and 737.5MB in the end (delta: -673.6MB). Peak memory consumption was 356.8MB. Max. memory is 16.1GB. [2022-11-02 20:12:09,876 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 102.8MB. Free memory was 57.2MB in the beginning and 57.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:12:09,877 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2955.48ms. Allocated memory was 102.8MB in the beginning and 144.7MB in the end (delta: 41.9MB). Free memory was 63.9MB in the beginning and 82.8MB in the end (delta: -18.9MB). Peak memory consumption was 70.2MB. Max. memory is 16.1GB. [2022-11-02 20:12:09,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 172.00ms. Allocated memory is still 144.7MB. Free memory was 82.8MB in the beginning and 71.5MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:12:09,877 INFO L158 Benchmark]: Boogie Preprocessor took 104.96ms. Allocated memory is still 144.7MB. Free memory was 71.5MB in the beginning and 64.7MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:12:09,878 INFO L158 Benchmark]: RCFGBuilder took 1704.94ms. Allocated memory was 144.7MB in the beginning and 195.0MB in the end (delta: 50.3MB). Free memory was 64.7MB in the beginning and 136.1MB in the end (delta: -71.3MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2022-11-02 20:12:09,878 INFO L158 Benchmark]: TraceAbstraction took 55556.35ms. Allocated memory was 195.0MB in the beginning and 1.1GB in the end (delta: 937.4MB). Free memory was 135.0MB in the beginning and 867.5MB in the end (delta: -732.5MB). Peak memory consumption was 676.7MB. Max. memory is 16.1GB. [2022-11-02 20:12:09,878 INFO L158 Benchmark]: Witness Printer took 721.56ms. Allocated memory is still 1.1GB. Free memory was 867.5MB in the beginning and 737.5MB in the end (delta: 130.0MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2022-11-02 20:12:09,879 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.19ms. Allocated memory is still 102.8MB. Free memory was 57.2MB in the beginning and 57.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2955.48ms. Allocated memory was 102.8MB in the beginning and 144.7MB in the end (delta: 41.9MB). Free memory was 63.9MB in the beginning and 82.8MB in the end (delta: -18.9MB). Peak memory consumption was 70.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 172.00ms. Allocated memory is still 144.7MB. Free memory was 82.8MB in the beginning and 71.5MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.96ms. Allocated memory is still 144.7MB. Free memory was 71.5MB in the beginning and 64.7MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1704.94ms. Allocated memory was 144.7MB in the beginning and 195.0MB in the end (delta: 50.3MB). Free memory was 64.7MB in the beginning and 136.1MB in the end (delta: -71.3MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 55556.35ms. Allocated memory was 195.0MB in the beginning and 1.1GB in the end (delta: 937.4MB). Free memory was 135.0MB in the beginning and 867.5MB in the end (delta: -732.5MB). Peak memory consumption was 676.7MB. Max. memory is 16.1GB. * Witness Printer took 721.56ms. Allocated memory is still 1.1GB. Free memory was 867.5MB in the beginning and 737.5MB in the end (delta: 130.0MB). Peak memory consumption was 130.0MB. 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: 55.4s, OverallIterations: 27, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2291 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2169 mSDsluCounter, 15045 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 223 IncrementalHoareTripleChecker+Unchecked, 12224 mSDsCounter, 577 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5276 IncrementalHoareTripleChecker+Invalid, 6076 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 577 mSolverCounterUnsat, 2821 mSDtfsCounter, 5276 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 934 GetRequests, 616 SyntacticMatches, 10 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=17, InterpolantAutomatonStates: 239, 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, 1385 HoareAnnotationTreeSize, 185 FomulaSimplifications, 45 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 32 FomulaSimplificationsInter, 104246 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 35.7s InterpolantComputationTime, 1776 NumberOfCodeBlocks, 1776 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1807 ConstructedInterpolants, 55 QuantifiedInterpolants, 11082 SizeOfPredicates, 37 NumberOfNonLiveVariables, 5076 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 30 InterpolantComputations, 26 PerfectInterpolantSequences, 542/575 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-02 20:12:09,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:12:09,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:12:09,898 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:12:09,899 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:12:09,899 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:12:09,899 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:12:09,901 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:12:09,901 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:12:09,902 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-02 20:12:09,902 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:12:09,902 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:12:09,902 WARN L418 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-02 20:12:09,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_26c2d2f6-5f71-4cde-aa3b-52945f0549fa/bin/uautomizer-Dbtcem3rbc/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