./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 21c7509b891e0ddc87dd83939d0ee5cb835b3606a1a2de3064d905837c808c7b --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 21:35:54,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 21:35:54,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 21:35:54,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 21:35:54,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 21:35:54,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 21:35:54,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 21:35:54,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 21:35:54,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 21:35:54,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 21:35:54,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 21:35:54,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 21:35:54,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 21:35:54,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 21:35:54,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 21:35:54,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 21:35:54,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 21:35:54,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 21:35:54,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 21:35:54,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 21:35:54,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 21:35:54,729 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 21:35:54,729 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 21:35:54,730 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 21:35:54,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 21:35:54,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 21:35:54,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 21:35:54,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 21:35:54,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 21:35:54,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 21:35:54,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 21:35:54,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 21:35:54,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 21:35:54,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 21:35:54,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 21:35:54,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 21:35:54,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 21:35:54,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 21:35:54,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 21:35:54,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 21:35:54,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 21:35:54,740 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 21:35:54,754 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 21:35:54,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 21:35:54,754 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 21:35:54,754 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 21:35:54,755 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 21:35:54,755 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 21:35:54,755 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 21:35:54,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 21:35:54,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 21:35:54,756 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 21:35:54,756 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 21:35:54,756 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 21:35:54,756 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 21:35:54,756 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 21:35:54,757 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 21:35:54,757 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 21:35:54,757 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 21:35:54,757 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 21:35:54,757 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 21:35:54,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 21:35:54,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 21:35:54,758 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 21:35:54,758 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 21:35:54,758 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 21:35:54,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 21:35:54,758 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 21:35:54,758 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 21:35:54,758 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 21:35:54,758 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 21:35:54,759 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 21c7509b891e0ddc87dd83939d0ee5cb835b3606a1a2de3064d905837c808c7b [2021-11-06 21:35:54,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 21:35:54,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 21:35:54,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 21:35:54,951 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 21:35:54,952 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 21:35:54,953 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i [2021-11-06 21:35:54,996 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edc643681/f820d41a09574f45bfcaad24edf7493b/FLAG27ced267f [2021-11-06 21:35:55,594 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 21:35:55,595 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i [2021-11-06 21:35:55,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edc643681/f820d41a09574f45bfcaad24edf7493b/FLAG27ced267f [2021-11-06 21:35:56,029 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edc643681/f820d41a09574f45bfcaad24edf7493b [2021-11-06 21:35:56,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 21:35:56,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 21:35:56,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 21:35:56,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 21:35:56,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 21:35:56,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:35:56" (1/1) ... [2021-11-06 21:35:56,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391454f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:35:56, skipping insertion in model container [2021-11-06 21:35:56,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:35:56" (1/1) ... [2021-11-06 21:35:56,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 21:35:56,139 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 21:35:57,759 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292064,292077] [2021-11-06 21:35:57,761 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292209,292222] [2021-11-06 21:35:57,762 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292355,292368] [2021-11-06 21:35:57,762 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292520,292533] [2021-11-06 21:35:57,762 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292678,292691] [2021-11-06 21:35:57,762 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292836,292849] [2021-11-06 21:35:57,763 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292994,293007] [2021-11-06 21:35:57,763 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293154,293167] [2021-11-06 21:35:57,763 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293313,293326] [2021-11-06 21:35:57,764 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293452,293465] [2021-11-06 21:35:57,764 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293594,293607] [2021-11-06 21:35:57,764 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293743,293756] [2021-11-06 21:35:57,765 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293882,293895] [2021-11-06 21:35:57,765 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294037,294050] [2021-11-06 21:35:57,765 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294197,294210] [2021-11-06 21:35:57,766 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294348,294361] [2021-11-06 21:35:57,766 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294499,294512] [2021-11-06 21:35:57,766 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294651,294664] [2021-11-06 21:35:57,766 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294800,294813] [2021-11-06 21:35:57,767 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294948,294961] [2021-11-06 21:35:57,767 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295105,295118] [2021-11-06 21:35:57,767 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295254,295267] [2021-11-06 21:35:57,768 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295410,295423] [2021-11-06 21:35:57,768 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295563,295576] [2021-11-06 21:35:57,768 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295709,295722] [2021-11-06 21:35:57,768 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295852,295865] [2021-11-06 21:35:57,769 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296004,296017] [2021-11-06 21:35:57,769 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296150,296163] [2021-11-06 21:35:57,769 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296295,296308] [2021-11-06 21:35:57,770 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296449,296462] [2021-11-06 21:35:57,770 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296600,296613] [2021-11-06 21:35:57,770 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296755,296768] [2021-11-06 21:35:57,771 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296907,296920] [2021-11-06 21:35:57,771 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297062,297075] [2021-11-06 21:35:57,771 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297226,297239] [2021-11-06 21:35:57,771 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297382,297395] [2021-11-06 21:35:57,772 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297546,297559] [2021-11-06 21:35:57,772 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297688,297701] [2021-11-06 21:35:57,772 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297846,297859] [2021-11-06 21:35:57,773 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298013,298026] [2021-11-06 21:35:57,773 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298172,298185] [2021-11-06 21:35:57,773 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298331,298344] [2021-11-06 21:35:57,773 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298480,298493] [2021-11-06 21:35:57,774 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298627,298640] [2021-11-06 21:35:57,774 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298766,298779] [2021-11-06 21:35:57,774 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298929,298942] [2021-11-06 21:35:57,775 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299095,299108] [2021-11-06 21:35:57,775 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299259,299272] [2021-11-06 21:35:57,775 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299424,299437] [2021-11-06 21:35:57,776 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299589,299602] [2021-11-06 21:35:57,776 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299755,299768] [2021-11-06 21:35:57,776 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299920,299933] [2021-11-06 21:35:57,776 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300087,300100] [2021-11-06 21:35:57,777 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300247,300260] [2021-11-06 21:35:57,777 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300409,300422] [2021-11-06 21:35:57,777 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300568,300581] [2021-11-06 21:35:57,777 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300714,300727] [2021-11-06 21:35:57,778 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300857,300870] [2021-11-06 21:35:57,778 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301001,301014] [2021-11-06 21:35:57,778 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301144,301157] [2021-11-06 21:35:57,779 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301288,301301] [2021-11-06 21:35:57,779 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301429,301442] [2021-11-06 21:35:57,779 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301567,301580] [2021-11-06 21:35:57,779 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301725,301738] [2021-11-06 21:35:57,780 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301884,301897] [2021-11-06 21:35:57,780 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302040,302053] [2021-11-06 21:35:57,780 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302189,302202] [2021-11-06 21:35:57,781 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302341,302354] [2021-11-06 21:35:57,781 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302492,302505] [2021-11-06 21:35:57,781 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302641,302654] [2021-11-06 21:35:57,781 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302793,302806] [2021-11-06 21:35:57,782 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302941,302954] [2021-11-06 21:35:57,782 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303094,303107] [2021-11-06 21:35:57,782 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303245,303258] [2021-11-06 21:35:57,782 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303395,303408] [2021-11-06 21:35:57,783 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303542,303555] [2021-11-06 21:35:57,783 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303693,303706] [2021-11-06 21:35:57,783 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303844,303857] [2021-11-06 21:35:57,784 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303992,304005] [2021-11-06 21:35:57,784 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304158,304171] [2021-11-06 21:35:57,784 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304327,304340] [2021-11-06 21:35:57,784 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304494,304507] [2021-11-06 21:35:57,785 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304662,304675] [2021-11-06 21:35:57,785 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304812,304825] [2021-11-06 21:35:57,785 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304959,304972] [2021-11-06 21:35:57,785 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305120,305133] [2021-11-06 21:35:57,786 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305290,305303] [2021-11-06 21:35:57,786 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305452,305465] [2021-11-06 21:35:57,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 21:35:57,830 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 21:35:58,043 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292064,292077] [2021-11-06 21:35:58,045 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292209,292222] [2021-11-06 21:35:58,045 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292355,292368] [2021-11-06 21:35:58,046 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292520,292533] [2021-11-06 21:35:58,047 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292678,292691] [2021-11-06 21:35:58,047 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292836,292849] [2021-11-06 21:35:58,048 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292994,293007] [2021-11-06 21:35:58,049 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293154,293167] [2021-11-06 21:35:58,050 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293313,293326] [2021-11-06 21:35:58,050 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293452,293465] [2021-11-06 21:35:58,051 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293594,293607] [2021-11-06 21:35:58,054 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293743,293756] [2021-11-06 21:35:58,054 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293882,293895] [2021-11-06 21:35:58,055 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294037,294050] [2021-11-06 21:35:58,055 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294197,294210] [2021-11-06 21:35:58,055 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294348,294361] [2021-11-06 21:35:58,055 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294499,294512] [2021-11-06 21:35:58,056 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294651,294664] [2021-11-06 21:35:58,056 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294800,294813] [2021-11-06 21:35:58,056 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294948,294961] [2021-11-06 21:35:58,057 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295105,295118] [2021-11-06 21:35:58,058 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295254,295267] [2021-11-06 21:35:58,058 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295410,295423] [2021-11-06 21:35:58,058 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295563,295576] [2021-11-06 21:35:58,059 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295709,295722] [2021-11-06 21:35:58,059 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295852,295865] [2021-11-06 21:35:58,059 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296004,296017] [2021-11-06 21:35:58,060 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296150,296163] [2021-11-06 21:35:58,061 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296295,296308] [2021-11-06 21:35:58,061 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296449,296462] [2021-11-06 21:35:58,061 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296600,296613] [2021-11-06 21:35:58,062 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296755,296768] [2021-11-06 21:35:58,062 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296907,296920] [2021-11-06 21:35:58,062 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297062,297075] [2021-11-06 21:35:58,062 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297226,297239] [2021-11-06 21:35:58,063 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297382,297395] [2021-11-06 21:35:58,063 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297546,297559] [2021-11-06 21:35:58,064 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297688,297701] [2021-11-06 21:35:58,064 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297846,297859] [2021-11-06 21:35:58,064 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298013,298026] [2021-11-06 21:35:58,065 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298172,298185] [2021-11-06 21:35:58,066 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298331,298344] [2021-11-06 21:35:58,066 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298480,298493] [2021-11-06 21:35:58,066 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298627,298640] [2021-11-06 21:35:58,067 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298766,298779] [2021-11-06 21:35:58,067 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298929,298942] [2021-11-06 21:35:58,067 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299095,299108] [2021-11-06 21:35:58,067 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299259,299272] [2021-11-06 21:35:58,068 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299424,299437] [2021-11-06 21:35:58,068 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299589,299602] [2021-11-06 21:35:58,068 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299755,299768] [2021-11-06 21:35:58,071 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299920,299933] [2021-11-06 21:35:58,072 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300087,300100] [2021-11-06 21:35:58,072 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300247,300260] [2021-11-06 21:35:58,072 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300409,300422] [2021-11-06 21:35:58,073 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300568,300581] [2021-11-06 21:35:58,073 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300714,300727] [2021-11-06 21:35:58,073 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300857,300870] [2021-11-06 21:35:58,074 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301001,301014] [2021-11-06 21:35:58,074 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301144,301157] [2021-11-06 21:35:58,074 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301288,301301] [2021-11-06 21:35:58,074 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301429,301442] [2021-11-06 21:35:58,075 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301567,301580] [2021-11-06 21:35:58,076 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301725,301738] [2021-11-06 21:35:58,077 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301884,301897] [2021-11-06 21:35:58,079 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302040,302053] [2021-11-06 21:35:58,080 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302189,302202] [2021-11-06 21:35:58,080 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302341,302354] [2021-11-06 21:35:58,080 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302492,302505] [2021-11-06 21:35:58,081 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302641,302654] [2021-11-06 21:35:58,081 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302793,302806] [2021-11-06 21:35:58,081 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302941,302954] [2021-11-06 21:35:58,082 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303094,303107] [2021-11-06 21:35:58,082 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303245,303258] [2021-11-06 21:35:58,090 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303395,303408] [2021-11-06 21:35:58,091 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303542,303555] [2021-11-06 21:35:58,091 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303693,303706] [2021-11-06 21:35:58,091 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303844,303857] [2021-11-06 21:35:58,092 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303992,304005] [2021-11-06 21:35:58,093 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304158,304171] [2021-11-06 21:35:58,093 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304327,304340] [2021-11-06 21:35:58,094 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304494,304507] [2021-11-06 21:35:58,094 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304662,304675] [2021-11-06 21:35:58,094 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304812,304825] [2021-11-06 21:35:58,094 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304959,304972] [2021-11-06 21:35:58,095 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305120,305133] [2021-11-06 21:35:58,095 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305290,305303] [2021-11-06 21:35:58,095 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305452,305465] [2021-11-06 21:35:58,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 21:35:58,214 INFO L208 MainTranslator]: Completed translation [2021-11-06 21:35:58,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:35:58 WrapperNode [2021-11-06 21:35:58,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 21:35:58,216 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 21:35:58,216 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 21:35:58,216 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 21:35:58,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:35:58" (1/1) ... [2021-11-06 21:35:58,287 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:35:58" (1/1) ... [2021-11-06 21:35:58,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 21:35:58,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 21:35:58,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 21:35:58,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 21:35:58,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:35:58" (1/1) ... [2021-11-06 21:35:58,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:35:58" (1/1) ... [2021-11-06 21:35:58,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:35:58" (1/1) ... [2021-11-06 21:35:58,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:35:58" (1/1) ... [2021-11-06 21:35:58,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:35:58" (1/1) ... [2021-11-06 21:35:58,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:35:58" (1/1) ... [2021-11-06 21:35:58,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:35:58" (1/1) ... [2021-11-06 21:35:58,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 21:35:58,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 21:35:58,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 21:35:58,441 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 21:35:58,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:35:58" (1/1) ... [2021-11-06 21:35:58,467 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 21:35:58,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:35:58,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-06 21:35:58,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-06 21:35:58,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 21:35:58,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 21:35:58,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 21:35:58,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 21:35:58,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 21:35:58,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 21:35:58,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 21:36:03,823 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_3_returnLabel: main_#res := 0; [2021-11-06 21:36:03,823 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L6697: #t~ret896 := main_#res; [2021-11-06 21:36:03,823 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-06 21:36:03,829 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 21:36:03,829 INFO L299 CfgBuilder]: Removed 321 assume(true) statements. [2021-11-06 21:36:03,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:36:03 BoogieIcfgContainer [2021-11-06 21:36:03,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 21:36:03,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 21:36:03,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 21:36:03,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 21:36:03,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:35:56" (1/3) ... [2021-11-06 21:36:03,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ce379a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:36:03, skipping insertion in model container [2021-11-06 21:36:03,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:35:58" (2/3) ... [2021-11-06 21:36:03,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ce379a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:36:03, skipping insertion in model container [2021-11-06 21:36:03,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:36:03" (3/3) ... [2021-11-06 21:36:03,836 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i [2021-11-06 21:36:03,840 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 21:36:03,840 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2021-11-06 21:36:03,870 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 21:36:03,873 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 21:36:03,873 INFO L340 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2021-11-06 21:36:03,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 250 states have (on average 1.528) internal successors, (382), 301 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:03,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-06 21:36:03,889 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:03,890 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:03,890 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:03,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:03,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1985216017, now seen corresponding path program 1 times [2021-11-06 21:36:03,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:03,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056626969] [2021-11-06 21:36:03,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:03,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:04,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:04,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056626969] [2021-11-06 21:36:04,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056626969] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:04,385 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:04,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:04,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212696102] [2021-11-06 21:36:04,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:04,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:04,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:04,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:04,404 INFO L87 Difference]: Start difference. First operand has 302 states, 250 states have (on average 1.528) internal successors, (382), 301 states have internal predecessors, (382), 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) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:04,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:04,568 INFO L93 Difference]: Finished difference Result 1080 states and 1363 transitions. [2021-11-06 21:36:04,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:36:04,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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) Word has length 13 [2021-11-06 21:36:04,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:04,587 INFO L225 Difference]: With dead ends: 1080 [2021-11-06 21:36:04,591 INFO L226 Difference]: Without dead ends: 770 [2021-11-06 21:36:04,594 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:04,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2021-11-06 21:36:04,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 286. [2021-11-06 21:36:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 235 states have (on average 1.2765957446808511) internal successors, (300), 285 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 300 transitions. [2021-11-06 21:36:04,658 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 300 transitions. Word has length 13 [2021-11-06 21:36:04,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:04,659 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 300 transitions. [2021-11-06 21:36:04,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:04,659 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 300 transitions. [2021-11-06 21:36:04,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-06 21:36:04,660 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:04,660 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:04,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 21:36:04,660 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:04,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:04,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1226818338, now seen corresponding path program 1 times [2021-11-06 21:36:04,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:04,666 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420665728] [2021-11-06 21:36:04,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:04,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:04,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:04,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:04,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420665728] [2021-11-06 21:36:04,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420665728] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:04,832 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:04,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:04,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250297783] [2021-11-06 21:36:04,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:04,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:04,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:04,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:04,835 INFO L87 Difference]: Start difference. First operand 286 states and 300 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:04,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:04,910 INFO L93 Difference]: Finished difference Result 545 states and 570 transitions. [2021-11-06 21:36:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:04,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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) Word has length 19 [2021-11-06 21:36:04,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:04,916 INFO L225 Difference]: With dead ends: 545 [2021-11-06 21:36:04,916 INFO L226 Difference]: Without dead ends: 543 [2021-11-06 21:36:04,917 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-11-06 21:36:04,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 284. [2021-11-06 21:36:04,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 234 states have (on average 1.2735042735042734) internal successors, (298), 283 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:04,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 298 transitions. [2021-11-06 21:36:04,932 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 298 transitions. Word has length 19 [2021-11-06 21:36:04,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:04,932 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 298 transitions. [2021-11-06 21:36:04,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 298 transitions. [2021-11-06 21:36:04,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-06 21:36:04,934 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:04,934 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:04,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 21:36:04,934 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:04,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:04,935 INFO L85 PathProgramCache]: Analyzing trace with hash -905783165, now seen corresponding path program 1 times [2021-11-06 21:36:04,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:04,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874701390] [2021-11-06 21:36:04,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:04,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:05,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:05,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:05,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874701390] [2021-11-06 21:36:05,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874701390] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:05,127 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:05,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:05,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672781131] [2021-11-06 21:36:05,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:05,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:05,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:05,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:05,145 INFO L87 Difference]: Start difference. First operand 284 states and 298 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:05,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:05,196 INFO L93 Difference]: Finished difference Result 523 states and 546 transitions. [2021-11-06 21:36:05,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:36:05,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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) Word has length 33 [2021-11-06 21:36:05,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:05,198 INFO L225 Difference]: With dead ends: 523 [2021-11-06 21:36:05,198 INFO L226 Difference]: Without dead ends: 521 [2021-11-06 21:36:05,200 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:05,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-11-06 21:36:05,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 282. [2021-11-06 21:36:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 233 states have (on average 1.2703862660944205) internal successors, (296), 281 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 296 transitions. [2021-11-06 21:36:05,211 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 296 transitions. Word has length 33 [2021-11-06 21:36:05,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:05,211 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 296 transitions. [2021-11-06 21:36:05,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:05,211 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 296 transitions. [2021-11-06 21:36:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-06 21:36:05,213 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:05,213 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:05,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 21:36:05,213 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:05,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:05,214 INFO L85 PathProgramCache]: Analyzing trace with hash 327370800, now seen corresponding path program 1 times [2021-11-06 21:36:05,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:05,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044712661] [2021-11-06 21:36:05,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:05,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:05,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:05,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:05,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044712661] [2021-11-06 21:36:05,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044712661] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:05,376 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:05,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:05,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976077906] [2021-11-06 21:36:05,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:05,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:05,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:05,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:05,378 INFO L87 Difference]: Start difference. First operand 282 states and 296 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:05,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:05,448 INFO L93 Difference]: Finished difference Result 511 states and 533 transitions. [2021-11-06 21:36:05,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:05,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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) Word has length 40 [2021-11-06 21:36:05,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:05,451 INFO L225 Difference]: With dead ends: 511 [2021-11-06 21:36:05,451 INFO L226 Difference]: Without dead ends: 509 [2021-11-06 21:36:05,451 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:05,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2021-11-06 21:36:05,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 280. [2021-11-06 21:36:05,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 232 states have (on average 1.2672413793103448) internal successors, (294), 279 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:05,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 294 transitions. [2021-11-06 21:36:05,463 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 294 transitions. Word has length 40 [2021-11-06 21:36:05,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:05,464 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 294 transitions. [2021-11-06 21:36:05,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:05,464 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 294 transitions. [2021-11-06 21:36:05,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-06 21:36:05,469 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:05,469 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:05,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 21:36:05,470 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:05,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:05,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1038118901, now seen corresponding path program 1 times [2021-11-06 21:36:05,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:05,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729081963] [2021-11-06 21:36:05,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:05,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:05,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:05,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729081963] [2021-11-06 21:36:05,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729081963] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:05,648 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:05,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:05,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807724068] [2021-11-06 21:36:05,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:05,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:05,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:05,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:05,650 INFO L87 Difference]: Start difference. First operand 280 states and 294 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:05,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:05,685 INFO L93 Difference]: Finished difference Result 280 states and 294 transitions. [2021-11-06 21:36:05,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:05,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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) Word has length 43 [2021-11-06 21:36:05,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:05,687 INFO L225 Difference]: With dead ends: 280 [2021-11-06 21:36:05,688 INFO L226 Difference]: Without dead ends: 276 [2021-11-06 21:36:05,688 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:05,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-11-06 21:36:05,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2021-11-06 21:36:05,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 230 states have (on average 1.2608695652173914) internal successors, (290), 275 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:05,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 290 transitions. [2021-11-06 21:36:05,699 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 290 transitions. Word has length 43 [2021-11-06 21:36:05,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:05,701 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 290 transitions. [2021-11-06 21:36:05,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:05,701 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 290 transitions. [2021-11-06 21:36:05,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-06 21:36:05,702 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:05,702 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:05,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 21:36:05,702 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:05,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:05,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1199715761, now seen corresponding path program 1 times [2021-11-06 21:36:05,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:05,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278553416] [2021-11-06 21:36:05,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:05,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:05,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:05,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:05,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278553416] [2021-11-06 21:36:05,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278553416] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:05,870 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:05,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:05,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406625826] [2021-11-06 21:36:05,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:05,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:05,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:05,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:05,871 INFO L87 Difference]: Start difference. First operand 276 states and 290 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:05,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:05,912 INFO L93 Difference]: Finished difference Result 276 states and 290 transitions. [2021-11-06 21:36:05,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:05,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 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) Word has length 45 [2021-11-06 21:36:05,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:05,915 INFO L225 Difference]: With dead ends: 276 [2021-11-06 21:36:05,915 INFO L226 Difference]: Without dead ends: 272 [2021-11-06 21:36:05,915 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:05,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-11-06 21:36:05,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2021-11-06 21:36:05,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 228 states have (on average 1.2543859649122806) internal successors, (286), 271 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:05,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 286 transitions. [2021-11-06 21:36:05,927 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 286 transitions. Word has length 45 [2021-11-06 21:36:05,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:05,927 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 286 transitions. [2021-11-06 21:36:05,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:05,927 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 286 transitions. [2021-11-06 21:36:05,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-06 21:36:05,929 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:05,929 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:05,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 21:36:05,930 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:05,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:05,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1748254403, now seen corresponding path program 1 times [2021-11-06 21:36:05,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:05,930 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700254573] [2021-11-06 21:36:05,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:05,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:06,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:06,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700254573] [2021-11-06 21:36:06,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700254573] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:06,391 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:06,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 21:36:06,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885038638] [2021-11-06 21:36:06,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 21:36:06,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:06,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 21:36:06,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-06 21:36:06,392 INFO L87 Difference]: Start difference. First operand 272 states and 286 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:06,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:06,783 INFO L93 Difference]: Finished difference Result 830 states and 861 transitions. [2021-11-06 21:36:06,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 21:36:06,784 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 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) Word has length 46 [2021-11-06 21:36:06,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:06,786 INFO L225 Difference]: With dead ends: 830 [2021-11-06 21:36:06,786 INFO L226 Difference]: Without dead ends: 616 [2021-11-06 21:36:06,787 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-11-06 21:36:06,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2021-11-06 21:36:06,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 340. [2021-11-06 21:36:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 296 states have (on average 1.2297297297297298) internal successors, (364), 339 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 364 transitions. [2021-11-06 21:36:06,806 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 364 transitions. Word has length 46 [2021-11-06 21:36:06,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:06,807 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 364 transitions. [2021-11-06 21:36:06,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:06,807 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 364 transitions. [2021-11-06 21:36:06,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-06 21:36:06,808 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:06,808 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:06,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 21:36:06,808 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:06,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:06,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1875475213, now seen corresponding path program 1 times [2021-11-06 21:36:06,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:06,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58119843] [2021-11-06 21:36:06,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:06,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:06,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:06,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:06,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58119843] [2021-11-06 21:36:06,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58119843] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:06,943 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:06,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:06,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093947430] [2021-11-06 21:36:06,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:06,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:06,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:06,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:06,944 INFO L87 Difference]: Start difference. First operand 340 states and 364 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:06,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:06,984 INFO L93 Difference]: Finished difference Result 340 states and 364 transitions. [2021-11-06 21:36:06,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:06,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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) Word has length 47 [2021-11-06 21:36:06,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:06,986 INFO L225 Difference]: With dead ends: 340 [2021-11-06 21:36:06,986 INFO L226 Difference]: Without dead ends: 336 [2021-11-06 21:36:06,986 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2021-11-06 21:36:07,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2021-11-06 21:36:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 294 states have (on average 1.2244897959183674) internal successors, (360), 335 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 360 transitions. [2021-11-06 21:36:07,008 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 360 transitions. Word has length 47 [2021-11-06 21:36:07,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:07,008 INFO L470 AbstractCegarLoop]: Abstraction has 336 states and 360 transitions. [2021-11-06 21:36:07,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:07,009 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 360 transitions. [2021-11-06 21:36:07,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-06 21:36:07,009 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:07,009 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:07,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 21:36:07,010 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:07,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:07,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1984079013, now seen corresponding path program 1 times [2021-11-06 21:36:07,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:07,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765438640] [2021-11-06 21:36:07,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:07,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:07,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:07,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765438640] [2021-11-06 21:36:07,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765438640] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:07,418 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:07,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-06 21:36:07,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095057711] [2021-11-06 21:36:07,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 21:36:07,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:07,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 21:36:07,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-06 21:36:07,419 INFO L87 Difference]: Start difference. First operand 336 states and 360 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:07,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:07,930 INFO L93 Difference]: Finished difference Result 703 states and 727 transitions. [2021-11-06 21:36:07,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 21:36:07,931 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 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) Word has length 48 [2021-11-06 21:36:07,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:07,932 INFO L225 Difference]: With dead ends: 703 [2021-11-06 21:36:07,932 INFO L226 Difference]: Without dead ends: 511 [2021-11-06 21:36:07,933 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-11-06 21:36:07,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-11-06 21:36:07,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 334. [2021-11-06 21:36:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 292 states have (on average 1.2226027397260273) internal successors, (357), 333 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 357 transitions. [2021-11-06 21:36:07,962 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 357 transitions. Word has length 48 [2021-11-06 21:36:07,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:07,962 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 357 transitions. [2021-11-06 21:36:07,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:07,962 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 357 transitions. [2021-11-06 21:36:07,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 21:36:07,963 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:07,963 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:07,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 21:36:07,964 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:07,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:07,964 INFO L85 PathProgramCache]: Analyzing trace with hash 635663280, now seen corresponding path program 1 times [2021-11-06 21:36:07,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:07,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729483865] [2021-11-06 21:36:07,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:07,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:08,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:08,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729483865] [2021-11-06 21:36:08,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729483865] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:08,444 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:08,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 21:36:08,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655888102] [2021-11-06 21:36:08,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 21:36:08,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:08,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 21:36:08,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-06 21:36:08,445 INFO L87 Difference]: Start difference. First operand 334 states and 357 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:11,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:11,098 INFO L93 Difference]: Finished difference Result 912 states and 941 transitions. [2021-11-06 21:36:11,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 21:36:11,099 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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) Word has length 51 [2021-11-06 21:36:11,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:11,101 INFO L225 Difference]: With dead ends: 912 [2021-11-06 21:36:11,101 INFO L226 Difference]: Without dead ends: 812 [2021-11-06 21:36:11,119 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2021-11-06 21:36:11,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2021-11-06 21:36:11,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 351. [2021-11-06 21:36:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 309 states have (on average 1.2135922330097086) internal successors, (375), 350 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 375 transitions. [2021-11-06 21:36:11,158 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 375 transitions. Word has length 51 [2021-11-06 21:36:11,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:11,158 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 375 transitions. [2021-11-06 21:36:11,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:11,158 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 375 transitions. [2021-11-06 21:36:11,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 21:36:11,159 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:11,159 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:11,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 21:36:11,160 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:11,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:11,160 INFO L85 PathProgramCache]: Analyzing trace with hash -682769680, now seen corresponding path program 1 times [2021-11-06 21:36:11,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:11,160 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640401958] [2021-11-06 21:36:11,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:11,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:11,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:11,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640401958] [2021-11-06 21:36:11,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640401958] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:11,285 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:11,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:11,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166591527] [2021-11-06 21:36:11,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:11,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:11,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:11,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:11,287 INFO L87 Difference]: Start difference. First operand 351 states and 375 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:11,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:11,379 INFO L93 Difference]: Finished difference Result 561 states and 589 transitions. [2021-11-06 21:36:11,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:11,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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) Word has length 51 [2021-11-06 21:36:11,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:11,381 INFO L225 Difference]: With dead ends: 561 [2021-11-06 21:36:11,381 INFO L226 Difference]: Without dead ends: 557 [2021-11-06 21:36:11,381 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:11,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2021-11-06 21:36:11,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 347. [2021-11-06 21:36:11,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 307 states have (on average 1.205211726384365) internal successors, (370), 346 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:11,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 370 transitions. [2021-11-06 21:36:11,408 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 370 transitions. Word has length 51 [2021-11-06 21:36:11,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:11,408 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 370 transitions. [2021-11-06 21:36:11,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:11,409 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 370 transitions. [2021-11-06 21:36:11,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-06 21:36:11,409 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:11,409 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:11,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 21:36:11,409 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:11,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:11,410 INFO L85 PathProgramCache]: Analyzing trace with hash -732791644, now seen corresponding path program 1 times [2021-11-06 21:36:11,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:11,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637123897] [2021-11-06 21:36:11,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:11,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:11,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:11,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637123897] [2021-11-06 21:36:11,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637123897] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:11,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:11,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:11,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560523316] [2021-11-06 21:36:11,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:11,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:11,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:11,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:11,520 INFO L87 Difference]: Start difference. First operand 347 states and 370 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:11,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:11,575 INFO L93 Difference]: Finished difference Result 347 states and 370 transitions. [2021-11-06 21:36:11,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:11,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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) Word has length 54 [2021-11-06 21:36:11,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:11,577 INFO L225 Difference]: With dead ends: 347 [2021-11-06 21:36:11,577 INFO L226 Difference]: Without dead ends: 343 [2021-11-06 21:36:11,577 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:11,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-11-06 21:36:11,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2021-11-06 21:36:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 305 states have (on average 1.2) internal successors, (366), 342 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:11,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 366 transitions. [2021-11-06 21:36:11,604 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 366 transitions. Word has length 54 [2021-11-06 21:36:11,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:11,604 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 366 transitions. [2021-11-06 21:36:11,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:11,605 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 366 transitions. [2021-11-06 21:36:11,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-06 21:36:11,605 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:11,605 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:11,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 21:36:11,606 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:11,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:11,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1040003942, now seen corresponding path program 1 times [2021-11-06 21:36:11,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:11,606 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181810533] [2021-11-06 21:36:11,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:11,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:13,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:13,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181810533] [2021-11-06 21:36:13,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181810533] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:13,041 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:13,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 21:36:13,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959064010] [2021-11-06 21:36:13,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 21:36:13,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:13,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 21:36:13,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-06 21:36:13,042 INFO L87 Difference]: Start difference. First operand 343 states and 366 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:13,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:13,546 INFO L93 Difference]: Finished difference Result 830 states and 873 transitions. [2021-11-06 21:36:13,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 21:36:13,547 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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) Word has length 54 [2021-11-06 21:36:13,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:13,548 INFO L225 Difference]: With dead ends: 830 [2021-11-06 21:36:13,548 INFO L226 Difference]: Without dead ends: 546 [2021-11-06 21:36:13,549 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2021-11-06 21:36:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2021-11-06 21:36:13,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 358. [2021-11-06 21:36:13,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 320 states have (on average 1.190625) internal successors, (381), 357 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:13,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 381 transitions. [2021-11-06 21:36:13,588 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 381 transitions. Word has length 54 [2021-11-06 21:36:13,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:13,588 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 381 transitions. [2021-11-06 21:36:13,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 381 transitions. [2021-11-06 21:36:13,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-06 21:36:13,589 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:13,589 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:13,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 21:36:13,589 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:13,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:13,590 INFO L85 PathProgramCache]: Analyzing trace with hash -2086841005, now seen corresponding path program 1 times [2021-11-06 21:36:13,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:13,590 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441663596] [2021-11-06 21:36:13,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:13,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:13,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:13,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:13,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441663596] [2021-11-06 21:36:13,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441663596] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:13,977 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:13,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 21:36:13,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965952112] [2021-11-06 21:36:13,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 21:36:13,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:13,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 21:36:13,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-06 21:36:13,978 INFO L87 Difference]: Start difference. First operand 358 states and 381 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:22,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:22,891 INFO L93 Difference]: Finished difference Result 614 states and 636 transitions. [2021-11-06 21:36:22,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 21:36:22,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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) Word has length 55 [2021-11-06 21:36:22,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:22,894 INFO L225 Difference]: With dead ends: 614 [2021-11-06 21:36:22,894 INFO L226 Difference]: Without dead ends: 527 [2021-11-06 21:36:22,895 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-11-06 21:36:22,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2021-11-06 21:36:22,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 360. [2021-11-06 21:36:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 322 states have (on average 1.18944099378882) internal successors, (383), 359 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 383 transitions. [2021-11-06 21:36:22,959 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 383 transitions. Word has length 55 [2021-11-06 21:36:22,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:22,960 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 383 transitions. [2021-11-06 21:36:22,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 383 transitions. [2021-11-06 21:36:22,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-06 21:36:22,961 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:22,961 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:22,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 21:36:22,962 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:22,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:22,962 INFO L85 PathProgramCache]: Analyzing trace with hash 162003144, now seen corresponding path program 1 times [2021-11-06 21:36:22,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:22,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890423602] [2021-11-06 21:36:22,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:22,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:23,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:23,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890423602] [2021-11-06 21:36:23,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890423602] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:23,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:23,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:23,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106604808] [2021-11-06 21:36:23,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:23,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:23,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:23,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:23,103 INFO L87 Difference]: Start difference. First operand 360 states and 383 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:23,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:23,258 INFO L93 Difference]: Finished difference Result 577 states and 606 transitions. [2021-11-06 21:36:23,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:36:23,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 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) Word has length 56 [2021-11-06 21:36:23,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:23,260 INFO L225 Difference]: With dead ends: 577 [2021-11-06 21:36:23,260 INFO L226 Difference]: Without dead ends: 573 [2021-11-06 21:36:23,261 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:23,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2021-11-06 21:36:23,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 437. [2021-11-06 21:36:23,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 399 states have (on average 1.1779448621553885) internal successors, (470), 436 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:23,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 470 transitions. [2021-11-06 21:36:23,312 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 470 transitions. Word has length 56 [2021-11-06 21:36:23,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:23,312 INFO L470 AbstractCegarLoop]: Abstraction has 437 states and 470 transitions. [2021-11-06 21:36:23,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:23,312 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 470 transitions. [2021-11-06 21:36:23,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-06 21:36:23,317 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:23,317 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:23,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 21:36:23,317 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:23,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:23,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1111205903, now seen corresponding path program 1 times [2021-11-06 21:36:23,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:23,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569493318] [2021-11-06 21:36:23,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:23,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:23,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:23,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:23,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569493318] [2021-11-06 21:36:23,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569493318] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:23,432 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:23,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:36:23,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215905998] [2021-11-06 21:36:23,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:23,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:23,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:23,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:23,433 INFO L87 Difference]: Start difference. First operand 437 states and 470 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:25,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:25,719 INFO L93 Difference]: Finished difference Result 736 states and 764 transitions. [2021-11-06 21:36:25,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:36:25,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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) Word has length 56 [2021-11-06 21:36:25,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:25,721 INFO L225 Difference]: With dead ends: 736 [2021-11-06 21:36:25,721 INFO L226 Difference]: Without dead ends: 732 [2021-11-06 21:36:25,722 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:25,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2021-11-06 21:36:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 436. [2021-11-06 21:36:25,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 399 states have (on average 1.1754385964912282) internal successors, (469), 435 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 469 transitions. [2021-11-06 21:36:25,792 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 469 transitions. Word has length 56 [2021-11-06 21:36:25,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:25,792 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 469 transitions. [2021-11-06 21:36:25,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 469 transitions. [2021-11-06 21:36:25,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 21:36:25,793 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:25,793 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:25,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 21:36:25,793 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:25,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:25,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1539369976, now seen corresponding path program 1 times [2021-11-06 21:36:25,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:25,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442193674] [2021-11-06 21:36:25,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:25,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:27,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:27,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:27,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442193674] [2021-11-06 21:36:27,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442193674] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:27,410 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:27,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-06 21:36:27,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183761082] [2021-11-06 21:36:27,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-06 21:36:27,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:27,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-06 21:36:27,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-11-06 21:36:27,411 INFO L87 Difference]: Start difference. First operand 436 states and 469 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:29,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:29,961 INFO L93 Difference]: Finished difference Result 1350 states and 1394 transitions. [2021-11-06 21:36:29,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-06 21:36:29,962 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 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) Word has length 57 [2021-11-06 21:36:29,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:29,965 INFO L225 Difference]: With dead ends: 1350 [2021-11-06 21:36:29,965 INFO L226 Difference]: Without dead ends: 1246 [2021-11-06 21:36:29,967 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=564, Invalid=1506, Unknown=0, NotChecked=0, Total=2070 [2021-11-06 21:36:29,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2021-11-06 21:36:30,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 436. [2021-11-06 21:36:30,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 399 states have (on average 1.1704260651629073) internal successors, (467), 435 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:30,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 467 transitions. [2021-11-06 21:36:30,032 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 467 transitions. Word has length 57 [2021-11-06 21:36:30,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:30,032 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 467 transitions. [2021-11-06 21:36:30,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:30,032 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 467 transitions. [2021-11-06 21:36:30,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-06 21:36:30,033 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:30,033 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:30,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 21:36:30,033 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:30,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:30,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1066335564, now seen corresponding path program 1 times [2021-11-06 21:36:30,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:30,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144013678] [2021-11-06 21:36:30,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:30,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:30,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:30,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:30,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144013678] [2021-11-06 21:36:30,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144013678] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:30,169 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:30,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:30,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849803221] [2021-11-06 21:36:30,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:30,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:30,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:30,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:30,171 INFO L87 Difference]: Start difference. First operand 436 states and 467 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:30,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:30,299 INFO L93 Difference]: Finished difference Result 650 states and 702 transitions. [2021-11-06 21:36:30,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:36:30,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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) Word has length 58 [2021-11-06 21:36:30,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:30,301 INFO L225 Difference]: With dead ends: 650 [2021-11-06 21:36:30,301 INFO L226 Difference]: Without dead ends: 646 [2021-11-06 21:36:30,302 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:30,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2021-11-06 21:36:30,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 546. [2021-11-06 21:36:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 510 states have (on average 1.1627450980392158) internal successors, (593), 545 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:30,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 593 transitions. [2021-11-06 21:36:30,376 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 593 transitions. Word has length 58 [2021-11-06 21:36:30,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:30,377 INFO L470 AbstractCegarLoop]: Abstraction has 546 states and 593 transitions. [2021-11-06 21:36:30,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:30,377 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 593 transitions. [2021-11-06 21:36:30,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-06 21:36:30,377 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:30,378 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:30,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 21:36:30,378 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:30,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:30,379 INFO L85 PathProgramCache]: Analyzing trace with hash 527484261, now seen corresponding path program 1 times [2021-11-06 21:36:30,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:30,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957474529] [2021-11-06 21:36:30,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:30,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:30,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:30,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:30,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957474529] [2021-11-06 21:36:30,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957474529] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:30,917 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:30,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-06 21:36:30,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401093352] [2021-11-06 21:36:30,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 21:36:30,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:30,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 21:36:30,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-06 21:36:30,918 INFO L87 Difference]: Start difference. First operand 546 states and 593 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:39,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:39,869 INFO L93 Difference]: Finished difference Result 740 states and 787 transitions. [2021-11-06 21:36:39,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 21:36:39,870 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 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) Word has length 58 [2021-11-06 21:36:39,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:39,872 INFO L225 Difference]: With dead ends: 740 [2021-11-06 21:36:39,872 INFO L226 Difference]: Without dead ends: 618 [2021-11-06 21:36:39,872 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-11-06 21:36:39,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2021-11-06 21:36:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 532. [2021-11-06 21:36:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 496 states have (on average 1.1633064516129032) internal successors, (577), 531 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 577 transitions. [2021-11-06 21:36:39,946 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 577 transitions. Word has length 58 [2021-11-06 21:36:39,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:39,946 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 577 transitions. [2021-11-06 21:36:39,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:39,946 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 577 transitions. [2021-11-06 21:36:39,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-06 21:36:39,947 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:39,947 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:39,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 21:36:39,947 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:39,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:39,948 INFO L85 PathProgramCache]: Analyzing trace with hash 456395359, now seen corresponding path program 1 times [2021-11-06 21:36:39,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:39,948 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852973661] [2021-11-06 21:36:39,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:39,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:40,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:40,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:40,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852973661] [2021-11-06 21:36:40,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852973661] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:40,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:40,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 21:36:40,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681149879] [2021-11-06 21:36:40,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 21:36:40,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:40,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 21:36:40,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-06 21:36:40,486 INFO L87 Difference]: Start difference. First operand 532 states and 577 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:41,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:41,024 INFO L93 Difference]: Finished difference Result 680 states and 723 transitions. [2021-11-06 21:36:41,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 21:36:41,025 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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) Word has length 58 [2021-11-06 21:36:41,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:41,026 INFO L225 Difference]: With dead ends: 680 [2021-11-06 21:36:41,027 INFO L226 Difference]: Without dead ends: 591 [2021-11-06 21:36:41,027 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2021-11-06 21:36:41,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2021-11-06 21:36:41,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 518. [2021-11-06 21:36:41,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 482 states have (on average 1.16597510373444) internal successors, (562), 517 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:41,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 562 transitions. [2021-11-06 21:36:41,116 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 562 transitions. Word has length 58 [2021-11-06 21:36:41,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:41,116 INFO L470 AbstractCegarLoop]: Abstraction has 518 states and 562 transitions. [2021-11-06 21:36:41,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 562 transitions. [2021-11-06 21:36:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-06 21:36:41,117 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:41,117 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:41,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 21:36:41,118 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:41,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:41,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1748569552, now seen corresponding path program 1 times [2021-11-06 21:36:41,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:41,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004006991] [2021-11-06 21:36:41,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:41,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:41,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:41,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:41,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004006991] [2021-11-06 21:36:41,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004006991] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:41,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:41,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:41,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47172720] [2021-11-06 21:36:41,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:41,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:41,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:41,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:41,239 INFO L87 Difference]: Start difference. First operand 518 states and 562 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:41,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:41,349 INFO L93 Difference]: Finished difference Result 518 states and 562 transitions. [2021-11-06 21:36:41,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:41,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 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) Word has length 60 [2021-11-06 21:36:41,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:41,350 INFO L225 Difference]: With dead ends: 518 [2021-11-06 21:36:41,350 INFO L226 Difference]: Without dead ends: 514 [2021-11-06 21:36:41,351 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:41,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-11-06 21:36:41,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2021-11-06 21:36:41,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 480 states have (on average 1.1625) internal successors, (558), 513 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:41,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 558 transitions. [2021-11-06 21:36:41,436 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 558 transitions. Word has length 60 [2021-11-06 21:36:41,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:41,436 INFO L470 AbstractCegarLoop]: Abstraction has 514 states and 558 transitions. [2021-11-06 21:36:41,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:41,436 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 558 transitions. [2021-11-06 21:36:41,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 21:36:41,437 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:41,437 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:41,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 21:36:41,437 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:41,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:41,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1042989196, now seen corresponding path program 1 times [2021-11-06 21:36:41,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:41,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736530543] [2021-11-06 21:36:41,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:41,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:41,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:41,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:41,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736530543] [2021-11-06 21:36:41,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736530543] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:41,543 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:41,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:41,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976976466] [2021-11-06 21:36:41,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:41,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:41,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:41,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:41,544 INFO L87 Difference]: Start difference. First operand 514 states and 558 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:41,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:41,644 INFO L93 Difference]: Finished difference Result 514 states and 558 transitions. [2021-11-06 21:36:41,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:41,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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) Word has length 62 [2021-11-06 21:36:41,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:41,646 INFO L225 Difference]: With dead ends: 514 [2021-11-06 21:36:41,646 INFO L226 Difference]: Without dead ends: 510 [2021-11-06 21:36:41,646 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:41,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2021-11-06 21:36:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2021-11-06 21:36:41,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 478 states have (on average 1.1589958158995817) internal successors, (554), 509 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:41,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 554 transitions. [2021-11-06 21:36:41,746 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 554 transitions. Word has length 62 [2021-11-06 21:36:41,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:41,747 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 554 transitions. [2021-11-06 21:36:41,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:41,747 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 554 transitions. [2021-11-06 21:36:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 21:36:41,747 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:41,748 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:41,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 21:36:41,748 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:41,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:41,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1585100489, now seen corresponding path program 1 times [2021-11-06 21:36:41,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:41,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469925405] [2021-11-06 21:36:41,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:41,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:41,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:41,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469925405] [2021-11-06 21:36:41,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469925405] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:41,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:41,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:41,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499090748] [2021-11-06 21:36:41,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:41,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:41,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:41,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:41,860 INFO L87 Difference]: Start difference. First operand 510 states and 554 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:41,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:41,970 INFO L93 Difference]: Finished difference Result 510 states and 554 transitions. [2021-11-06 21:36:41,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:41,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 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) Word has length 64 [2021-11-06 21:36:41,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:41,972 INFO L225 Difference]: With dead ends: 510 [2021-11-06 21:36:41,972 INFO L226 Difference]: Without dead ends: 506 [2021-11-06 21:36:41,972 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:41,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-11-06 21:36:42,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2021-11-06 21:36:42,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 476 states have (on average 1.1554621848739495) internal successors, (550), 505 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:42,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 550 transitions. [2021-11-06 21:36:42,055 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 550 transitions. Word has length 64 [2021-11-06 21:36:42,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:42,055 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 550 transitions. [2021-11-06 21:36:42,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:42,055 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 550 transitions. [2021-11-06 21:36:42,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-06 21:36:42,056 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:42,056 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:42,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-06 21:36:42,057 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:42,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:42,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1431958363, now seen corresponding path program 1 times [2021-11-06 21:36:42,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:42,057 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226624766] [2021-11-06 21:36:42,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:42,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:42,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:42,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226624766] [2021-11-06 21:36:42,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226624766] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:42,168 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:42,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:42,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393248009] [2021-11-06 21:36:42,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:42,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:42,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:42,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:42,170 INFO L87 Difference]: Start difference. First operand 506 states and 550 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:42,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:42,286 INFO L93 Difference]: Finished difference Result 506 states and 550 transitions. [2021-11-06 21:36:42,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:42,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 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) Word has length 66 [2021-11-06 21:36:42,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:42,288 INFO L225 Difference]: With dead ends: 506 [2021-11-06 21:36:42,288 INFO L226 Difference]: Without dead ends: 502 [2021-11-06 21:36:42,288 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-11-06 21:36:42,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2021-11-06 21:36:42,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 474 states have (on average 1.1518987341772151) internal successors, (546), 501 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:42,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 546 transitions. [2021-11-06 21:36:42,371 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 546 transitions. Word has length 66 [2021-11-06 21:36:42,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:42,371 INFO L470 AbstractCegarLoop]: Abstraction has 502 states and 546 transitions. [2021-11-06 21:36:42,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:42,372 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 546 transitions. [2021-11-06 21:36:42,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 21:36:42,372 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:42,373 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:42,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-06 21:36:42,373 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:42,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:42,373 INFO L85 PathProgramCache]: Analyzing trace with hash 552374612, now seen corresponding path program 1 times [2021-11-06 21:36:42,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:42,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684633501] [2021-11-06 21:36:42,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:42,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:42,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:42,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684633501] [2021-11-06 21:36:42,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684633501] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:42,560 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:42,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 21:36:42,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906297065] [2021-11-06 21:36:42,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 21:36:42,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:42,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 21:36:42,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 21:36:42,561 INFO L87 Difference]: Start difference. First operand 502 states and 546 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:42,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:42,913 INFO L93 Difference]: Finished difference Result 1103 states and 1164 transitions. [2021-11-06 21:36:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 21:36:42,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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) Word has length 67 [2021-11-06 21:36:42,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:42,916 INFO L225 Difference]: With dead ends: 1103 [2021-11-06 21:36:42,916 INFO L226 Difference]: Without dead ends: 898 [2021-11-06 21:36:42,918 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-06 21:36:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2021-11-06 21:36:43,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 502. [2021-11-06 21:36:43,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 474 states have (on average 1.1476793248945147) internal successors, (544), 501 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:43,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 544 transitions. [2021-11-06 21:36:43,019 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 544 transitions. Word has length 67 [2021-11-06 21:36:43,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:43,020 INFO L470 AbstractCegarLoop]: Abstraction has 502 states and 544 transitions. [2021-11-06 21:36:43,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:43,021 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 544 transitions. [2021-11-06 21:36:43,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-06 21:36:43,021 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:43,022 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:43,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-06 21:36:43,022 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:43,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:43,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1722590687, now seen corresponding path program 1 times [2021-11-06 21:36:43,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:43,023 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695542819] [2021-11-06 21:36:43,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:43,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:43,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:43,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695542819] [2021-11-06 21:36:43,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695542819] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:43,183 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:43,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:43,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892796439] [2021-11-06 21:36:43,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:43,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:43,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:43,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:43,184 INFO L87 Difference]: Start difference. First operand 502 states and 544 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:43,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:43,293 INFO L93 Difference]: Finished difference Result 502 states and 544 transitions. [2021-11-06 21:36:43,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:43,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 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) Word has length 68 [2021-11-06 21:36:43,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:43,295 INFO L225 Difference]: With dead ends: 502 [2021-11-06 21:36:43,295 INFO L226 Difference]: Without dead ends: 498 [2021-11-06 21:36:43,295 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:43,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2021-11-06 21:36:43,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2021-11-06 21:36:43,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 472 states have (on average 1.1440677966101696) internal successors, (540), 497 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:43,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 540 transitions. [2021-11-06 21:36:43,394 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 540 transitions. Word has length 68 [2021-11-06 21:36:43,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:43,394 INFO L470 AbstractCegarLoop]: Abstraction has 498 states and 540 transitions. [2021-11-06 21:36:43,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:43,394 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 540 transitions. [2021-11-06 21:36:43,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 21:36:43,395 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:43,395 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:43,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-06 21:36:43,395 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:43,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:43,397 INFO L85 PathProgramCache]: Analyzing trace with hash -460102869, now seen corresponding path program 1 times [2021-11-06 21:36:43,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:43,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045470451] [2021-11-06 21:36:43,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:43,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:43,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:43,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:43,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045470451] [2021-11-06 21:36:43,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045470451] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:43,502 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:43,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:36:43,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623533632] [2021-11-06 21:36:43,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:43,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:43,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:43,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:43,503 INFO L87 Difference]: Start difference. First operand 498 states and 540 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:45,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:45,812 INFO L93 Difference]: Finished difference Result 588 states and 635 transitions. [2021-11-06 21:36:45,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:36:45,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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) Word has length 69 [2021-11-06 21:36:45,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:45,815 INFO L225 Difference]: With dead ends: 588 [2021-11-06 21:36:45,815 INFO L226 Difference]: Without dead ends: 586 [2021-11-06 21:36:45,815 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:45,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2021-11-06 21:36:45,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 530. [2021-11-06 21:36:45,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 504 states have (on average 1.1488095238095237) internal successors, (579), 529 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 579 transitions. [2021-11-06 21:36:45,910 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 579 transitions. Word has length 69 [2021-11-06 21:36:45,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:45,910 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 579 transitions. [2021-11-06 21:36:45,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 579 transitions. [2021-11-06 21:36:45,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-06 21:36:45,911 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:45,911 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:45,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-06 21:36:45,912 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:45,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:45,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1847380163, now seen corresponding path program 1 times [2021-11-06 21:36:45,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:45,912 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452106102] [2021-11-06 21:36:45,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:45,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:46,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:46,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:46,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452106102] [2021-11-06 21:36:46,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452106102] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:46,042 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:46,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:46,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527180670] [2021-11-06 21:36:46,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:46,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:46,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:46,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:46,043 INFO L87 Difference]: Start difference. First operand 530 states and 579 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:46,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:46,167 INFO L93 Difference]: Finished difference Result 530 states and 579 transitions. [2021-11-06 21:36:46,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:46,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 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) Word has length 70 [2021-11-06 21:36:46,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:46,169 INFO L225 Difference]: With dead ends: 530 [2021-11-06 21:36:46,169 INFO L226 Difference]: Without dead ends: 526 [2021-11-06 21:36:46,169 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:46,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-11-06 21:36:46,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2021-11-06 21:36:46,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 502 states have (on average 1.1454183266932272) internal successors, (575), 525 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:46,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 575 transitions. [2021-11-06 21:36:46,263 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 575 transitions. Word has length 70 [2021-11-06 21:36:46,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:46,264 INFO L470 AbstractCegarLoop]: Abstraction has 526 states and 575 transitions. [2021-11-06 21:36:46,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:46,264 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 575 transitions. [2021-11-06 21:36:46,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 21:36:46,265 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:46,265 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:46,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-06 21:36:46,265 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:46,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:46,265 INFO L85 PathProgramCache]: Analyzing trace with hash 963538492, now seen corresponding path program 1 times [2021-11-06 21:36:46,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:46,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658748366] [2021-11-06 21:36:46,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:46,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:46,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:46,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:46,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658748366] [2021-11-06 21:36:46,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658748366] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:46,907 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:46,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 21:36:46,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521794912] [2021-11-06 21:36:46,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 21:36:46,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:46,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 21:36:46,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-06 21:36:46,908 INFO L87 Difference]: Start difference. First operand 526 states and 575 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:47,271 INFO L93 Difference]: Finished difference Result 1132 states and 1196 transitions. [2021-11-06 21:36:47,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 21:36:47,271 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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) Word has length 71 [2021-11-06 21:36:47,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:47,273 INFO L225 Difference]: With dead ends: 1132 [2021-11-06 21:36:47,273 INFO L226 Difference]: Without dead ends: 880 [2021-11-06 21:36:47,274 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2021-11-06 21:36:47,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2021-11-06 21:36:47,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 526. [2021-11-06 21:36:47,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 502 states have (on average 1.1434262948207172) internal successors, (574), 525 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:47,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 574 transitions. [2021-11-06 21:36:47,378 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 574 transitions. Word has length 71 [2021-11-06 21:36:47,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:47,378 INFO L470 AbstractCegarLoop]: Abstraction has 526 states and 574 transitions. [2021-11-06 21:36:47,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:47,378 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 574 transitions. [2021-11-06 21:36:47,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-06 21:36:47,379 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:47,379 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:47,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-06 21:36:47,379 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:47,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:47,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1510982663, now seen corresponding path program 1 times [2021-11-06 21:36:47,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:47,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132368722] [2021-11-06 21:36:47,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:47,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:47,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:47,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:47,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132368722] [2021-11-06 21:36:47,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132368722] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:47,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:47,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:47,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797503799] [2021-11-06 21:36:47,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:47,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:47,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:47,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:47,487 INFO L87 Difference]: Start difference. First operand 526 states and 574 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:47,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:47,600 INFO L93 Difference]: Finished difference Result 526 states and 574 transitions. [2021-11-06 21:36:47,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:47,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 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) Word has length 72 [2021-11-06 21:36:47,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:47,602 INFO L225 Difference]: With dead ends: 526 [2021-11-06 21:36:47,602 INFO L226 Difference]: Without dead ends: 522 [2021-11-06 21:36:47,602 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:47,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-11-06 21:36:47,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2021-11-06 21:36:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 500 states have (on average 1.14) internal successors, (570), 521 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:47,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 570 transitions. [2021-11-06 21:36:47,702 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 570 transitions. Word has length 72 [2021-11-06 21:36:47,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:47,702 INFO L470 AbstractCegarLoop]: Abstraction has 522 states and 570 transitions. [2021-11-06 21:36:47,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:47,702 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 570 transitions. [2021-11-06 21:36:47,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-06 21:36:47,703 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:47,703 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:47,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-06 21:36:47,703 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:47,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:47,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1974419993, now seen corresponding path program 1 times [2021-11-06 21:36:47,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:47,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943614422] [2021-11-06 21:36:47,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:47,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:48,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:48,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:48,317 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943614422] [2021-11-06 21:36:48,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943614422] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:48,317 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:48,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-06 21:36:48,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903084532] [2021-11-06 21:36:48,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 21:36:48,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:48,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 21:36:48,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-11-06 21:36:48,318 INFO L87 Difference]: Start difference. First operand 522 states and 570 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:48,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:48,741 INFO L93 Difference]: Finished difference Result 728 states and 781 transitions. [2021-11-06 21:36:48,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 21:36:48,742 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 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) Word has length 72 [2021-11-06 21:36:48,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:48,743 INFO L225 Difference]: With dead ends: 728 [2021-11-06 21:36:48,743 INFO L226 Difference]: Without dead ends: 580 [2021-11-06 21:36:48,745 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2021-11-06 21:36:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-11-06 21:36:48,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 456. [2021-11-06 21:36:48,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 436 states have (on average 1.114678899082569) internal successors, (486), 455 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:48,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 486 transitions. [2021-11-06 21:36:48,835 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 486 transitions. Word has length 72 [2021-11-06 21:36:48,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:48,835 INFO L470 AbstractCegarLoop]: Abstraction has 456 states and 486 transitions. [2021-11-06 21:36:48,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:48,835 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 486 transitions. [2021-11-06 21:36:48,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-06 21:36:48,836 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:48,836 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:48,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-06 21:36:48,837 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:48,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:48,837 INFO L85 PathProgramCache]: Analyzing trace with hash -615257778, now seen corresponding path program 1 times [2021-11-06 21:36:48,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:48,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347472742] [2021-11-06 21:36:48,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:48,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:49,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:49,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:49,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347472742] [2021-11-06 21:36:49,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347472742] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:49,409 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:49,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-06 21:36:49,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999296729] [2021-11-06 21:36:49,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 21:36:49,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:49,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 21:36:49,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-11-06 21:36:49,411 INFO L87 Difference]: Start difference. First operand 456 states and 486 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:49,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:49,844 INFO L93 Difference]: Finished difference Result 519 states and 548 transitions. [2021-11-06 21:36:49,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 21:36:49,844 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 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) Word has length 73 [2021-11-06 21:36:49,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:49,845 INFO L225 Difference]: With dead ends: 519 [2021-11-06 21:36:49,845 INFO L226 Difference]: Without dead ends: 456 [2021-11-06 21:36:49,846 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2021-11-06 21:36:49,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-11-06 21:36:49,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2021-11-06 21:36:49,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 436 states have (on average 1.110091743119266) internal successors, (484), 455 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:49,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 484 transitions. [2021-11-06 21:36:49,939 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 484 transitions. Word has length 73 [2021-11-06 21:36:49,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:49,940 INFO L470 AbstractCegarLoop]: Abstraction has 456 states and 484 transitions. [2021-11-06 21:36:49,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:49,940 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 484 transitions. [2021-11-06 21:36:49,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-06 21:36:49,941 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:49,941 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:49,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-06 21:36:49,941 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:49,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:49,941 INFO L85 PathProgramCache]: Analyzing trace with hash -406915580, now seen corresponding path program 1 times [2021-11-06 21:36:49,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:49,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052403317] [2021-11-06 21:36:49,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:49,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:50,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:50,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:50,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052403317] [2021-11-06 21:36:50,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052403317] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:50,115 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:50,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 21:36:50,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353302242] [2021-11-06 21:36:50,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:36:50,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:50,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:36:50,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:50,116 INFO L87 Difference]: Start difference. First operand 456 states and 484 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:52,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:52,592 INFO L93 Difference]: Finished difference Result 803 states and 852 transitions. [2021-11-06 21:36:52,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 21:36:52,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) Word has length 73 [2021-11-06 21:36:52,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:52,595 INFO L225 Difference]: With dead ends: 803 [2021-11-06 21:36:52,595 INFO L226 Difference]: Without dead ends: 801 [2021-11-06 21:36:52,595 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 21:36:52,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2021-11-06 21:36:52,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 454. [2021-11-06 21:36:52,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 435 states have (on average 1.1057471264367815) internal successors, (481), 453 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:52,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 481 transitions. [2021-11-06 21:36:52,694 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 481 transitions. Word has length 73 [2021-11-06 21:36:52,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:52,694 INFO L470 AbstractCegarLoop]: Abstraction has 454 states and 481 transitions. [2021-11-06 21:36:52,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:52,694 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 481 transitions. [2021-11-06 21:36:52,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-06 21:36:52,695 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:52,695 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:52,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-06 21:36:52,695 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:52,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:52,696 INFO L85 PathProgramCache]: Analyzing trace with hash 355532715, now seen corresponding path program 1 times [2021-11-06 21:36:52,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:52,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012410145] [2021-11-06 21:36:52,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:52,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:52,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:52,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012410145] [2021-11-06 21:36:52,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012410145] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:52,810 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:52,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:52,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548964345] [2021-11-06 21:36:52,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:52,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:52,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:52,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:52,811 INFO L87 Difference]: Start difference. First operand 454 states and 481 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:52,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:52,933 INFO L93 Difference]: Finished difference Result 454 states and 481 transitions. [2021-11-06 21:36:52,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:52,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 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) Word has length 74 [2021-11-06 21:36:52,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:52,935 INFO L225 Difference]: With dead ends: 454 [2021-11-06 21:36:52,935 INFO L226 Difference]: Without dead ends: 450 [2021-11-06 21:36:52,935 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:52,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-11-06 21:36:53,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2021-11-06 21:36:53,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 433 states have (on average 1.1016166281755195) internal successors, (477), 449 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:53,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 477 transitions. [2021-11-06 21:36:53,031 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 477 transitions. Word has length 74 [2021-11-06 21:36:53,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:53,031 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 477 transitions. [2021-11-06 21:36:53,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:53,031 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 477 transitions. [2021-11-06 21:36:53,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-06 21:36:53,032 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:53,032 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:53,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-06 21:36:53,032 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:53,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:53,032 INFO L85 PathProgramCache]: Analyzing trace with hash 165008349, now seen corresponding path program 1 times [2021-11-06 21:36:53,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:53,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893149665] [2021-11-06 21:36:53,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:53,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:53,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:53,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:53,605 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893149665] [2021-11-06 21:36:53,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893149665] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:53,605 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:53,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 21:36:53,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016509844] [2021-11-06 21:36:53,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 21:36:53,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:53,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 21:36:53,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 21:36:53,606 INFO L87 Difference]: Start difference. First operand 450 states and 477 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:53,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:53,816 INFO L93 Difference]: Finished difference Result 630 states and 661 transitions. [2021-11-06 21:36:53,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 21:36:53,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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) Word has length 75 [2021-11-06 21:36:53,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:53,817 INFO L225 Difference]: With dead ends: 630 [2021-11-06 21:36:53,817 INFO L226 Difference]: Without dead ends: 375 [2021-11-06 21:36:53,818 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-06 21:36:53,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-11-06 21:36:53,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2021-11-06 21:36:53,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 358 states have (on average 1.1089385474860336) internal successors, (397), 374 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 397 transitions. [2021-11-06 21:36:53,901 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 397 transitions. Word has length 75 [2021-11-06 21:36:53,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:53,901 INFO L470 AbstractCegarLoop]: Abstraction has 375 states and 397 transitions. [2021-11-06 21:36:53,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:53,901 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 397 transitions. [2021-11-06 21:36:53,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-06 21:36:53,902 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:53,902 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:53,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-06 21:36:53,902 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:53,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:53,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1930304593, now seen corresponding path program 1 times [2021-11-06 21:36:53,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:53,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604249937] [2021-11-06 21:36:53,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:53,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:54,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:54,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:54,036 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604249937] [2021-11-06 21:36:54,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604249937] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:54,036 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:54,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:54,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001492976] [2021-11-06 21:36:54,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:54,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:54,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:54,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:54,038 INFO L87 Difference]: Start difference. First operand 375 states and 397 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:54,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:54,148 INFO L93 Difference]: Finished difference Result 375 states and 397 transitions. [2021-11-06 21:36:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:54,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 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) Word has length 76 [2021-11-06 21:36:54,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:54,150 INFO L225 Difference]: With dead ends: 375 [2021-11-06 21:36:54,150 INFO L226 Difference]: Without dead ends: 371 [2021-11-06 21:36:54,150 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:54,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-11-06 21:36:54,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2021-11-06 21:36:54,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 356 states have (on average 1.103932584269663) internal successors, (393), 370 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:54,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 393 transitions. [2021-11-06 21:36:54,233 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 393 transitions. Word has length 76 [2021-11-06 21:36:54,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:54,233 INFO L470 AbstractCegarLoop]: Abstraction has 371 states and 393 transitions. [2021-11-06 21:36:54,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:54,233 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 393 transitions. [2021-11-06 21:36:54,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-06 21:36:54,233 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:54,234 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:54,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-06 21:36:54,234 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:54,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:54,234 INFO L85 PathProgramCache]: Analyzing trace with hash 403298323, now seen corresponding path program 1 times [2021-11-06 21:36:54,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:54,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890296951] [2021-11-06 21:36:54,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:54,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:54,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:54,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:54,343 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890296951] [2021-11-06 21:36:54,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890296951] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:54,344 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:54,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:54,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416877546] [2021-11-06 21:36:54,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:54,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:54,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:54,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:54,345 INFO L87 Difference]: Start difference. First operand 371 states and 393 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:54,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:54,450 INFO L93 Difference]: Finished difference Result 371 states and 393 transitions. [2021-11-06 21:36:54,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:54,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 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) Word has length 78 [2021-11-06 21:36:54,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:54,452 INFO L225 Difference]: With dead ends: 371 [2021-11-06 21:36:54,452 INFO L226 Difference]: Without dead ends: 367 [2021-11-06 21:36:54,452 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:54,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-11-06 21:36:54,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2021-11-06 21:36:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 354 states have (on average 1.0988700564971752) internal successors, (389), 366 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:54,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 389 transitions. [2021-11-06 21:36:54,534 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 389 transitions. Word has length 78 [2021-11-06 21:36:54,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:54,534 INFO L470 AbstractCegarLoop]: Abstraction has 367 states and 389 transitions. [2021-11-06 21:36:54,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:54,534 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 389 transitions. [2021-11-06 21:36:54,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-06 21:36:54,535 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:54,535 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:54,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-06 21:36:54,535 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:54,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:54,535 INFO L85 PathProgramCache]: Analyzing trace with hash 2133027021, now seen corresponding path program 1 times [2021-11-06 21:36:54,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:54,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823994896] [2021-11-06 21:36:54,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:54,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:55,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:55,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823994896] [2021-11-06 21:36:55,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823994896] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:55,241 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:55,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 21:36:55,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075988490] [2021-11-06 21:36:55,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 21:36:55,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:55,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 21:36:55,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-11-06 21:36:55,243 INFO L87 Difference]: Start difference. First operand 367 states and 389 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:57,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:57,811 INFO L93 Difference]: Finished difference Result 604 states and 629 transitions. [2021-11-06 21:36:57,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 21:36:57,811 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 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) Word has length 79 [2021-11-06 21:36:57,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:57,813 INFO L225 Difference]: With dead ends: 604 [2021-11-06 21:36:57,813 INFO L226 Difference]: Without dead ends: 432 [2021-11-06 21:36:57,813 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2021-11-06 21:36:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-11-06 21:36:57,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 367. [2021-11-06 21:36:57,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 354 states have (on average 1.0903954802259888) internal successors, (386), 366 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:57,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 386 transitions. [2021-11-06 21:36:57,914 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 386 transitions. Word has length 79 [2021-11-06 21:36:57,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:57,914 INFO L470 AbstractCegarLoop]: Abstraction has 367 states and 386 transitions. [2021-11-06 21:36:57,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:57,914 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 386 transitions. [2021-11-06 21:36:57,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-06 21:36:57,915 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:57,915 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:57,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-06 21:36:57,915 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:57,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:57,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1022772439, now seen corresponding path program 1 times [2021-11-06 21:36:57,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:57,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571768730] [2021-11-06 21:36:57,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:57,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:58,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:58,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:58,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571768730] [2021-11-06 21:36:58,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571768730] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:58,043 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:58,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:58,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191880425] [2021-11-06 21:36:58,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:58,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:58,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:58,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:58,044 INFO L87 Difference]: Start difference. First operand 367 states and 386 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:58,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:58,178 INFO L93 Difference]: Finished difference Result 367 states and 386 transitions. [2021-11-06 21:36:58,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:58,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 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) Word has length 80 [2021-11-06 21:36:58,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:58,179 INFO L225 Difference]: With dead ends: 367 [2021-11-06 21:36:58,179 INFO L226 Difference]: Without dead ends: 363 [2021-11-06 21:36:58,180 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:58,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-11-06 21:36:58,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2021-11-06 21:36:58,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 352 states have (on average 1.0852272727272727) internal successors, (382), 362 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:58,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 382 transitions. [2021-11-06 21:36:58,280 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 382 transitions. Word has length 80 [2021-11-06 21:36:58,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:58,280 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 382 transitions. [2021-11-06 21:36:58,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:58,280 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 382 transitions. [2021-11-06 21:36:58,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-06 21:36:58,281 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:58,281 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:58,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-06 21:36:58,281 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:58,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:58,282 INFO L85 PathProgramCache]: Analyzing trace with hash 653198120, now seen corresponding path program 1 times [2021-11-06 21:36:58,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:58,282 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582299220] [2021-11-06 21:36:58,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:58,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:58,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:58,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:58,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582299220] [2021-11-06 21:36:58,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582299220] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:58,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:58,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 21:36:58,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793471559] [2021-11-06 21:36:58,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 21:36:58,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:58,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 21:36:58,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-06 21:36:58,620 INFO L87 Difference]: Start difference. First operand 363 states and 382 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:59,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:59,012 INFO L93 Difference]: Finished difference Result 659 states and 673 transitions. [2021-11-06 21:36:59,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 21:36:59,013 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 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) Word has length 81 [2021-11-06 21:36:59,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:59,014 INFO L225 Difference]: With dead ends: 659 [2021-11-06 21:36:59,014 INFO L226 Difference]: Without dead ends: 491 [2021-11-06 21:36:59,014 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2021-11-06 21:36:59,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2021-11-06 21:36:59,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 279. [2021-11-06 21:36:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 270 states have (on average 1.0703703703703704) internal successors, (289), 278 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:59,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 289 transitions. [2021-11-06 21:36:59,089 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 289 transitions. Word has length 81 [2021-11-06 21:36:59,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:59,089 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 289 transitions. [2021-11-06 21:36:59,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:59,089 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 289 transitions. [2021-11-06 21:36:59,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-06 21:36:59,090 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:59,090 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:59,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-06 21:36:59,090 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:59,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:59,090 INFO L85 PathProgramCache]: Analyzing trace with hash -663055877, now seen corresponding path program 1 times [2021-11-06 21:36:59,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:59,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494247240] [2021-11-06 21:36:59,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:59,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:59,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:59,200 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494247240] [2021-11-06 21:36:59,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494247240] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:59,200 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:59,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:59,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805854043] [2021-11-06 21:36:59,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:59,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:59,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:59,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:59,201 INFO L87 Difference]: Start difference. First operand 279 states and 289 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:59,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:59,289 INFO L93 Difference]: Finished difference Result 279 states and 289 transitions. [2021-11-06 21:36:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:59,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 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) Word has length 82 [2021-11-06 21:36:59,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:59,290 INFO L225 Difference]: With dead ends: 279 [2021-11-06 21:36:59,290 INFO L226 Difference]: Without dead ends: 275 [2021-11-06 21:36:59,290 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:59,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-11-06 21:36:59,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2021-11-06 21:36:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 268 states have (on average 1.0634328358208955) internal successors, (285), 274 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 285 transitions. [2021-11-06 21:36:59,365 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 285 transitions. Word has length 82 [2021-11-06 21:36:59,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:59,365 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 285 transitions. [2021-11-06 21:36:59,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:59,365 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 285 transitions. [2021-11-06 21:36:59,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-06 21:36:59,366 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:59,366 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:59,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-06 21:36:59,366 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:59,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:59,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1541396609, now seen corresponding path program 1 times [2021-11-06 21:36:59,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:59,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943999239] [2021-11-06 21:36:59,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:59,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:59,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:59,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:59,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943999239] [2021-11-06 21:36:59,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943999239] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:59,473 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:59,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:59,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712293947] [2021-11-06 21:36:59,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:59,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:59,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:59,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:59,474 INFO L87 Difference]: Start difference. First operand 275 states and 285 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:59,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:59,567 INFO L93 Difference]: Finished difference Result 275 states and 285 transitions. [2021-11-06 21:36:59,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:59,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 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) Word has length 84 [2021-11-06 21:36:59,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:59,568 INFO L225 Difference]: With dead ends: 275 [2021-11-06 21:36:59,568 INFO L226 Difference]: Without dead ends: 271 [2021-11-06 21:36:59,568 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-11-06 21:36:59,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2021-11-06 21:36:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 266 states have (on average 1.056390977443609) internal successors, (281), 270 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 281 transitions. [2021-11-06 21:36:59,682 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 281 transitions. Word has length 84 [2021-11-06 21:36:59,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:59,682 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 281 transitions. [2021-11-06 21:36:59,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 281 transitions. [2021-11-06 21:36:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-06 21:36:59,683 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:59,683 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:59,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-06 21:36:59,683 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:59,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:36:59,684 INFO L85 PathProgramCache]: Analyzing trace with hash 481717603, now seen corresponding path program 1 times [2021-11-06 21:36:59,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:36:59,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454966713] [2021-11-06 21:36:59,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:36:59,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:36:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:36:59,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:36:59,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:36:59,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454966713] [2021-11-06 21:36:59,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454966713] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:36:59,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:36:59,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:36:59,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145000100] [2021-11-06 21:36:59,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:36:59,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:36:59,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:36:59,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:36:59,799 INFO L87 Difference]: Start difference. First operand 271 states and 281 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:59,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:36:59,920 INFO L93 Difference]: Finished difference Result 271 states and 281 transitions. [2021-11-06 21:36:59,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:36:59,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 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) Word has length 86 [2021-11-06 21:36:59,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:36:59,921 INFO L225 Difference]: With dead ends: 271 [2021-11-06 21:36:59,921 INFO L226 Difference]: Without dead ends: 267 [2021-11-06 21:36:59,921 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:36:59,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2021-11-06 21:36:59,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2021-11-06 21:36:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 264 states have (on average 1.0492424242424243) internal successors, (277), 266 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 277 transitions. [2021-11-06 21:36:59,998 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 277 transitions. Word has length 86 [2021-11-06 21:36:59,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:36:59,998 INFO L470 AbstractCegarLoop]: Abstraction has 267 states and 277 transitions. [2021-11-06 21:36:59,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:36:59,998 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 277 transitions. [2021-11-06 21:36:59,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-06 21:36:59,999 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:36:59,999 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:36:59,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-06 21:36:59,999 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:36:59,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:37:00,000 INFO L85 PathProgramCache]: Analyzing trace with hash -206973488, now seen corresponding path program 1 times [2021-11-06 21:37:00,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:37:00,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606601431] [2021-11-06 21:37:00,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:37:00,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:37:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:37:00,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:37:00,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:37:00,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606601431] [2021-11-06 21:37:00,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606601431] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:37:00,223 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:37:00,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 21:37:00,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475333181] [2021-11-06 21:37:00,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:37:00,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:37:00,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:37:00,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:37:00,224 INFO L87 Difference]: Start difference. First operand 267 states and 277 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:37:00,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:37:00,450 INFO L93 Difference]: Finished difference Result 461 states and 468 transitions. [2021-11-06 21:37:00,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 21:37:00,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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) Word has length 87 [2021-11-06 21:37:00,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:37:00,452 INFO L225 Difference]: With dead ends: 461 [2021-11-06 21:37:00,452 INFO L226 Difference]: Without dead ends: 375 [2021-11-06 21:37:00,452 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 21:37:00,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-11-06 21:37:00,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 267. [2021-11-06 21:37:00,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 264 states have (on average 1.0416666666666667) internal successors, (275), 266 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:37:00,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 275 transitions. [2021-11-06 21:37:00,531 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 275 transitions. Word has length 87 [2021-11-06 21:37:00,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:37:00,531 INFO L470 AbstractCegarLoop]: Abstraction has 267 states and 275 transitions. [2021-11-06 21:37:00,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:37:00,532 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 275 transitions. [2021-11-06 21:37:00,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-06 21:37:00,532 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:37:00,532 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:37:00,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-06 21:37:00,533 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:37:00,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:37:00,533 INFO L85 PathProgramCache]: Analyzing trace with hash -925709401, now seen corresponding path program 1 times [2021-11-06 21:37:00,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:37:00,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941898594] [2021-11-06 21:37:00,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:37:00,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:37:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:37:00,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:37:00,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:37:00,639 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941898594] [2021-11-06 21:37:00,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941898594] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:37:00,640 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:37:00,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:37:00,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285345861] [2021-11-06 21:37:00,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:37:00,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:37:00,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:37:00,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:37:00,641 INFO L87 Difference]: Start difference. First operand 267 states and 275 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:37:00,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:37:00,735 INFO L93 Difference]: Finished difference Result 267 states and 275 transitions. [2021-11-06 21:37:00,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:37:00,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 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) Word has length 88 [2021-11-06 21:37:00,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:37:00,736 INFO L225 Difference]: With dead ends: 267 [2021-11-06 21:37:00,736 INFO L226 Difference]: Without dead ends: 93 [2021-11-06 21:37:00,736 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:37:00,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-06 21:37:00,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-11-06 21:37:00,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.0326086956521738) internal successors, (95), 92 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:37:00,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2021-11-06 21:37:00,757 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 88 [2021-11-06 21:37:00,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:37:00,757 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2021-11-06 21:37:00,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:37:00,757 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2021-11-06 21:37:00,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-06 21:37:00,757 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:37:00,758 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:37:00,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-06 21:37:00,758 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 49 more)] === [2021-11-06 21:37:00,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:37:00,758 INFO L85 PathProgramCache]: Analyzing trace with hash 31146507, now seen corresponding path program 1 times [2021-11-06 21:37:00,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:37:00,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306010543] [2021-11-06 21:37:00,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:37:00,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:37:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:37:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:37:01,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:37:01,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306010543] [2021-11-06 21:37:01,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306010543] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:37:01,750 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:37:01,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 21:37:01,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428215310] [2021-11-06 21:37:01,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 21:37:01,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:37:01,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 21:37:01,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 21:37:01,751 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:37:01,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:37:01,922 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2021-11-06 21:37:01,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 21:37:01,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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) Word has length 89 [2021-11-06 21:37:01,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:37:01,923 INFO L225 Difference]: With dead ends: 93 [2021-11-06 21:37:01,923 INFO L226 Difference]: Without dead ends: 0 [2021-11-06 21:37:01,923 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-06 21:37:01,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-06 21:37:01,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-06 21:37:01,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:37:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-06 21:37:01,923 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2021-11-06 21:37:01,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:37:01,923 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-06 21:37:01,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:37:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-06 21:37:01,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-06 21:37:01,926 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,926 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,927 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,927 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,927 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,927 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,927 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,927 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,928 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,928 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,928 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,928 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,928 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,928 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,929 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,929 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,929 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,929 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,929 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,929 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,929 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,929 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,930 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,930 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,930 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,930 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,930 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,930 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,930 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,930 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,931 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,931 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,931 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,931 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,931 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,931 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,931 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,932 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,932 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,932 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,932 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,932 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,932 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,932 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,932 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,933 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,933 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,933 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,933 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,933 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,933 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,933 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 21:37:01,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-06 21:37:01,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-06 21:37:01,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:01,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:01,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:02,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:02,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:02,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:02,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:02,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:02,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:02,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:02,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:02,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:02,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:02,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:02,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:02,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:02,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:02,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:02,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:03,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:03,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:03,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:03,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:03,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:03,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:03,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:03,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:03,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:03,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:03,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:03,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:03,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:03,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:03,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:03,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:03,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:03,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:03,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:03,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:04,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:04,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:04,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:04,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:04,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:04,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:04,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:04,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:04,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:04,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:04,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:04,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:04,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:04,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:04,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:04,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:05,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:05,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:05,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:05,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:05,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:05,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:05,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:05,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:05,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:05,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:05,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:05,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:05,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:05,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:05,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:05,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:06,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:06,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:06,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:06,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:06,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:06,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:06,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:06,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:06,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:06,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:06,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:06,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:06,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:06,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:06,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:06,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:07,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:07,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:07,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:07,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:07,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:07,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:07,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:07,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:07,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:07,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:07,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:07,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:07,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:07,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:07,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:07,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:08,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:08,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:08,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:08,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:08,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:08,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:08,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:08,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:08,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:08,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:08,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 21:37:25,017 WARN L207 SmtUtils]: Spent 16.31 s on a formula simplification. DAG size of input: 454 DAG size of output: 208 [2021-11-06 21:37:41,593 WARN L207 SmtUtils]: Spent 7.98 s on a formula simplification. DAG size of input: 348 DAG size of output: 242 [2021-11-06 21:37:49,768 WARN L207 SmtUtils]: Spent 7.04 s on a formula simplification. DAG size of input: 225 DAG size of output: 184 [2021-11-06 21:38:08,453 WARN L207 SmtUtils]: Spent 14.58 s on a formula simplification. DAG size of input: 339 DAG size of output: 233 [2021-11-06 21:38:16,383 WARN L207 SmtUtils]: Spent 7.93 s on a formula simplification. DAG size of input: 342 DAG size of output: 231 [2021-11-06 21:38:28,486 WARN L207 SmtUtils]: Spent 12.09 s on a formula simplification. DAG size of input: 398 DAG size of output: 174 [2021-11-06 21:38:41,269 WARN L207 SmtUtils]: Spent 9.46 s on a formula simplification. DAG size of input: 365 DAG size of output: 253 [2021-11-06 21:39:06,213 WARN L207 SmtUtils]: Spent 21.00 s on a formula simplification. DAG size of input: 460 DAG size of output: 214 [2021-11-06 21:39:23,904 WARN L207 SmtUtils]: Spent 17.69 s on a formula simplification. DAG size of input: 271 DAG size of output: 205 [2021-11-06 21:39:39,406 WARN L207 SmtUtils]: Spent 15.49 s on a formula simplification. DAG size of input: 287 DAG size of output: 202 [2021-11-06 21:39:53,297 WARN L207 SmtUtils]: Spent 13.88 s on a formula simplification. DAG size of input: 336 DAG size of output: 230 [2021-11-06 21:40:00,016 WARN L207 SmtUtils]: Spent 6.72 s on a formula simplification. DAG size of input: 318 DAG size of output: 224 [2021-11-06 21:40:10,619 WARN L207 SmtUtils]: Spent 5.63 s on a formula simplification. DAG size of input: 220 DAG size of output: 186 [2021-11-06 21:40:18,005 WARN L207 SmtUtils]: Spent 5.30 s on a formula simplification. DAG size of input: 377 DAG size of output: 265 [2021-11-06 21:40:46,830 WARN L207 SmtUtils]: Spent 28.82 s on a formula simplification. DAG size of input: 442 DAG size of output: 196 [2021-11-06 21:41:15,093 WARN L207 SmtUtils]: Spent 25.20 s on a formula simplification. DAG size of input: 398 DAG size of output: 168 [2021-11-06 21:41:27,723 WARN L207 SmtUtils]: Spent 12.63 s on a formula simplification. DAG size of input: 324 DAG size of output: 218 [2021-11-06 21:41:58,360 WARN L207 SmtUtils]: Spent 30.63 s on a formula simplification. DAG size of input: 469 DAG size of output: 223 [2021-11-06 21:42:08,921 WARN L207 SmtUtils]: Spent 10.56 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-11-06 21:42:16,352 WARN L207 SmtUtils]: Spent 6.26 s on a formula simplification. DAG size of input: 359 DAG size of output: 247 [2021-11-06 21:42:21,680 WARN L207 SmtUtils]: Spent 5.33 s on a formula simplification. DAG size of input: 371 DAG size of output: 239 [2021-11-06 21:42:57,476 WARN L207 SmtUtils]: Spent 35.79 s on a formula simplification. DAG size of input: 445 DAG size of output: 199 [2021-11-06 21:43:06,365 WARN L207 SmtUtils]: Spent 5.97 s on a formula simplification. DAG size of input: 383 DAG size of output: 271 [2021-11-06 21:43:20,600 WARN L207 SmtUtils]: Spent 14.22 s on a formula simplification. DAG size of input: 466 DAG size of output: 220 [2021-11-06 21:43:27,197 WARN L207 SmtUtils]: Spent 6.59 s on a formula simplification. DAG size of input: 332 DAG size of output: 223 [2021-11-06 21:43:37,432 WARN L207 SmtUtils]: Spent 5.80 s on a formula simplification. DAG size of input: 256 DAG size of output: 204 [2021-11-06 21:43:47,986 WARN L207 SmtUtils]: Spent 10.36 s on a formula simplification. DAG size of input: 356 DAG size of output: 244 [2021-11-06 21:44:01,207 WARN L207 SmtUtils]: Spent 9.56 s on a formula simplification. DAG size of input: 380 DAG size of output: 268 [2021-11-06 21:44:18,171 WARN L207 SmtUtils]: Spent 16.96 s on a formula simplification. DAG size of input: 463 DAG size of output: 217 [2021-11-06 21:44:45,144 WARN L207 SmtUtils]: Spent 26.97 s on a formula simplification. DAG size of input: 457 DAG size of output: 211 [2021-11-06 21:45:00,441 WARN L207 SmtUtils]: Spent 15.29 s on a formula simplification. DAG size of input: 472 DAG size of output: 226 [2021-11-06 21:45:17,206 WARN L207 SmtUtils]: Spent 16.76 s on a formula simplification. DAG size of input: 372 DAG size of output: 164 [2021-11-06 21:45:38,552 WARN L207 SmtUtils]: Spent 21.34 s on a formula simplification. DAG size of input: 401 DAG size of output: 171 [2021-11-06 21:45:43,663 WARN L207 SmtUtils]: Spent 5.11 s on a formula simplification. DAG size of input: 344 DAG size of output: 212 [2021-11-06 21:46:07,451 WARN L207 SmtUtils]: Spent 20.32 s on a formula simplification. DAG size of input: 475 DAG size of output: 229 [2021-11-06 21:46:20,323 WARN L207 SmtUtils]: Spent 9.85 s on a formula simplification. DAG size of input: 368 DAG size of output: 236 [2021-11-06 21:46:30,166 WARN L207 SmtUtils]: Spent 5.72 s on a formula simplification. DAG size of input: 225 DAG size of output: 184 [2021-11-06 21:46:41,185 WARN L207 SmtUtils]: Spent 11.01 s on a formula simplification. DAG size of input: 362 DAG size of output: 230 [2021-11-06 21:46:51,882 WARN L207 SmtUtils]: Spent 10.70 s on a formula simplification. DAG size of input: 307 DAG size of output: 212 [2021-11-06 21:46:57,317 WARN L207 SmtUtils]: Spent 5.43 s on a formula simplification. DAG size of input: 350 DAG size of output: 218 [2021-11-06 21:47:02,717 WARN L207 SmtUtils]: Spent 5.40 s on a formula simplification. DAG size of input: 197 DAG size of output: 163 [2021-11-06 21:47:07,933 WARN L207 SmtUtils]: Spent 5.21 s on a formula simplification. DAG size of input: 307 DAG size of output: 212 [2021-11-06 21:47:21,385 WARN L207 SmtUtils]: Spent 10.25 s on a formula simplification. DAG size of input: 353 DAG size of output: 241 [2021-11-06 21:47:37,674 WARN L207 SmtUtils]: Spent 16.29 s on a formula simplification. DAG size of input: 436 DAG size of output: 190 [2021-11-06 21:47:59,596 WARN L207 SmtUtils]: Spent 13.52 s on a formula simplification. DAG size of input: 327 DAG size of output: 221 [2021-11-06 21:48:18,853 WARN L207 SmtUtils]: Spent 19.25 s on a formula simplification. DAG size of input: 439 DAG size of output: 193 [2021-11-06 21:48:25,892 WARN L207 SmtUtils]: Spent 7.04 s on a formula simplification. DAG size of input: 374 DAG size of output: 262 [2021-11-06 21:48:39,624 WARN L207 SmtUtils]: Spent 13.09 s on a formula simplification. DAG size of input: 336 DAG size of output: 234 [2021-11-06 21:48:45,656 WARN L207 SmtUtils]: Spent 5.91 s on a formula simplification. DAG size of input: 344 DAG size of output: 213 [2021-11-06 21:48:51,257 WARN L207 SmtUtils]: Spent 5.12 s on a formula simplification. DAG size of input: 249 DAG size of output: 197 [2021-11-06 21:48:56,405 WARN L207 SmtUtils]: Spent 5.15 s on a formula simplification. DAG size of input: 344 DAG size of output: 232 [2021-11-06 21:49:22,571 WARN L207 SmtUtils]: Spent 22.05 s on a formula simplification. DAG size of input: 448 DAG size of output: 202 [2021-11-06 21:49:43,519 WARN L207 SmtUtils]: Spent 20.31 s on a formula simplification. DAG size of input: 451 DAG size of output: 205 [2021-11-06 21:50:01,386 WARN L207 SmtUtils]: Spent 15.25 s on a formula simplification. DAG size of input: 345 DAG size of output: 239 Killed by 15