./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-usb-dev_drivers-net-ethernet-ti-tlan.cil.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_6907f136-02b0-4644-9395-50e44ce0966e/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6907f136-02b0-4644-9395-50e44ce0966e/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_6907f136-02b0-4644-9395-50e44ce0966e/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6907f136-02b0-4644-9395-50e44ce0966e/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-usb-dev_drivers-net-ethernet-ti-tlan.cil.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6907f136-02b0-4644-9395-50e44ce0966e/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_6907f136-02b0-4644-9395-50e44ce0966e/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 cac198808750b06b4323badfd457155abf5b06080e3172b359793331e4f6845f --- 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:47:49,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:47:49,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:47:49,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:47:49,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:47:49,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:47:49,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:47:49,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:47:49,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:47:49,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:47:49,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:47:49,813 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:47:49,813 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:47:49,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:47:49,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:47:49,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:47:49,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:47:49,819 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:47:49,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:47:49,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:47:49,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:47:49,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:47:49,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:47:49,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:47:49,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:47:49,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:47:49,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:47:49,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:47:49,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:47:49,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:47:49,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:47:49,836 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:47:49,837 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:47:49,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:47:49,839 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:47:49,839 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:47:49,840 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:47:49,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:47:49,841 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:47:49,842 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:47:49,842 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:47:49,843 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6907f136-02b0-4644-9395-50e44ce0966e/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:47:49,866 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:47:49,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:47:49,867 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:47:49,867 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:47:49,868 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:47:49,868 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:47:49,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:47:49,869 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:47:49,869 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:47:49,869 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:47:49,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:47:49,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:47:49,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:47:49,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:47:49,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:47:49,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:47:49,871 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:47:49,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:47:49,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:47:49,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:47:49,872 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:47:49,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:47:49,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:47:49,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:47:49,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:47:49,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:47:49,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:47:49,874 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:47:49,875 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:47:49,875 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:47:49,875 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_6907f136-02b0-4644-9395-50e44ce0966e/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_6907f136-02b0-4644-9395-50e44ce0966e/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 -> cac198808750b06b4323badfd457155abf5b06080e3172b359793331e4f6845f [2022-11-02 20:47:50,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:47:50,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:47:50,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:47:50,197 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:47:50,198 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:47:50,200 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6907f136-02b0-4644-9395-50e44ce0966e/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-usb-dev_drivers-net-ethernet-ti-tlan.cil.i [2022-11-02 20:47:50,292 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6907f136-02b0-4644-9395-50e44ce0966e/bin/uautomizer-Dbtcem3rbc/data/5b651c832/9bf6069a7b9b476f84771dda32625e49/FLAG926ba2020 [2022-11-02 20:47:51,123 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:47:51,124 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6907f136-02b0-4644-9395-50e44ce0966e/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-usb-dev_drivers-net-ethernet-ti-tlan.cil.i [2022-11-02 20:47:51,205 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6907f136-02b0-4644-9395-50e44ce0966e/bin/uautomizer-Dbtcem3rbc/data/5b651c832/9bf6069a7b9b476f84771dda32625e49/FLAG926ba2020 [2022-11-02 20:47:51,629 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6907f136-02b0-4644-9395-50e44ce0966e/bin/uautomizer-Dbtcem3rbc/data/5b651c832/9bf6069a7b9b476f84771dda32625e49 [2022-11-02 20:47:51,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:47:51,635 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:47:51,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:47:51,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:47:51,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:47:51,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:47:51" (1/1) ... [2022-11-02 20:47:51,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41bce6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:51, skipping insertion in model container [2022-11-02 20:47:51,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:47:51" (1/1) ... [2022-11-02 20:47:51,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:47:51,841 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:47:54,507 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_6907f136-02b0-4644-9395-50e44ce0966e/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-usb-dev_drivers-net-ethernet-ti-tlan.cil.i[314606,314619] [2022-11-02 20:47:54,512 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_6907f136-02b0-4644-9395-50e44ce0966e/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-usb-dev_drivers-net-ethernet-ti-tlan.cil.i[314753,314766] [2022-11-02 20:47:54,512 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_6907f136-02b0-4644-9395-50e44ce0966e/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-usb-dev_drivers-net-ethernet-ti-tlan.cil.i[314892,314905] [2022-11-02 20:47:54,513 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_6907f136-02b0-4644-9395-50e44ce0966e/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-usb-dev_drivers-net-ethernet-ti-tlan.cil.i[315050,315063] [2022-11-02 20:47:54,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:47:54,604 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:47:55,036 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_6907f136-02b0-4644-9395-50e44ce0966e/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-usb-dev_drivers-net-ethernet-ti-tlan.cil.i[314606,314619] [2022-11-02 20:47:55,038 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_6907f136-02b0-4644-9395-50e44ce0966e/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-usb-dev_drivers-net-ethernet-ti-tlan.cil.i[314753,314766] [2022-11-02 20:47:55,038 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_6907f136-02b0-4644-9395-50e44ce0966e/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-usb-dev_drivers-net-ethernet-ti-tlan.cil.i[314892,314905] [2022-11-02 20:47:55,039 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_6907f136-02b0-4644-9395-50e44ce0966e/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-usb-dev_drivers-net-ethernet-ti-tlan.cil.i[315050,315063] [2022-11-02 20:47:55,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:47:55,219 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:47:55,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55 WrapperNode [2022-11-02 20:47:55,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:47:55,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:47:55,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:47:55,220 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:47:55,228 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:47:55" (1/1) ... [2022-11-02 20:47:55,343 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:47:55" (1/1) ... [2022-11-02 20:47:55,552 INFO L138 Inliner]: procedures = 351, calls = 2103, calls flagged for inlining = 195, calls inlined = 189, statements flattened = 5021 [2022-11-02 20:47:55,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:47:55,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:47:55,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:47:55,554 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:47:55,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55" (1/1) ... [2022-11-02 20:47:55,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55" (1/1) ... [2022-11-02 20:47:55,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55" (1/1) ... [2022-11-02 20:47:55,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55" (1/1) ... [2022-11-02 20:47:55,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55" (1/1) ... [2022-11-02 20:47:55,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55" (1/1) ... [2022-11-02 20:47:55,876 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55" (1/1) ... [2022-11-02 20:47:55,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55" (1/1) ... [2022-11-02 20:47:55,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:47:55,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:47:55,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:47:55,960 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:47:55,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55" (1/1) ... [2022-11-02 20:47:55,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:47:55,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6907f136-02b0-4644-9395-50e44ce0966e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:55,999 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6907f136-02b0-4644-9395-50e44ce0966e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:47:56,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6907f136-02b0-4644-9395-50e44ce0966e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:47:56,041 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_resume [2022-11-02 20:47:56,042 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_resume [2022-11-02 20:47:56,042 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unregister_driver [2022-11-02 20:47:56,042 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_unregister_driver [2022-11-02 20:47:56,042 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 20:47:56,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 20:47:56,042 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2022-11-02 20:47:56,042 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2022-11-02 20:47:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-02 20:47:56,043 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-02 20:47:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_exit [2022-11-02 20:47:56,043 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_exit [2022-11-02 20:47:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-11-02 20:47:56,043 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-11-02 20:47:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_mii_write_reg [2022-11-02 20:47:56,043 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_mii_write_reg [2022-11-02 20:47:56,044 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_off [2022-11-02 20:47:56,044 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_off [2022-11-02 20:47:56,044 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 20:47:56,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 20:47:56,044 INFO L130 BoogieDeclarations]: Found specification of procedure slow_down_io [2022-11-02 20:47:56,044 INFO L138 BoogieDeclarations]: Found implementation of procedure slow_down_io [2022-11-02 20:47:56,045 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_handle_interrupt [2022-11-02 20:47:56,045 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_handle_interrupt [2022-11-02 20:47:56,045 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_start [2022-11-02 20:47:56,045 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_start [2022-11-02 20:47:56,045 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2022-11-02 20:47:56,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2022-11-02 20:47:56,045 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_dio_read8 [2022-11-02 20:47:56,045 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_dio_read8 [2022-11-02 20:47:56,046 INFO L130 BoogieDeclarations]: Found specification of procedure pci_map_single [2022-11-02 20:47:56,046 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_map_single [2022-11-02 20:47:56,046 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2022-11-02 20:47:56,046 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2022-11-02 20:47:56,046 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_read_and_clear_stats [2022-11-02 20:47:56,047 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_read_and_clear_stats [2022-11-02 20:47:56,047 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-11-02 20:47:56,047 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-11-02 20:47:56,047 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_alloc_skb_ip_align [2022-11-02 20:47:56,047 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_alloc_skb_ip_align [2022-11-02 20:47:56,047 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-11-02 20:47:56,047 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-11-02 20:47:56,047 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_mii_sync [2022-11-02 20:47:56,048 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_mii_sync [2022-11-02 20:47:56,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:47:56,049 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_set_multicast_list [2022-11-02 20:47:56,049 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_set_multicast_list [2022-11-02 20:47:56,049 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-11-02 20:47:56,050 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-11-02 20:47:56,050 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_netdev_29 [2022-11-02 20:47:56,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_netdev_29 [2022-11-02 20:47:56,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:47:56,052 INFO L130 BoogieDeclarations]: Found specification of procedure pci_get_drvdata [2022-11-02 20:47:56,052 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_get_drvdata [2022-11-02 20:47:56,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-11-02 20:47:56,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-11-02 20:47:56,052 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-11-02 20:47:56,053 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-11-02 20:47:56,053 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2022-11-02 20:47:56,053 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2022-11-02 20:47:56,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-11-02 20:47:56,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-11-02 20:47:56,054 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_eisa_cleanup [2022-11-02 20:47:56,054 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_eisa_cleanup [2022-11-02 20:47:56,054 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-11-02 20:47:56,054 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-11-02 20:47:56,055 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unmap_single [2022-11-02 20:47:56,055 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_unmap_single [2022-11-02 20:47:56,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:47:56,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:47:56,055 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_print_list [2022-11-02 20:47:56,055 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_print_list [2022-11-02 20:47:56,055 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-11-02 20:47:56,055 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-11-02 20:47:56,056 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_dio_write16 [2022-11-02 20:47:56,056 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_dio_write16 [2022-11-02 20:47:56,056 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2022-11-02 20:47:56,056 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2022-11-02 20:47:56,056 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-11-02 20:47:56,056 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-11-02 20:47:56,056 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-11-02 20:47:56,056 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-11-02 20:47:56,057 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-02 20:47:56,057 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-02 20:47:56,057 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-11-02 20:47:56,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-11-02 20:47:56,058 INFO L130 BoogieDeclarations]: Found specification of procedure outl [2022-11-02 20:47:56,058 INFO L138 BoogieDeclarations]: Found implementation of procedure outl [2022-11-02 20:47:56,058 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_reset_lists [2022-11-02 20:47:56,059 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_reset_lists [2022-11-02 20:47:56,059 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_finish_reset [2022-11-02 20:47:56,059 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_finish_reset [2022-11-02 20:47:56,059 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_close [2022-11-02 20:47:56,059 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_close [2022-11-02 20:47:56,059 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-11-02 20:47:56,059 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-11-02 20:47:56,060 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_phy_print [2022-11-02 20:47:56,060 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_phy_print [2022-11-02 20:47:56,060 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_netdev [2022-11-02 20:47:56,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_netdev [2022-11-02 20:47:56,060 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_dio_write32 [2022-11-02 20:47:56,060 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_dio_write32 [2022-11-02 20:47:56,060 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_pci_unregister_driver [2022-11-02 20:47:56,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_pci_unregister_driver [2022-11-02 20:47:56,060 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_probe1 [2022-11-02 20:47:56,061 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_probe1 [2022-11-02 20:47:56,061 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-11-02 20:47:56,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-11-02 20:47:56,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:47:56,061 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-11-02 20:47:56,061 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-11-02 20:47:56,062 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-11-02 20:47:56,063 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-11-02 20:47:56,065 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-11-02 20:47:56,065 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-11-02 20:47:56,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2022-11-02 20:47:56,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2022-11-02 20:47:56,068 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2022-11-02 20:47:56,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2022-11-02 20:47:56,068 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-11-02 20:47:56,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-11-02 20:47:56,068 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_set_timer [2022-11-02 20:47:56,074 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_set_timer [2022-11-02 20:47:56,074 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_stop [2022-11-02 20:47:56,074 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_stop [2022-11-02 20:47:56,074 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_set_mac [2022-11-02 20:47:56,075 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_set_mac [2022-11-02 20:47:56,075 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-11-02 20:47:56,076 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-11-02 20:47:56,076 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_ee_send_start [2022-11-02 20:47:56,076 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_ee_send_start [2022-11-02 20:47:56,076 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_dio_read32 [2022-11-02 20:47:56,076 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_dio_read32 [2022-11-02 20:47:56,076 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2022-11-02 20:47:56,077 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2022-11-02 20:47:56,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:47:56,077 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-11-02 20:47:56,077 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-11-02 20:47:56,077 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_remove_one [2022-11-02 20:47:56,077 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_remove_one [2022-11-02 20:47:56,077 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_get_skb [2022-11-02 20:47:56,078 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_get_skb [2022-11-02 20:47:56,078 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_dio_write8 [2022-11-02 20:47:56,078 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_dio_write8 [2022-11-02 20:47:56,078 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 20:47:56,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 20:47:56,078 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_phy_power_down [2022-11-02 20:47:56,078 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_phy_power_down [2022-11-02 20:47:56,078 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_ee_send_byte [2022-11-02 20:47:56,079 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_ee_send_byte [2022-11-02 20:47:56,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:47:56,079 INFO L130 BoogieDeclarations]: Found specification of procedure inb_p [2022-11-02 20:47:56,079 INFO L138 BoogieDeclarations]: Found implementation of procedure inb_p [2022-11-02 20:47:56,079 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2022-11-02 20:47:56,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2022-11-02 20:47:56,079 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_1 [2022-11-02 20:47:56,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_1 [2022-11-02 20:47:56,080 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_poll [2022-11-02 20:47:56,080 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_poll [2022-11-02 20:47:56,080 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-11-02 20:47:56,080 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-11-02 20:47:56,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:47:56,080 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_reset_adapter [2022-11-02 20:47:56,080 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_reset_adapter [2022-11-02 20:47:56,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-02 20:47:56,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-02 20:47:56,081 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-11-02 20:47:56,081 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-11-02 20:47:56,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:47:56,081 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-11-02 20:47:56,081 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 20:47:56,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 20:47:56,082 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_mii_send_data [2022-11-02 20:47:56,082 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_mii_send_data [2022-11-02 20:47:56,082 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_mii_read_reg [2022-11-02 20:47:56,082 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_mii_read_reg [2022-11-02 20:47:56,082 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_free_lists [2022-11-02 20:47:56,082 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_free_lists [2022-11-02 20:47:56,082 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-11-02 20:47:56,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-11-02 20:47:56,083 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_open [2022-11-02 20:47:56,083 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_open [2022-11-02 20:47:56,083 INFO L130 BoogieDeclarations]: Found specification of procedure pci_set_power_state [2022-11-02 20:47:56,083 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_set_power_state [2022-11-02 20:47:56,083 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-02 20:47:56,083 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-02 20:47:56,085 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_netdev_stop_11_2 [2022-11-02 20:47:56,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_netdev_stop_11_2 [2022-11-02 20:47:56,085 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-11-02 20:47:56,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-11-02 20:47:56,086 INFO L130 BoogieDeclarations]: Found specification of procedure outb_p [2022-11-02 20:47:56,086 INFO L138 BoogieDeclarations]: Found implementation of procedure outb_p [2022-11-02 20:47:56,086 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2022-11-02 20:47:56,086 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2022-11-02 20:47:56,086 INFO L130 BoogieDeclarations]: Found specification of procedure inl [2022-11-02 20:47:56,086 INFO L138 BoogieDeclarations]: Found implementation of procedure inl [2022-11-02 20:47:56,086 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_store_skb [2022-11-02 20:47:56,087 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_store_skb [2022-11-02 20:47:56,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:47:56,087 INFO L130 BoogieDeclarations]: Found specification of procedure __request_region [2022-11-02 20:47:56,087 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_tx_timeout [2022-11-02 20:47:56,087 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_tx_timeout [2022-11-02 20:47:56,087 INFO L130 BoogieDeclarations]: Found specification of procedure inw [2022-11-02 20:47:56,087 INFO L138 BoogieDeclarations]: Found implementation of procedure inw [2022-11-02 20:47:56,087 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2022-11-02 20:47:56,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2022-11-02 20:47:56,088 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-11-02 20:47:56,088 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-11-02 20:47:56,088 INFO L130 BoogieDeclarations]: Found specification of procedure tlan_phy_detect [2022-11-02 20:47:56,088 INFO L138 BoogieDeclarations]: Found implementation of procedure tlan_phy_detect [2022-11-02 20:47:56,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:47:56,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:47:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure preempt_count [2022-11-02 20:47:56,151 INFO L138 BoogieDeclarations]: Found implementation of procedure preempt_count [2022-11-02 20:47:57,169 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:47:57,177 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:47:58,058 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 20:48:01,505 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6908: assume 0 == (tlan_eisa_probe_~tmp___1~5#1.base + tlan_eisa_probe_~tmp___1~5#1.offset) % 18446744073709551616; [2022-11-02 20:48:01,506 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6908: assume !(0 == (tlan_eisa_probe_~tmp___1~5#1.base + tlan_eisa_probe_~tmp___1~5#1.offset) % 18446744073709551616); [2022-11-02 20:48:01,506 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6913-1: tlan_eisa_probe_~tmp___2~2#1 := tlan_eisa_probe_#t~ret338#1;havoc tlan_eisa_probe_#t~ret338#1; [2022-11-02 20:48:01,506 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6913: SUMMARY for call tlan_eisa_probe_#t~ret338#1 := inw((if (3200 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 <= 2147483647 then (3200 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 else (3200 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 - 4294967296)); srcloc: null [2022-11-02 20:48:01,506 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6980: SUMMARY for call tlan_eisa_probe_#t~ret343#1 := tlan_probe1(0, 0, tlan_eisa_probe_~ioaddr~0#1, tlan_eisa_probe_~irq~0#1, 12, 0, 0); srcloc: null [2022-11-02 20:48:01,506 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6915: assume 4366 != tlan_eisa_probe_~tmp___2~2#1 % 65536 % 4294967296; [2022-11-02 20:48:01,506 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6915: assume !(4366 != tlan_eisa_probe_~tmp___2~2#1 % 65536 % 4294967296); [2022-11-02 20:48:01,506 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6917: SUMMARY for call __release_region(~#ioport_resource~0.base, ~#ioport_resource~0.offset, tlan_eisa_probe_~ioaddr~0#1, 16); srcloc: null [2022-11-02 20:48:01,507 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6987: assume -2147483648 <= tlan_eisa_probe_#t~ret343#1 && tlan_eisa_probe_#t~ret343#1 <= 2147483647;tlan_eisa_probe_~rc~2#1 := tlan_eisa_probe_#t~ret343#1;havoc tlan_eisa_probe_#t~ret343#1; [2022-11-02 20:48:01,507 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6923-1: tlan_eisa_probe_~device_id~1#1 := tlan_eisa_probe_#t~ret339#1;havoc tlan_eisa_probe_#t~ret339#1; [2022-11-02 20:48:01,507 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6923: SUMMARY for call tlan_eisa_probe_#t~ret339#1 := inw((if (3202 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 <= 2147483647 then (3202 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 else (3202 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 - 4294967296)); srcloc: null [2022-11-02 20:48:01,507 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6925: assume 8433 != tlan_eisa_probe_~device_id~1#1 % 65536 % 4294967296 && 16625 != tlan_eisa_probe_~device_id~1#1 % 65536 % 4294967296; [2022-11-02 20:48:01,507 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6925: assume !(8433 != tlan_eisa_probe_~device_id~1#1 % 65536 % 4294967296 && 16625 != tlan_eisa_probe_~device_id~1#1 % 65536 % 4294967296); [2022-11-02 20:48:01,507 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6927: SUMMARY for call __release_region(~#ioport_resource~0.base, ~#ioport_resource~0.offset, tlan_eisa_probe_~ioaddr~0#1, 16); srcloc: null [2022-11-02 20:48:01,507 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6999-1: tlan_eisa_probe_~ioaddr~0#1 := 4096 + tlan_eisa_probe_~ioaddr~0#1; [2022-11-02 20:48:01,507 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6933-1: tlan_eisa_probe_~tmp___3~2#1 := tlan_eisa_probe_#t~ret340#1;havoc tlan_eisa_probe_#t~ret340#1; [2022-11-02 20:48:01,507 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6933: SUMMARY for call tlan_eisa_probe_#t~ret340#1 := inb((if (3204 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 <= 2147483647 then (3204 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 else (3204 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 - 4294967296)); srcloc: null [2022-11-02 20:48:01,507 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6935: assume 1 != tlan_eisa_probe_~tmp___3~2#1 % 256 % 4294967296; [2022-11-02 20:48:01,507 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6935: assume !(1 != tlan_eisa_probe_~tmp___3~2#1 % 256 % 4294967296); [2022-11-02 20:48:01,508 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6937-1: assume 16 == ~debug~0;havoc tlan_eisa_probe_#t~nondet345#1; [2022-11-02 20:48:01,508 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6937-1: assume !(16 == ~debug~0); [2022-11-02 20:48:01,508 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6937: SUMMARY for call __release_region(~#ioport_resource~0.base, ~#ioport_resource~0.offset, tlan_eisa_probe_~ioaddr~0#1, 16); srcloc: null [2022-11-02 20:48:01,508 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6942: assume 16 == ~debug~0;havoc tlan_eisa_probe_#t~nondet341#1; [2022-11-02 20:48:01,508 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6942: assume !(16 == ~debug~0); [2022-11-02 20:48:01,508 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L7008: assume tlan_eisa_probe_~ioaddr~0#1 <= 36863; [2022-11-02 20:48:01,508 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L7008: assume !(tlan_eisa_probe_~ioaddr~0#1 <= 36863); [2022-11-02 20:48:01,508 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6942-2: SUMMARY for call tlan_eisa_probe_#t~ret342#1 := inb((if (3264 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 <= 2147483647 then (3264 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 else (3264 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 - 4294967296)); srcloc: null [2022-11-02 20:48:01,508 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L7010: assume 0 != (if 0 == ~debug~0 then 0 else (if 1 == ~debug~0 then 0 else ~bitwiseAnd(~debug~0, 16))); [2022-11-02 20:48:01,508 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L7010: assume !(0 != (if 0 == ~debug~0 then 0 else (if 1 == ~debug~0 then 0 else ~bitwiseAnd(~debug~0, 16)))); [2022-11-02 20:48:01,509 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6949: tlan_eisa_probe_~tmp___4~0#1 := tlan_eisa_probe_#t~ret342#1;havoc tlan_eisa_probe_#t~ret342#1; [2022-11-02 20:48:01,509 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6884-1: assume 0 != (if 0 == ~debug~0 then 0 else (if 1 == ~debug~0 then 0 else ~bitwiseAnd(~debug~0, 16))); [2022-11-02 20:48:01,509 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6884-1: assume !(0 != (if 0 == ~debug~0 then 0 else (if 1 == ~debug~0 then 0 else ~bitwiseAnd(~debug~0, 16)))); [2022-11-02 20:48:01,509 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6886: SUMMARY for call tlan_eisa_probe_#t~ret332#1 := inw((if (3200 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 <= 2147483647 then (3200 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 else (3200 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 - 4294967296)); srcloc: null [2022-11-02 20:48:01,509 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6952: assume 16 == tlan_eisa_probe_~tmp___4~0#1 % 256; [2022-11-02 20:48:01,509 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6952: assume !(16 == tlan_eisa_probe_~tmp___4~0#1 % 256); [2022-11-02 20:48:01,509 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6886-1: tlan_eisa_probe_~tmp~35#1 := tlan_eisa_probe_#t~ret332#1;havoc tlan_eisa_probe_#t~ret332#1;havoc tlan_eisa_probe_#t~nondet333#1; [2022-11-02 20:48:01,509 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6953: tlan_eisa_probe_~irq~0#1 := 5; [2022-11-02 20:48:01,509 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6956: assume 32 == tlan_eisa_probe_~tmp___4~0#1 % 256; [2022-11-02 20:48:01,509 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6956: assume !(32 == tlan_eisa_probe_~tmp___4~0#1 % 256); [2022-11-02 20:48:01,510 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6891-1: assume 0 != (if 0 == ~debug~0 then 0 else (if 1 == ~debug~0 then 0 else ~bitwiseAnd(~debug~0, 16)));havoc tlan_eisa_probe_#t~nondet336#1; [2022-11-02 20:48:01,510 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6891-1: assume !(0 != (if 0 == ~debug~0 then 0 else (if 1 == ~debug~0 then 0 else ~bitwiseAnd(~debug~0, 16)))); [2022-11-02 20:48:01,510 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6957: tlan_eisa_probe_~irq~0#1 := 9; [2022-11-02 20:48:01,510 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6893-1: tlan_eisa_probe_~tmp___0~12#1 := tlan_eisa_probe_#t~ret334#1;havoc tlan_eisa_probe_#t~ret334#1;havoc tlan_eisa_probe_#t~nondet335#1; [2022-11-02 20:48:01,510 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6893: SUMMARY for call tlan_eisa_probe_#t~ret334#1 := inw((if (3202 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 <= 2147483647 then (3202 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 else (3202 + tlan_eisa_probe_~ioaddr~0#1) % 4294967296 % 4294967296 - 4294967296)); srcloc: null [2022-11-02 20:48:01,510 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6960: assume 64 == tlan_eisa_probe_~tmp___4~0#1 % 256; [2022-11-02 20:48:01,510 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6960: assume !(64 == tlan_eisa_probe_~tmp___4~0#1 % 256); [2022-11-02 20:48:01,510 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6961: tlan_eisa_probe_~irq~0#1 := 10; [2022-11-02 20:48:01,510 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6964: assume 128 == tlan_eisa_probe_~tmp___4~0#1 % 256; [2022-11-02 20:48:01,510 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6964: assume !(128 == tlan_eisa_probe_~tmp___4~0#1 % 256); [2022-11-02 20:48:01,511 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6898-1: call tlan_eisa_probe_#t~ret337#1.base, tlan_eisa_probe_#t~ret337#1.offset := __request_region(~#ioport_resource~0.base, ~#ioport_resource~0.offset, tlan_eisa_probe_~ioaddr~0#1, 16, ~#tlan_signature~0.base, ~#tlan_signature~0.offset, 0);tlan_eisa_probe_~tmp___1~5#1.base, tlan_eisa_probe_~tmp___1~5#1.offset := tlan_eisa_probe_#t~ret337#1.base, tlan_eisa_probe_#t~ret337#1.offset;havoc tlan_eisa_probe_#t~ret337#1.base, tlan_eisa_probe_#t~ret337#1.offset; [2022-11-02 20:48:01,511 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2022-11-02 20:48:01,511 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6965: tlan_eisa_probe_~irq~0#1 := 11; [2022-11-02 20:48:01,511 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6968: assume 16 == ~debug~0;havoc tlan_eisa_probe_#t~nondet344#1; [2022-11-02 20:48:01,511 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6968: assume !(16 == ~debug~0); [2022-11-02 20:48:01,647 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:48:01,664 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:48:01,664 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:48:01,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:48:01 BoogieIcfgContainer [2022-11-02 20:48:01,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:48:01,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:48:01,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:48:01,674 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:48:01,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:47:51" (1/3) ... [2022-11-02 20:48:01,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25214b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:48:01, skipping insertion in model container [2022-11-02 20:48:01,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:55" (2/3) ... [2022-11-02 20:48:01,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25214b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:48:01, skipping insertion in model container [2022-11-02 20:48:01,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:48:01" (3/3) ... [2022-11-02 20:48:01,678 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-usb-dev_drivers-net-ethernet-ti-tlan.cil.i [2022-11-02 20:48:01,734 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:48:01,735 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:48:01,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:48:01,866 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;@25203b42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:48:01,867 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-02 20:48:01,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 2073 states, 1372 states have (on average 1.2653061224489797) internal successors, (1736), 1415 states have internal predecessors, (1736), 600 states have call successors, (600), 100 states have call predecessors, (600), 99 states have return successors, (595), 581 states have call predecessors, (595), 595 states have call successors, (595) [2022-11-02 20:48:01,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-02 20:48:01,900 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:01,900 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:01,901 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:48:01,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:01,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2008765258, now seen corresponding path program 1 times [2022-11-02 20:48:01,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:01,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555221044] [2022-11-02 20:48:01,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:01,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:48:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:48:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:48:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:48:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:48:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:48:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:48:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:48:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-11-02 20:48:02,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:02,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555221044] [2022-11-02 20:48:02,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555221044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:02,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:02,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:48:02,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592344293] [2022-11-02 20:48:02,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:02,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:48:02,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:02,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:48:02,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:48:02,866 INFO L87 Difference]: Start difference. First operand has 2073 states, 1372 states have (on average 1.2653061224489797) internal successors, (1736), 1415 states have internal predecessors, (1736), 600 states have call successors, (600), 100 states have call predecessors, (600), 99 states have return successors, (595), 581 states have call predecessors, (595), 595 states have call successors, (595) Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 20:48:13,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:13,984 INFO L93 Difference]: Finished difference Result 6778 states and 10975 transitions. [2022-11-02 20:48:13,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:48:13,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 89 [2022-11-02 20:48:13,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:14,064 INFO L225 Difference]: With dead ends: 6778 [2022-11-02 20:48:14,064 INFO L226 Difference]: Without dead ends: 4711 [2022-11-02 20:48:14,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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:48:14,104 INFO L413 NwaCegarLoop]: 3400 mSDtfsCounter, 4141 mSDsluCounter, 3641 mSDsCounter, 0 mSdLazyCounter, 2623 mSolverCounterSat, 2441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4596 SdHoareTripleChecker+Valid, 7041 SdHoareTripleChecker+Invalid, 5064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2441 IncrementalHoareTripleChecker+Valid, 2623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:14,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4596 Valid, 7041 Invalid, 5064 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2441 Valid, 2623 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2022-11-02 20:48:14,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4711 states. [2022-11-02 20:48:14,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4711 to 4043. [2022-11-02 20:48:14,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4043 states, 2676 states have (on average 1.257473841554559) internal successors, (3365), 2760 states have internal predecessors, (3365), 1169 states have call successors, (1169), 197 states have call predecessors, (1169), 196 states have return successors, (1167), 1139 states have call predecessors, (1167), 1167 states have call successors, (1167) [2022-11-02 20:48:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4043 states to 4043 states and 5701 transitions. [2022-11-02 20:48:14,681 INFO L78 Accepts]: Start accepts. Automaton has 4043 states and 5701 transitions. Word has length 89 [2022-11-02 20:48:14,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:14,683 INFO L495 AbstractCegarLoop]: Abstraction has 4043 states and 5701 transitions. [2022-11-02 20:48:14,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 20:48:14,683 INFO L276 IsEmpty]: Start isEmpty. Operand 4043 states and 5701 transitions. [2022-11-02 20:48:14,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-02 20:48:14,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:14,693 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:14,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:48:14,694 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:48:14,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:14,694 INFO L85 PathProgramCache]: Analyzing trace with hash 324861074, now seen corresponding path program 1 times [2022-11-02 20:48:14,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:14,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692799685] [2022-11-02 20:48:14,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:14,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:14,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:48:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:14,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:15,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:48:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:15,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:15,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:48:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:15,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:15,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:48:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:15,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:15,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:48:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:15,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:15,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:48:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:15,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:15,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:48:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:15,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-02 20:48:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:15,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:48:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-11-02 20:48:15,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:15,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692799685] [2022-11-02 20:48:15,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692799685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:15,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:15,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:48:15,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917887439] [2022-11-02 20:48:15,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:15,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:48:15,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:15,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:48:15,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:48:15,223 INFO L87 Difference]: Start difference. First operand 4043 states and 5701 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-02 20:48:31,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:31,088 INFO L93 Difference]: Finished difference Result 9732 states and 14338 transitions. [2022-11-02 20:48:31,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:48:31,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 115 [2022-11-02 20:48:31,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:31,155 INFO L225 Difference]: With dead ends: 9732 [2022-11-02 20:48:31,155 INFO L226 Difference]: Without dead ends: 5706 [2022-11-02 20:48:31,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:48:31,186 INFO L413 NwaCegarLoop]: 2869 mSDtfsCounter, 4809 mSDsluCounter, 2217 mSDsCounter, 0 mSdLazyCounter, 3243 mSolverCounterSat, 3471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5145 SdHoareTripleChecker+Valid, 5086 SdHoareTripleChecker+Invalid, 6714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3471 IncrementalHoareTripleChecker+Valid, 3243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:31,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5145 Valid, 5086 Invalid, 6714 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3471 Valid, 3243 Invalid, 0 Unknown, 0 Unchecked, 14.5s Time] [2022-11-02 20:48:31,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5706 states. [2022-11-02 20:48:31,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5706 to 4731. [2022-11-02 20:48:31,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4731 states, 3179 states have (on average 1.2510223340673168) internal successors, (3977), 3286 states have internal predecessors, (3977), 1301 states have call successors, (1301), 264 states have call predecessors, (1301), 249 states have return successors, (1316), 1240 states have call predecessors, (1316), 1299 states have call successors, (1316) [2022-11-02 20:48:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4731 states to 4731 states and 6594 transitions. [2022-11-02 20:48:31,970 INFO L78 Accepts]: Start accepts. Automaton has 4731 states and 6594 transitions. Word has length 115 [2022-11-02 20:48:31,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:31,972 INFO L495 AbstractCegarLoop]: Abstraction has 4731 states and 6594 transitions. [2022-11-02 20:48:31,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-02 20:48:31,972 INFO L276 IsEmpty]: Start isEmpty. Operand 4731 states and 6594 transitions. [2022-11-02 20:48:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-02 20:48:31,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:31,987 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 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] [2022-11-02 20:48:31,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:48:31,987 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:48:31,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:31,988 INFO L85 PathProgramCache]: Analyzing trace with hash 132311183, now seen corresponding path program 1 times [2022-11-02 20:48:31,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:31,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391243314] [2022-11-02 20:48:31,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:31,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:48:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:48:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:48:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:48:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:48:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:48:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:48:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:48:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 20:48:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:48:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 20:48:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 20:48:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-02 20:48:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 20:48:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,628 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2022-11-02 20:48:32,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:32,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391243314] [2022-11-02 20:48:32,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391243314] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:32,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:32,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:48:32,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668358582] [2022-11-02 20:48:32,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:32,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:48:32,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:32,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:48:32,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:48:32,635 INFO L87 Difference]: Start difference. First operand 4731 states and 6594 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-02 20:48:45,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:45,203 INFO L93 Difference]: Finished difference Result 13559 states and 21144 transitions. [2022-11-02 20:48:45,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:48:45,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 145 [2022-11-02 20:48:45,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:45,298 INFO L225 Difference]: With dead ends: 13559 [2022-11-02 20:48:45,299 INFO L226 Difference]: Without dead ends: 8845 [2022-11-02 20:48:45,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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:48:45,349 INFO L413 NwaCegarLoop]: 3801 mSDtfsCounter, 4373 mSDsluCounter, 3840 mSDsCounter, 0 mSdLazyCounter, 2843 mSolverCounterSat, 2425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4820 SdHoareTripleChecker+Valid, 7641 SdHoareTripleChecker+Invalid, 5268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2425 IncrementalHoareTripleChecker+Valid, 2843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:45,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4820 Valid, 7641 Invalid, 5268 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2425 Valid, 2843 Invalid, 0 Unknown, 0 Unchecked, 11.2s Time] [2022-11-02 20:48:45,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8845 states. [2022-11-02 20:48:46,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8845 to 8140. [2022-11-02 20:48:46,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8140 states, 5441 states have (on average 1.233412975555964) internal successors, (6711), 5635 states have internal predecessors, (6711), 2264 states have call successors, (2264), 443 states have call predecessors, (2264), 433 states have return successors, (2891), 2164 states have call predecessors, (2891), 2262 states have call successors, (2891) [2022-11-02 20:48:46,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8140 states to 8140 states and 11866 transitions. [2022-11-02 20:48:46,706 INFO L78 Accepts]: Start accepts. Automaton has 8140 states and 11866 transitions. Word has length 145 [2022-11-02 20:48:46,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:46,706 INFO L495 AbstractCegarLoop]: Abstraction has 8140 states and 11866 transitions. [2022-11-02 20:48:46,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-02 20:48:46,707 INFO L276 IsEmpty]: Start isEmpty. Operand 8140 states and 11866 transitions. [2022-11-02 20:48:46,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-02 20:48:46,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:46,712 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 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] [2022-11-02 20:48:46,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:48:46,713 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:48:46,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:46,714 INFO L85 PathProgramCache]: Analyzing trace with hash 566040269, now seen corresponding path program 1 times [2022-11-02 20:48:46,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:46,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559289505] [2022-11-02 20:48:46,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:46,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:46,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:48:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:46,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:46,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:48:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:46,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:46,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:48:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:46,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:46,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:48:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:46,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:46,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:48:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:46,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:47,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:48:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:47,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:47,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:48:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:47,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:48:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:47,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 20:48:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:47,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:48:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:47,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 20:48:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:47,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:48:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:47,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 20:48:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:47,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-02 20:48:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:47,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 20:48:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2022-11-02 20:48:47,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:47,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559289505] [2022-11-02 20:48:47,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559289505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:47,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:47,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:48:47,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470427778] [2022-11-02 20:48:47,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:47,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:48:47,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:47,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:48:47,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:48:47,102 INFO L87 Difference]: Start difference. First operand 8140 states and 11866 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-02 20:48:58,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:58,011 INFO L93 Difference]: Finished difference Result 22419 states and 34025 transitions. [2022-11-02 20:48:58,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:48:58,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 145 [2022-11-02 20:48:58,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:58,182 INFO L225 Difference]: With dead ends: 22419 [2022-11-02 20:48:58,183 INFO L226 Difference]: Without dead ends: 15706 [2022-11-02 20:48:58,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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:48:58,234 INFO L413 NwaCegarLoop]: 4758 mSDtfsCounter, 3521 mSDsluCounter, 4254 mSDsCounter, 0 mSdLazyCounter, 2632 mSolverCounterSat, 1994 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4016 SdHoareTripleChecker+Valid, 9012 SdHoareTripleChecker+Invalid, 4626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1994 IncrementalHoareTripleChecker+Valid, 2632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:58,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4016 Valid, 9012 Invalid, 4626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1994 Valid, 2632 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2022-11-02 20:48:58,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15706 states. [2022-11-02 20:49:00,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15706 to 14590. [2022-11-02 20:49:00,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14590 states, 9745 states have (on average 1.2342739866598256) internal successors, (12028), 10095 states have internal predecessors, (12028), 4067 states have call successors, (4067), 793 states have call predecessors, (4067), 776 states have return successors, (5313), 3889 states have call predecessors, (5313), 4065 states have call successors, (5313) [2022-11-02 20:49:00,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14590 states to 14590 states and 21408 transitions. [2022-11-02 20:49:00,213 INFO L78 Accepts]: Start accepts. Automaton has 14590 states and 21408 transitions. Word has length 145 [2022-11-02 20:49:00,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:00,214 INFO L495 AbstractCegarLoop]: Abstraction has 14590 states and 21408 transitions. [2022-11-02 20:49:00,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-02 20:49:00,214 INFO L276 IsEmpty]: Start isEmpty. Operand 14590 states and 21408 transitions. [2022-11-02 20:49:00,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-02 20:49:00,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:00,220 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 6, 4, 4, 4, 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] [2022-11-02 20:49:00,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:49:00,220 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:00,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:00,221 INFO L85 PathProgramCache]: Analyzing trace with hash -251608181, now seen corresponding path program 1 times [2022-11-02 20:49:00,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:00,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126868425] [2022-11-02 20:49:00,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:00,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:00,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:49:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:00,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:00,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:49:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:00,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:00,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:49:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:00,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:00,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:49:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:00,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:00,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:49:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:00,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:00,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:49:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:00,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:00,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:49:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:00,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:49:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:00,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 20:49:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:00,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:49:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:00,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 20:49:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:01,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:01,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 20:49:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:01,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-02 20:49:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:01,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 20:49:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-11-02 20:49:01,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:01,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126868425] [2022-11-02 20:49:01,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126868425] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:01,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:01,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:49:01,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750849833] [2022-11-02 20:49:01,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:01,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:49:01,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:01,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:49:01,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:49:01,055 INFO L87 Difference]: Start difference. First operand 14590 states and 21408 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 20:49:08,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:08,200 INFO L93 Difference]: Finished difference Result 15700 states and 24130 transitions. [2022-11-02 20:49:08,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:49:08,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 145 [2022-11-02 20:49:08,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:08,375 INFO L225 Difference]: With dead ends: 15700 [2022-11-02 20:49:08,376 INFO L226 Difference]: Without dead ends: 14362 [2022-11-02 20:49:08,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:49:08,419 INFO L413 NwaCegarLoop]: 2843 mSDtfsCounter, 3395 mSDsluCounter, 3542 mSDsCounter, 0 mSdLazyCounter, 1818 mSolverCounterSat, 1636 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3626 SdHoareTripleChecker+Valid, 6385 SdHoareTripleChecker+Invalid, 3454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1636 IncrementalHoareTripleChecker+Valid, 1818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:08,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3626 Valid, 6385 Invalid, 3454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1636 Valid, 1818 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-02 20:49:08,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14362 states. [2022-11-02 20:49:10,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14362 to 13234. [2022-11-02 20:49:10,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13234 states, 8766 states have (on average 1.2218799908738307) internal successors, (10711), 9056 states have internal predecessors, (10711), 3713 states have call successors, (3713), 766 states have call predecessors, (3713), 754 states have return successors, (4845), 3581 states have call predecessors, (4845), 3713 states have call successors, (4845) [2022-11-02 20:49:10,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13234 states to 13234 states and 19269 transitions. [2022-11-02 20:49:10,496 INFO L78 Accepts]: Start accepts. Automaton has 13234 states and 19269 transitions. Word has length 145 [2022-11-02 20:49:10,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:10,497 INFO L495 AbstractCegarLoop]: Abstraction has 13234 states and 19269 transitions. [2022-11-02 20:49:10,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 20:49:10,498 INFO L276 IsEmpty]: Start isEmpty. Operand 13234 states and 19269 transitions. [2022-11-02 20:49:10,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-11-02 20:49:10,514 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:10,514 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 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:49:10,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:49:10,517 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:10,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:10,518 INFO L85 PathProgramCache]: Analyzing trace with hash 82527693, now seen corresponding path program 1 times [2022-11-02 20:49:10,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:10,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644380746] [2022-11-02 20:49:10,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:10,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:10,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:49:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:10,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:10,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:49:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:10,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:10,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:49:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:10,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:10,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:49:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:10,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:10,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:49:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:10,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:10,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:49:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:10,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:11,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:49:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:11,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:49:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:11,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 20:49:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:11,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:49:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:11,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:49:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:11,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 20:49:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:11,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:11,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-02 20:49:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:11,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 20:49:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:11,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-02 20:49:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:11,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-11-02 20:49:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-11-02 20:49:11,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:11,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644380746] [2022-11-02 20:49:11,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644380746] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:11,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:11,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:49:11,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153420837] [2022-11-02 20:49:11,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:11,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:49:11,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:11,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:49:11,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:49:11,192 INFO L87 Difference]: Start difference. First operand 13234 states and 19269 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-02 20:49:31,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:31,866 INFO L93 Difference]: Finished difference Result 30971 states and 46228 transitions. [2022-11-02 20:49:31,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:49:31,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 179 [2022-11-02 20:49:31,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:32,021 INFO L225 Difference]: With dead ends: 30971 [2022-11-02 20:49:32,021 INFO L226 Difference]: Without dead ends: 19080 [2022-11-02 20:49:32,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:49:32,090 INFO L413 NwaCegarLoop]: 3595 mSDtfsCounter, 1899 mSDsluCounter, 4014 mSDsCounter, 0 mSdLazyCounter, 5062 mSolverCounterSat, 1440 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2171 SdHoareTripleChecker+Valid, 7609 SdHoareTripleChecker+Invalid, 6502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1440 IncrementalHoareTripleChecker+Valid, 5062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:32,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2171 Valid, 7609 Invalid, 6502 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1440 Valid, 5062 Invalid, 0 Unknown, 0 Unchecked, 17.7s Time] [2022-11-02 20:49:32,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19080 states. [2022-11-02 20:49:34,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19080 to 16581. [2022-11-02 20:49:34,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16581 states, 11144 states have (on average 1.2241564967695622) internal successors, (13642), 11499 states have internal predecessors, (13642), 4478 states have call successors, (4478), 988 states have call predecessors, (4478), 958 states have return successors, (5681), 4295 states have call predecessors, (5681), 4478 states have call successors, (5681) [2022-11-02 20:49:34,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16581 states to 16581 states and 23801 transitions. [2022-11-02 20:49:34,470 INFO L78 Accepts]: Start accepts. Automaton has 16581 states and 23801 transitions. Word has length 179 [2022-11-02 20:49:34,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:34,471 INFO L495 AbstractCegarLoop]: Abstraction has 16581 states and 23801 transitions. [2022-11-02 20:49:34,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-02 20:49:34,471 INFO L276 IsEmpty]: Start isEmpty. Operand 16581 states and 23801 transitions. [2022-11-02 20:49:34,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-11-02 20:49:34,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:34,498 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:34,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:49:34,498 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:34,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:34,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1553852042, now seen corresponding path program 1 times [2022-11-02 20:49:34,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:34,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209768757] [2022-11-02 20:49:34,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:34,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:49:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:49:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:49:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:49:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:49:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:49:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:49:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:49:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 20:49:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:49:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:49:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 20:49:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-02 20:49:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 20:49:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 20:49:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:49:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:49:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-02 20:49:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:49:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:49:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-11-02 20:49:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-11-02 20:49:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:34,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-02 20:49:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:35,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-02 20:49:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:35,099 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2022-11-02 20:49:35,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:35,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209768757] [2022-11-02 20:49:35,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209768757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:35,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:35,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:49:35,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605383157] [2022-11-02 20:49:35,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:35,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:49:35,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:35,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:49:35,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:49:35,103 INFO L87 Difference]: Start difference. First operand 16581 states and 23801 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-11-02 20:49:55,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:55,934 INFO L93 Difference]: Finished difference Result 38141 states and 56012 transitions. [2022-11-02 20:49:55,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:49:55,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 253 [2022-11-02 20:49:55,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:56,135 INFO L225 Difference]: With dead ends: 38141 [2022-11-02 20:49:56,135 INFO L226 Difference]: Without dead ends: 21288 [2022-11-02 20:49:56,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:49:56,228 INFO L413 NwaCegarLoop]: 3560 mSDtfsCounter, 1899 mSDsluCounter, 3944 mSDsCounter, 0 mSdLazyCounter, 4997 mSolverCounterSat, 1436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2170 SdHoareTripleChecker+Valid, 7504 SdHoareTripleChecker+Invalid, 6433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1436 IncrementalHoareTripleChecker+Valid, 4997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:56,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2170 Valid, 7504 Invalid, 6433 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1436 Valid, 4997 Invalid, 0 Unknown, 0 Unchecked, 17.6s Time] [2022-11-02 20:49:56,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21288 states. [2022-11-02 20:49:58,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21288 to 18491. [2022-11-02 20:49:58,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18491 states, 12480 states have (on average 1.224599358974359) internal successors, (15283), 12880 states have internal predecessors, (15283), 4939 states have call successors, (4939), 1123 states have call predecessors, (4939), 1071 states have return successors, (6202), 4705 states have call predecessors, (6202), 4939 states have call successors, (6202) [2022-11-02 20:49:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18491 states to 18491 states and 26424 transitions. [2022-11-02 20:49:58,950 INFO L78 Accepts]: Start accepts. Automaton has 18491 states and 26424 transitions. Word has length 253 [2022-11-02 20:49:58,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:58,951 INFO L495 AbstractCegarLoop]: Abstraction has 18491 states and 26424 transitions. [2022-11-02 20:49:58,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-11-02 20:49:58,952 INFO L276 IsEmpty]: Start isEmpty. Operand 18491 states and 26424 transitions. [2022-11-02 20:49:58,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-11-02 20:49:58,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:58,992 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:58,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:49:58,992 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:58,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:58,993 INFO L85 PathProgramCache]: Analyzing trace with hash 374420660, now seen corresponding path program 1 times [2022-11-02 20:49:58,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:58,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956229868] [2022-11-02 20:49:58,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:58,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:49:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:49:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:49:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:49:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:49:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:49:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:49:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:49:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-02 20:49:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:49:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:49:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 20:49:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-02 20:49:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 20:49:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 20:49:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:49:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:49:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-02 20:49:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:49:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:49:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:49:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-11-02 20:49:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-11-02 20:49:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-02 20:49:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-02 20:49:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,966 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2022-11-02 20:49:59,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:59,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956229868] [2022-11-02 20:49:59,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956229868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:59,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:59,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:49:59,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975937478] [2022-11-02 20:49:59,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:59,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:49:59,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:59,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:49:59,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:49:59,969 INFO L87 Difference]: Start difference. First operand 18491 states and 26424 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-02 20:50:14,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:14,964 INFO L93 Difference]: Finished difference Result 25040 states and 37699 transitions. [2022-11-02 20:50:14,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:50:14,965 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 253 [2022-11-02 20:50:14,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:14,972 INFO L225 Difference]: With dead ends: 25040 [2022-11-02 20:50:14,972 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:50:15,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:50:15,079 INFO L413 NwaCegarLoop]: 3238 mSDtfsCounter, 4606 mSDsluCounter, 3652 mSDsCounter, 0 mSdLazyCounter, 3182 mSolverCounterSat, 2938 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4912 SdHoareTripleChecker+Valid, 6890 SdHoareTripleChecker+Invalid, 6120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2938 IncrementalHoareTripleChecker+Valid, 3182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:15,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4912 Valid, 6890 Invalid, 6120 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2938 Valid, 3182 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2022-11-02 20:50:15,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:50:15,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:50:15,080 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:50:15,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:50:15,084 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 253 [2022-11-02 20:50:15,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:15,085 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:50:15,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-02 20:50:15,085 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:50:15,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:50:15,088 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-02 20:50:15,089 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-02 20:50:15,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:50:15,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.