./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--net--team--team.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--net--team--team.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 c2e40c074e34eae853879e913dea35acffb5001042b37759d8583ab68da2fb52 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 21:51:04,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 21:51:04,605 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 21:51:04,654 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 21:51:04,654 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 21:51:04,655 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 21:51:04,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 21:51:04,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 21:51:04,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 21:51:04,658 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 21:51:04,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 21:51:04,660 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 21:51:04,660 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 21:51:04,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 21:51:04,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 21:51:04,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 21:51:04,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 21:51:04,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 21:51:04,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 21:51:04,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 21:51:04,680 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 21:51:04,681 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 21:51:04,683 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 21:51:04,684 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 21:51:04,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 21:51:04,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 21:51:04,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 21:51:04,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 21:51:04,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 21:51:04,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 21:51:04,688 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 21:51:04,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 21:51:04,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 21:51:04,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 21:51:04,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 21:51:04,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 21:51:04,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 21:51:04,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 21:51:04,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 21:51:04,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 21:51:04,692 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 21:51:04,707 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:51:04,723 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 21:51:04,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 21:51:04,727 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 21:51:04,727 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 21:51:04,728 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 21:51:04,728 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 21:51:04,728 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 21:51:04,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 21:51:04,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 21:51:04,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 21:51:04,729 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 21:51:04,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 21:51:04,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 21:51:04,730 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 21:51:04,730 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 21:51:04,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 21:51:04,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 21:51:04,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 21:51:04,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 21:51:04,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 21:51:04,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 21:51:04,731 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 21:51:04,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 21:51:04,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 21:51:04,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 21:51:04,731 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 21:51:04,731 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 21:51:04,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 21:51:04,732 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 21:51:04,732 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 -> c2e40c074e34eae853879e913dea35acffb5001042b37759d8583ab68da2fb52 [2021-11-06 21:51:04,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 21:51:04,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 21:51:04,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 21:51:04,962 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 21:51:04,962 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 21:51:04,963 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--net--team--team.ko.cil.i [2021-11-06 21:51:05,010 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df1698bf/14d68bdb4e664710b8402f7428db563d/FLAGc555d2df1 [2021-11-06 21:51:05,717 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 21:51:05,718 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--team--team.ko.cil.i [2021-11-06 21:51:05,769 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df1698bf/14d68bdb4e664710b8402f7428db563d/FLAGc555d2df1 [2021-11-06 21:51:06,262 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df1698bf/14d68bdb4e664710b8402f7428db563d [2021-11-06 21:51:06,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 21:51:06,265 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 21:51:06,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 21:51:06,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 21:51:06,270 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 21:51:06,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:51:06" (1/1) ... [2021-11-06 21:51:06,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@549fa2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:06, skipping insertion in model container [2021-11-06 21:51:06,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:51:06" (1/1) ... [2021-11-06 21:51:06,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 21:51:06,389 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 21:51:10,548 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--net--team--team.ko.cil.i[552584,552597] [2021-11-06 21:51:10,551 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--net--team--team.ko.cil.i[552729,552742] [2021-11-06 21:51:10,551 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--net--team--team.ko.cil.i[552875,552888] [2021-11-06 21:51:10,551 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--net--team--team.ko.cil.i[553040,553053] [2021-11-06 21:51:10,552 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--net--team--team.ko.cil.i[553198,553211] [2021-11-06 21:51:10,552 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--net--team--team.ko.cil.i[553356,553369] [2021-11-06 21:51:10,553 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--net--team--team.ko.cil.i[553514,553527] [2021-11-06 21:51:10,553 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--net--team--team.ko.cil.i[553674,553687] [2021-11-06 21:51:10,553 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--net--team--team.ko.cil.i[553833,553846] [2021-11-06 21:51:10,553 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--net--team--team.ko.cil.i[553972,553985] [2021-11-06 21:51:10,554 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--net--team--team.ko.cil.i[554114,554127] [2021-11-06 21:51:10,554 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--net--team--team.ko.cil.i[554263,554276] [2021-11-06 21:51:10,554 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--net--team--team.ko.cil.i[554402,554415] [2021-11-06 21:51:10,555 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--net--team--team.ko.cil.i[554557,554570] [2021-11-06 21:51:10,555 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--net--team--team.ko.cil.i[554717,554730] [2021-11-06 21:51:10,555 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--net--team--team.ko.cil.i[554868,554881] [2021-11-06 21:51:10,556 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--net--team--team.ko.cil.i[555019,555032] [2021-11-06 21:51:10,556 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--net--team--team.ko.cil.i[555171,555184] [2021-11-06 21:51:10,556 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--net--team--team.ko.cil.i[555320,555333] [2021-11-06 21:51:10,556 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--net--team--team.ko.cil.i[555468,555481] [2021-11-06 21:51:10,557 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--net--team--team.ko.cil.i[555625,555638] [2021-11-06 21:51:10,557 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--net--team--team.ko.cil.i[555774,555787] [2021-11-06 21:51:10,557 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--net--team--team.ko.cil.i[555930,555943] [2021-11-06 21:51:10,558 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--net--team--team.ko.cil.i[556083,556096] [2021-11-06 21:51:10,558 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--net--team--team.ko.cil.i[556229,556242] [2021-11-06 21:51:10,559 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--net--team--team.ko.cil.i[556372,556385] [2021-11-06 21:51:10,559 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--net--team--team.ko.cil.i[556524,556537] [2021-11-06 21:51:10,559 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--net--team--team.ko.cil.i[556670,556683] [2021-11-06 21:51:10,560 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--net--team--team.ko.cil.i[556815,556828] [2021-11-06 21:51:10,560 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--net--team--team.ko.cil.i[556969,556982] [2021-11-06 21:51:10,560 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--net--team--team.ko.cil.i[557120,557133] [2021-11-06 21:51:10,561 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--net--team--team.ko.cil.i[557275,557288] [2021-11-06 21:51:10,561 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--net--team--team.ko.cil.i[557427,557440] [2021-11-06 21:51:10,561 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--net--team--team.ko.cil.i[557582,557595] [2021-11-06 21:51:10,562 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--net--team--team.ko.cil.i[557746,557759] [2021-11-06 21:51:10,562 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--net--team--team.ko.cil.i[557902,557915] [2021-11-06 21:51:10,562 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--net--team--team.ko.cil.i[558066,558079] [2021-11-06 21:51:10,562 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--net--team--team.ko.cil.i[558208,558221] [2021-11-06 21:51:10,563 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--net--team--team.ko.cil.i[558366,558379] [2021-11-06 21:51:10,563 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--net--team--team.ko.cil.i[558533,558546] [2021-11-06 21:51:10,563 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--net--team--team.ko.cil.i[558692,558705] [2021-11-06 21:51:10,564 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--net--team--team.ko.cil.i[558851,558864] [2021-11-06 21:51:10,564 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--net--team--team.ko.cil.i[559000,559013] [2021-11-06 21:51:10,564 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--net--team--team.ko.cil.i[559147,559160] [2021-11-06 21:51:10,565 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--net--team--team.ko.cil.i[559286,559299] [2021-11-06 21:51:10,565 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--net--team--team.ko.cil.i[559449,559462] [2021-11-06 21:51:10,565 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--net--team--team.ko.cil.i[559615,559628] [2021-11-06 21:51:10,565 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--net--team--team.ko.cil.i[559779,559792] [2021-11-06 21:51:10,566 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--net--team--team.ko.cil.i[559944,559957] [2021-11-06 21:51:10,566 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--net--team--team.ko.cil.i[560109,560122] [2021-11-06 21:51:10,566 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--net--team--team.ko.cil.i[560275,560288] [2021-11-06 21:51:10,567 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--net--team--team.ko.cil.i[560440,560453] [2021-11-06 21:51:10,567 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--net--team--team.ko.cil.i[560607,560620] [2021-11-06 21:51:10,567 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--net--team--team.ko.cil.i[560767,560780] [2021-11-06 21:51:10,568 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--net--team--team.ko.cil.i[560929,560942] [2021-11-06 21:51:10,568 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--net--team--team.ko.cil.i[561088,561101] [2021-11-06 21:51:10,568 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--net--team--team.ko.cil.i[561234,561247] [2021-11-06 21:51:10,568 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--net--team--team.ko.cil.i[561377,561390] [2021-11-06 21:51:10,569 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--net--team--team.ko.cil.i[561521,561534] [2021-11-06 21:51:10,569 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--net--team--team.ko.cil.i[561664,561677] [2021-11-06 21:51:10,569 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--net--team--team.ko.cil.i[561808,561821] [2021-11-06 21:51:10,570 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--net--team--team.ko.cil.i[561949,561962] [2021-11-06 21:51:10,570 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--net--team--team.ko.cil.i[562087,562100] [2021-11-06 21:51:10,570 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--net--team--team.ko.cil.i[562245,562258] [2021-11-06 21:51:10,571 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--net--team--team.ko.cil.i[562404,562417] [2021-11-06 21:51:10,571 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--net--team--team.ko.cil.i[562560,562573] [2021-11-06 21:51:10,571 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--net--team--team.ko.cil.i[562709,562722] [2021-11-06 21:51:10,571 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--net--team--team.ko.cil.i[562861,562874] [2021-11-06 21:51:10,572 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--net--team--team.ko.cil.i[563012,563025] [2021-11-06 21:51:10,572 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--net--team--team.ko.cil.i[563161,563174] [2021-11-06 21:51:10,572 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--net--team--team.ko.cil.i[563313,563326] [2021-11-06 21:51:10,573 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--net--team--team.ko.cil.i[563461,563474] [2021-11-06 21:51:10,573 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--net--team--team.ko.cil.i[563614,563627] [2021-11-06 21:51:10,573 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--net--team--team.ko.cil.i[563765,563778] [2021-11-06 21:51:10,573 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--net--team--team.ko.cil.i[563915,563928] [2021-11-06 21:51:10,574 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--net--team--team.ko.cil.i[564062,564075] [2021-11-06 21:51:10,574 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--net--team--team.ko.cil.i[564213,564226] [2021-11-06 21:51:10,574 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--net--team--team.ko.cil.i[564364,564377] [2021-11-06 21:51:10,575 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--net--team--team.ko.cil.i[564512,564525] [2021-11-06 21:51:10,575 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--net--team--team.ko.cil.i[564678,564691] [2021-11-06 21:51:10,575 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--net--team--team.ko.cil.i[564847,564860] [2021-11-06 21:51:10,576 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--net--team--team.ko.cil.i[565014,565027] [2021-11-06 21:51:10,576 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--net--team--team.ko.cil.i[565182,565195] [2021-11-06 21:51:10,576 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--net--team--team.ko.cil.i[565332,565345] [2021-11-06 21:51:10,577 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--net--team--team.ko.cil.i[565479,565492] [2021-11-06 21:51:10,577 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--net--team--team.ko.cil.i[565640,565653] [2021-11-06 21:51:10,577 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--net--team--team.ko.cil.i[565810,565823] [2021-11-06 21:51:10,577 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--net--team--team.ko.cil.i[565972,565985] [2021-11-06 21:51:10,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 21:51:10,635 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 21:51:10,961 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--net--team--team.ko.cil.i[552584,552597] [2021-11-06 21:51:10,961 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--net--team--team.ko.cil.i[552729,552742] [2021-11-06 21:51:10,962 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--net--team--team.ko.cil.i[552875,552888] [2021-11-06 21:51:10,963 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--net--team--team.ko.cil.i[553040,553053] [2021-11-06 21:51:10,963 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--net--team--team.ko.cil.i[553198,553211] [2021-11-06 21:51:10,963 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--net--team--team.ko.cil.i[553356,553369] [2021-11-06 21:51:10,964 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--net--team--team.ko.cil.i[553514,553527] [2021-11-06 21:51:10,965 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--net--team--team.ko.cil.i[553674,553687] [2021-11-06 21:51:10,965 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--net--team--team.ko.cil.i[553833,553846] [2021-11-06 21:51:10,966 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--net--team--team.ko.cil.i[553972,553985] [2021-11-06 21:51:10,966 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--net--team--team.ko.cil.i[554114,554127] [2021-11-06 21:51:10,967 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--net--team--team.ko.cil.i[554263,554276] [2021-11-06 21:51:10,967 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--net--team--team.ko.cil.i[554402,554415] [2021-11-06 21:51:10,967 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--net--team--team.ko.cil.i[554557,554570] [2021-11-06 21:51:10,968 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--net--team--team.ko.cil.i[554717,554730] [2021-11-06 21:51:10,969 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--net--team--team.ko.cil.i[554868,554881] [2021-11-06 21:51:10,969 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--net--team--team.ko.cil.i[555019,555032] [2021-11-06 21:51:10,969 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--net--team--team.ko.cil.i[555171,555184] [2021-11-06 21:51:10,970 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--net--team--team.ko.cil.i[555320,555333] [2021-11-06 21:51:10,970 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--net--team--team.ko.cil.i[555468,555481] [2021-11-06 21:51:10,970 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--net--team--team.ko.cil.i[555625,555638] [2021-11-06 21:51:10,971 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--net--team--team.ko.cil.i[555774,555787] [2021-11-06 21:51:10,971 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--net--team--team.ko.cil.i[555930,555943] [2021-11-06 21:51:10,972 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--net--team--team.ko.cil.i[556083,556096] [2021-11-06 21:51:10,972 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--net--team--team.ko.cil.i[556229,556242] [2021-11-06 21:51:10,972 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--net--team--team.ko.cil.i[556372,556385] [2021-11-06 21:51:10,972 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--net--team--team.ko.cil.i[556524,556537] [2021-11-06 21:51:10,973 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--net--team--team.ko.cil.i[556670,556683] [2021-11-06 21:51:10,973 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--net--team--team.ko.cil.i[556815,556828] [2021-11-06 21:51:10,973 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--net--team--team.ko.cil.i[556969,556982] [2021-11-06 21:51:10,973 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--net--team--team.ko.cil.i[557120,557133] [2021-11-06 21:51:10,974 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--net--team--team.ko.cil.i[557275,557288] [2021-11-06 21:51:10,974 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--net--team--team.ko.cil.i[557427,557440] [2021-11-06 21:51:10,974 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--net--team--team.ko.cil.i[557582,557595] [2021-11-06 21:51:10,975 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--net--team--team.ko.cil.i[557746,557759] [2021-11-06 21:51:10,975 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--net--team--team.ko.cil.i[557902,557915] [2021-11-06 21:51:10,975 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--net--team--team.ko.cil.i[558066,558079] [2021-11-06 21:51:10,976 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--net--team--team.ko.cil.i[558208,558221] [2021-11-06 21:51:10,976 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--net--team--team.ko.cil.i[558366,558379] [2021-11-06 21:51:10,976 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--net--team--team.ko.cil.i[558533,558546] [2021-11-06 21:51:10,977 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--net--team--team.ko.cil.i[558692,558705] [2021-11-06 21:51:10,977 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--net--team--team.ko.cil.i[558851,558864] [2021-11-06 21:51:10,978 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--net--team--team.ko.cil.i[559000,559013] [2021-11-06 21:51:10,978 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--net--team--team.ko.cil.i[559147,559160] [2021-11-06 21:51:10,978 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--net--team--team.ko.cil.i[559286,559299] [2021-11-06 21:51:10,979 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--net--team--team.ko.cil.i[559449,559462] [2021-11-06 21:51:10,979 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--net--team--team.ko.cil.i[559615,559628] [2021-11-06 21:51:10,979 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--net--team--team.ko.cil.i[559779,559792] [2021-11-06 21:51:10,980 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--net--team--team.ko.cil.i[559944,559957] [2021-11-06 21:51:10,980 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--net--team--team.ko.cil.i[560109,560122] [2021-11-06 21:51:10,981 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--net--team--team.ko.cil.i[560275,560288] [2021-11-06 21:51:10,981 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--net--team--team.ko.cil.i[560440,560453] [2021-11-06 21:51:10,981 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--net--team--team.ko.cil.i[560607,560620] [2021-11-06 21:51:10,982 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--net--team--team.ko.cil.i[560767,560780] [2021-11-06 21:51:10,982 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--net--team--team.ko.cil.i[560929,560942] [2021-11-06 21:51:10,982 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--net--team--team.ko.cil.i[561088,561101] [2021-11-06 21:51:10,982 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--net--team--team.ko.cil.i[561234,561247] [2021-11-06 21:51:10,983 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--net--team--team.ko.cil.i[561377,561390] [2021-11-06 21:51:10,983 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--net--team--team.ko.cil.i[561521,561534] [2021-11-06 21:51:10,983 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--net--team--team.ko.cil.i[561664,561677] [2021-11-06 21:51:10,984 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--net--team--team.ko.cil.i[561808,561821] [2021-11-06 21:51:10,984 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--net--team--team.ko.cil.i[561949,561962] [2021-11-06 21:51:10,984 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--net--team--team.ko.cil.i[562087,562100] [2021-11-06 21:51:10,988 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--net--team--team.ko.cil.i[562245,562258] [2021-11-06 21:51:10,988 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--net--team--team.ko.cil.i[562404,562417] [2021-11-06 21:51:10,990 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--net--team--team.ko.cil.i[562560,562573] [2021-11-06 21:51:10,990 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--net--team--team.ko.cil.i[562709,562722] [2021-11-06 21:51:10,990 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--net--team--team.ko.cil.i[562861,562874] [2021-11-06 21:51:10,990 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--net--team--team.ko.cil.i[563012,563025] [2021-11-06 21:51:10,991 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--net--team--team.ko.cil.i[563161,563174] [2021-11-06 21:51:10,991 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--net--team--team.ko.cil.i[563313,563326] [2021-11-06 21:51:10,992 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--net--team--team.ko.cil.i[563461,563474] [2021-11-06 21:51:10,992 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--net--team--team.ko.cil.i[563614,563627] [2021-11-06 21:51:10,992 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--net--team--team.ko.cil.i[563765,563778] [2021-11-06 21:51:10,995 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--net--team--team.ko.cil.i[563915,563928] [2021-11-06 21:51:10,996 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--net--team--team.ko.cil.i[564062,564075] [2021-11-06 21:51:10,996 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--net--team--team.ko.cil.i[564213,564226] [2021-11-06 21:51:10,996 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--net--team--team.ko.cil.i[564364,564377] [2021-11-06 21:51:10,997 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--net--team--team.ko.cil.i[564512,564525] [2021-11-06 21:51:10,998 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--net--team--team.ko.cil.i[564678,564691] [2021-11-06 21:51:10,998 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--net--team--team.ko.cil.i[564847,564860] [2021-11-06 21:51:10,998 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--net--team--team.ko.cil.i[565014,565027] [2021-11-06 21:51:10,999 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--net--team--team.ko.cil.i[565182,565195] [2021-11-06 21:51:10,999 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--net--team--team.ko.cil.i[565332,565345] [2021-11-06 21:51:10,999 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--net--team--team.ko.cil.i[565479,565492] [2021-11-06 21:51:10,999 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--net--team--team.ko.cil.i[565640,565653] [2021-11-06 21:51:11,000 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--net--team--team.ko.cil.i[565810,565823] [2021-11-06 21:51:11,000 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--net--team--team.ko.cil.i[565972,565985] [2021-11-06 21:51:11,004 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 21:51:11,306 INFO L208 MainTranslator]: Completed translation [2021-11-06 21:51:11,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:11 WrapperNode [2021-11-06 21:51:11,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 21:51:11,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 21:51:11,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 21:51:11,336 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 21:51:11,353 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:51:11" (1/1) ... [2021-11-06 21:51:11,453 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:51:11" (1/1) ... [2021-11-06 21:51:12,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 21:51:12,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 21:51:12,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 21:51:12,027 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 21:51:12,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:11" (1/1) ... [2021-11-06 21:51:12,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:11" (1/1) ... [2021-11-06 21:51:12,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:11" (1/1) ... [2021-11-06 21:51:12,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:11" (1/1) ... [2021-11-06 21:51:12,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:11" (1/1) ... [2021-11-06 21:51:12,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:11" (1/1) ... [2021-11-06 21:51:12,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:11" (1/1) ... [2021-11-06 21:51:12,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 21:51:12,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 21:51:12,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 21:51:12,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 21:51:12,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:11" (1/1) ... [2021-11-06 21:51:12,945 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 21:51:12,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:51:12,960 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:51:12,971 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:51:12,990 INFO L130 BoogieDeclarations]: Found specification of procedure __team_change_mode [2021-11-06 21:51:12,990 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_change_mode [2021-11-06 21:51:12,990 INFO L130 BoogieDeclarations]: Found specification of procedure team_init [2021-11-06 21:51:12,990 INFO L138 BoogieDeclarations]: Found implementation of procedure team_init [2021-11-06 21:51:12,990 INFO L130 BoogieDeclarations]: Found specification of procedure team_del_slave [2021-11-06 21:51:12,991 INFO L138 BoogieDeclarations]: Found implementation of procedure team_del_slave [2021-11-06 21:51:12,991 INFO L130 BoogieDeclarations]: Found specification of procedure team_add_slave [2021-11-06 21:51:12,991 INFO L138 BoogieDeclarations]: Found implementation of procedure team_add_slave [2021-11-06 21:51:12,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 21:51:12,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 21:51:12,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 21:51:12,991 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-06 21:51:12,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dummy_resourceless_instance_callback_0_48 [2021-11-06 21:51:12,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dummy_resourceless_instance_callback_0_48 [2021-11-06 21:51:12,992 INFO L130 BoogieDeclarations]: Found specification of procedure team_nl_cmd_options_set [2021-11-06 21:51:12,992 INFO L138 BoogieDeclarations]: Found implementation of procedure team_nl_cmd_options_set [2021-11-06 21:51:12,992 INFO L130 BoogieDeclarations]: Found specification of procedure team_port_del [2021-11-06 21:51:12,992 INFO L138 BoogieDeclarations]: Found implementation of procedure team_port_del [2021-11-06 21:51:12,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 21:51:12,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 21:51:12,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 21:51:12,994 INFO L130 BoogieDeclarations]: Found specification of procedure team_options_register [2021-11-06 21:51:12,994 INFO L138 BoogieDeclarations]: Found implementation of procedure team_options_register [2021-11-06 21:51:12,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dummy_resourceless_instance_callback_0_11 [2021-11-06 21:51:12,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dummy_resourceless_instance_callback_0_11 [2021-11-06 21:51:12,995 INFO L130 BoogieDeclarations]: Found specification of procedure __team_option_inst_add_option [2021-11-06 21:51:12,995 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_option_inst_add_option [2021-11-06 21:51:12,995 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_size_call_parameter [2021-11-06 21:51:12,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dummy_resourceless_instance_callback_0_36 [2021-11-06 21:51:12,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dummy_resourceless_instance_callback_0_36 [2021-11-06 21:51:12,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dummy_resourceless_instance_callback_0_29 [2021-11-06 21:51:12,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dummy_resourceless_instance_callback_0_29 [2021-11-06 21:51:12,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 21:51:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 21:51:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure team_nl_cmd_options_get [2021-11-06 21:51:12,996 INFO L138 BoogieDeclarations]: Found implementation of procedure team_nl_cmd_options_get [2021-11-06 21:51:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure team_nl_fill_one_option_get [2021-11-06 21:51:12,996 INFO L138 BoogieDeclarations]: Found implementation of procedure team_nl_fill_one_option_get [2021-11-06 21:51:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netdev_rx_handler_register_149 [2021-11-06 21:51:12,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netdev_rx_handler_register_149 [2021-11-06 21:51:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 21:51:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure team_nl_send_options_get [2021-11-06 21:51:12,997 INFO L138 BoogieDeclarations]: Found implementation of procedure team_nl_send_options_get [2021-11-06 21:51:12,997 INFO L130 BoogieDeclarations]: Found specification of procedure __team_option_inst_add_port [2021-11-06 21:51:12,997 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_option_inst_add_port [2021-11-06 21:51:12,997 INFO L130 BoogieDeclarations]: Found specification of procedure __team_options_change_check [2021-11-06 21:51:12,997 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_options_change_check [2021-11-06 21:51:12,997 INFO L130 BoogieDeclarations]: Found specification of procedure team_port_enter [2021-11-06 21:51:12,997 INFO L138 BoogieDeclarations]: Found implementation of procedure team_port_enter [2021-11-06 21:51:12,997 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2021-11-06 21:51:12,997 INFO L130 BoogieDeclarations]: Found specification of procedure __team_option_inst_add [2021-11-06 21:51:12,998 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_option_inst_add [2021-11-06 21:51:12,998 INFO L130 BoogieDeclarations]: Found specification of procedure team_option_set [2021-11-06 21:51:12,998 INFO L138 BoogieDeclarations]: Found implementation of procedure team_option_set [2021-11-06 21:51:12,998 INFO L130 BoogieDeclarations]: Found specification of procedure team_port_add [2021-11-06 21:51:12,998 INFO L138 BoogieDeclarations]: Found implementation of procedure team_port_add [2021-11-06 21:51:12,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 21:51:12,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_register_20_2 [2021-11-06 21:51:12,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_register_20_2 [2021-11-06 21:51:12,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-06 21:51:12,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-06 21:51:12,999 INFO L130 BoogieDeclarations]: Found specification of procedure team_mode_option_set [2021-11-06 21:51:12,999 INFO L138 BoogieDeclarations]: Found implementation of procedure team_mode_option_set [2021-11-06 21:51:12,999 INFO L130 BoogieDeclarations]: Found specification of procedure team_change_mode [2021-11-06 21:51:12,999 INFO L138 BoogieDeclarations]: Found implementation of procedure team_change_mode [2021-11-06 21:51:12,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_net_dummy_resourceless_instance_0 [2021-11-06 21:51:12,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_net_dummy_resourceless_instance_0 [2021-11-06 21:51:13,000 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-11-06 21:51:13,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-11-06 21:51:13,000 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2021-11-06 21:51:13,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2021-11-06 21:51:13,000 INFO L130 BoogieDeclarations]: Found specification of procedure __team_options_register [2021-11-06 21:51:13,000 INFO L138 BoogieDeclarations]: Found implementation of procedure __team_options_register [2021-11-06 21:51:13,000 INFO L130 BoogieDeclarations]: Found specification of procedure __cmpxchg_wrong_size [2021-11-06 21:51:13,001 INFO L130 BoogieDeclarations]: Found specification of procedure team_options_change_check [2021-11-06 21:51:13,003 INFO L138 BoogieDeclarations]: Found implementation of procedure team_options_change_check [2021-11-06 21:51:13,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 21:51:13,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 21:51:13,003 INFO L130 BoogieDeclarations]: Found specification of procedure team_option_get [2021-11-06 21:51:13,003 INFO L138 BoogieDeclarations]: Found implementation of procedure team_option_get [2021-11-06 21:51:13,004 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-11-06 21:51:13,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2021-11-06 21:51:13,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 21:51:13,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netdev_rx_handler_register [2021-11-06 21:51:13,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netdev_rx_handler_register [2021-11-06 21:51:13,005 INFO L130 BoogieDeclarations]: Found specification of procedure team_nl_send_event_options_get [2021-11-06 21:51:13,005 INFO L138 BoogieDeclarations]: Found implementation of procedure team_nl_send_event_options_get [2021-11-06 21:51:13,005 INFO L130 BoogieDeclarations]: Found specification of procedure team_uninit [2021-11-06 21:51:13,005 INFO L138 BoogieDeclarations]: Found implementation of procedure team_uninit [2021-11-06 21:51:27,024 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_24_returnLabel: main_#res := 0; [2021-11-06 21:51:27,025 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L14647: #t~ret1588 := main_#res; [2021-11-06 21:51:27,025 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-06 21:51:27,061 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 21:51:27,061 INFO L299 CfgBuilder]: Removed 7023 assume(true) statements. [2021-11-06 21:51:27,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:51:27 BoogieIcfgContainer [2021-11-06 21:51:27,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 21:51:27,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 21:51:27,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 21:51:27,070 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 21:51:27,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:51:06" (1/3) ... [2021-11-06 21:51:27,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a81a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:51:27, skipping insertion in model container [2021-11-06 21:51:27,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:51:11" (2/3) ... [2021-11-06 21:51:27,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a81a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:51:27, skipping insertion in model container [2021-11-06 21:51:27,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:51:27" (3/3) ... [2021-11-06 21:51:27,073 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--team--team.ko.cil.i [2021-11-06 21:51:27,078 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 21:51:27,079 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 291 error locations. [2021-11-06 21:51:27,134 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 21:51:27,141 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:51:27,141 INFO L340 AbstractCegarLoop]: Starting to check reachability of 291 error locations. [2021-11-06 21:51:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 6753 states, 6373 states have (on average 1.397928761964538) internal successors, (8909), 6668 states have internal predecessors, (8909), 54 states have call successors, (54), 35 states have call predecessors, (54), 35 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2021-11-06 21:51:27,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-06 21:51:27,215 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:27,215 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] [2021-11-06 21:51:27,216 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:51:27,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:27,220 INFO L85 PathProgramCache]: Analyzing trace with hash 965419576, now seen corresponding path program 1 times [2021-11-06 21:51:27,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:27,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586727235] [2021-11-06 21:51:27,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:27,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:27,728 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:51:27,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:27,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586727235] [2021-11-06 21:51:27,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586727235] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:27,729 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:27,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:27,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987753182] [2021-11-06 21:51:27,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:27,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:27,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:27,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:27,751 INFO L87 Difference]: Start difference. First operand has 6753 states, 6373 states have (on average 1.397928761964538) internal successors, (8909), 6668 states have internal predecessors, (8909), 54 states have call successors, (54), 35 states have call predecessors, (54), 35 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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:51:28,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:28,101 INFO L93 Difference]: Finished difference Result 13183 states and 17574 transitions. [2021-11-06 21:51:28,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:28,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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 32 [2021-11-06 21:51:28,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:28,138 INFO L225 Difference]: With dead ends: 13183 [2021-11-06 21:51:28,139 INFO L226 Difference]: Without dead ends: 6268 [2021-11-06 21:51:28,168 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:51:28,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6268 states. [2021-11-06 21:51:28,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6268 to 6268. [2021-11-06 21:51:28,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6268 states, 5890 states have (on average 1.3030560271646858) internal successors, (7675), 6183 states have internal predecessors, (7675), 54 states have call successors, (54), 35 states have call predecessors, (54), 35 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2021-11-06 21:51:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6268 states to 6268 states and 7783 transitions. [2021-11-06 21:51:28,553 INFO L78 Accepts]: Start accepts. Automaton has 6268 states and 7783 transitions. Word has length 32 [2021-11-06 21:51:28,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:28,553 INFO L470 AbstractCegarLoop]: Abstraction has 6268 states and 7783 transitions. [2021-11-06 21:51:28,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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:51:28,554 INFO L276 IsEmpty]: Start isEmpty. Operand 6268 states and 7783 transitions. [2021-11-06 21:51:28,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-06 21:51:28,554 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:28,555 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] [2021-11-06 21:51:28,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 21:51:28,555 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:51:28,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:28,556 INFO L85 PathProgramCache]: Analyzing trace with hash 55946844, now seen corresponding path program 1 times [2021-11-06 21:51:28,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:28,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573105012] [2021-11-06 21:51:28,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:28,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:28,762 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:51:28,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:28,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573105012] [2021-11-06 21:51:28,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573105012] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:28,763 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:28,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:28,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570749929] [2021-11-06 21:51:28,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:28,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:28,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:28,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:28,765 INFO L87 Difference]: Start difference. First operand 6268 states and 7783 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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:51:28,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:28,916 INFO L93 Difference]: Finished difference Result 6268 states and 7783 transitions. [2021-11-06 21:51:28,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:28,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2021-11-06 21:51:28,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:28,938 INFO L225 Difference]: With dead ends: 6268 [2021-11-06 21:51:28,939 INFO L226 Difference]: Without dead ends: 6264 [2021-11-06 21:51:28,942 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:51:28,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6264 states. [2021-11-06 21:51:29,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6264 to 6264. [2021-11-06 21:51:29,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6264 states, 5888 states have (on average 1.302819293478261) internal successors, (7671), 6179 states have internal predecessors, (7671), 54 states have call successors, (54), 35 states have call predecessors, (54), 35 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2021-11-06 21:51:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6264 states to 6264 states and 7779 transitions. [2021-11-06 21:51:29,086 INFO L78 Accepts]: Start accepts. Automaton has 6264 states and 7779 transitions. Word has length 34 [2021-11-06 21:51:29,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:29,087 INFO L470 AbstractCegarLoop]: Abstraction has 6264 states and 7779 transitions. [2021-11-06 21:51:29,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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:51:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 6264 states and 7779 transitions. [2021-11-06 21:51:29,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 21:51:29,090 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:29,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] [2021-11-06 21:51:29,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 21:51:29,090 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:51:29,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:29,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2068987168, now seen corresponding path program 1 times [2021-11-06 21:51:29,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:29,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909364103] [2021-11-06 21:51:29,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:29,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:29,281 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:51:29,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:29,281 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909364103] [2021-11-06 21:51:29,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909364103] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:29,282 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:29,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:29,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714362150] [2021-11-06 21:51:29,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:29,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:29,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:29,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:29,283 INFO L87 Difference]: Start difference. First operand 6264 states and 7779 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 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:51:29,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:29,409 INFO L93 Difference]: Finished difference Result 6264 states and 7779 transitions. [2021-11-06 21:51:29,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:29,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2021-11-06 21:51:29,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:29,427 INFO L225 Difference]: With dead ends: 6264 [2021-11-06 21:51:29,427 INFO L226 Difference]: Without dead ends: 6260 [2021-11-06 21:51:29,430 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:51:29,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6260 states. [2021-11-06 21:51:29,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6260 to 6260. [2021-11-06 21:51:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6260 states, 5886 states have (on average 1.3025823989126741) internal successors, (7667), 6175 states have internal predecessors, (7667), 54 states have call successors, (54), 35 states have call predecessors, (54), 35 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2021-11-06 21:51:29,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6260 states to 6260 states and 7775 transitions. [2021-11-06 21:51:29,573 INFO L78 Accepts]: Start accepts. Automaton has 6260 states and 7775 transitions. Word has length 36 [2021-11-06 21:51:29,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:29,573 INFO L470 AbstractCegarLoop]: Abstraction has 6260 states and 7775 transitions. [2021-11-06 21:51:29,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 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:51:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand 6260 states and 7775 transitions. [2021-11-06 21:51:29,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-06 21:51:29,574 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:29,574 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] [2021-11-06 21:51:29,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 21:51:29,575 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:51:29,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:29,575 INFO L85 PathProgramCache]: Analyzing trace with hash 273860548, now seen corresponding path program 1 times [2021-11-06 21:51:29,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:29,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298755785] [2021-11-06 21:51:29,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:29,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:29,742 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:51:29,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:29,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298755785] [2021-11-06 21:51:29,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298755785] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:29,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:29,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:29,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523591250] [2021-11-06 21:51:29,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:29,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:29,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:29,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:29,745 INFO L87 Difference]: Start difference. First operand 6260 states and 7775 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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:51:29,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:29,909 INFO L93 Difference]: Finished difference Result 6260 states and 7775 transitions. [2021-11-06 21:51:29,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:29,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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 38 [2021-11-06 21:51:29,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:29,929 INFO L225 Difference]: With dead ends: 6260 [2021-11-06 21:51:29,929 INFO L226 Difference]: Without dead ends: 6256 [2021-11-06 21:51:29,932 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:51:29,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6256 states. [2021-11-06 21:51:30,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6256 to 6256. [2021-11-06 21:51:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6256 states, 5884 states have (on average 1.302345343303875) internal successors, (7663), 6171 states have internal predecessors, (7663), 54 states have call successors, (54), 35 states have call predecessors, (54), 35 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2021-11-06 21:51:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6256 states to 6256 states and 7771 transitions. [2021-11-06 21:51:30,122 INFO L78 Accepts]: Start accepts. Automaton has 6256 states and 7771 transitions. Word has length 38 [2021-11-06 21:51:30,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:30,124 INFO L470 AbstractCegarLoop]: Abstraction has 6256 states and 7771 transitions. [2021-11-06 21:51:30,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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:51:30,125 INFO L276 IsEmpty]: Start isEmpty. Operand 6256 states and 7771 transitions. [2021-11-06 21:51:30,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-06 21:51:30,128 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:30,128 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] [2021-11-06 21:51:30,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 21:51:30,128 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:51:30,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:30,129 INFO L85 PathProgramCache]: Analyzing trace with hash 557144141, now seen corresponding path program 1 times [2021-11-06 21:51:30,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:30,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079221420] [2021-11-06 21:51:30,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:30,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:30,408 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:51:30,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:30,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079221420] [2021-11-06 21:51:30,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079221420] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:30,409 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:30,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:30,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008553248] [2021-11-06 21:51:30,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:30,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:30,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:30,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:30,411 INFO L87 Difference]: Start difference. First operand 6256 states and 7771 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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:51:30,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:30,995 INFO L93 Difference]: Finished difference Result 13136 states and 16363 transitions. [2021-11-06 21:51:30,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:51:30,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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 38 [2021-11-06 21:51:30,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:31,031 INFO L225 Difference]: With dead ends: 13136 [2021-11-06 21:51:31,031 INFO L226 Difference]: Without dead ends: 13126 [2021-11-06 21:51:31,039 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:51:31,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13126 states. [2021-11-06 21:51:31,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13126 to 9242. [2021-11-06 21:51:31,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9242 states, 8806 states have (on average 1.3117192823075177) internal successors, (11551), 9095 states have internal predecessors, (11551), 94 states have call successors, (94), 62 states have call predecessors, (94), 63 states have return successors, (177), 90 states have call predecessors, (177), 94 states have call successors, (177) [2021-11-06 21:51:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9242 states to 9242 states and 11822 transitions. [2021-11-06 21:51:31,315 INFO L78 Accepts]: Start accepts. Automaton has 9242 states and 11822 transitions. Word has length 38 [2021-11-06 21:51:31,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:31,315 INFO L470 AbstractCegarLoop]: Abstraction has 9242 states and 11822 transitions. [2021-11-06 21:51:31,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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:51:31,316 INFO L276 IsEmpty]: Start isEmpty. Operand 9242 states and 11822 transitions. [2021-11-06 21:51:31,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-06 21:51:31,316 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:31,316 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:51:31,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 21:51:31,317 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:51:31,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:31,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1187652872, now seen corresponding path program 1 times [2021-11-06 21:51:31,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:31,317 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816225373] [2021-11-06 21:51:31,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:31,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:31,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:51:31,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:31,486 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816225373] [2021-11-06 21:51:31,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816225373] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:31,486 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:31,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:31,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281107712] [2021-11-06 21:51:31,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:31,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:31,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:31,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:31,487 INFO L87 Difference]: Start difference. First operand 9242 states and 11822 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:51:31,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:31,701 INFO L93 Difference]: Finished difference Result 9242 states and 11822 transitions. [2021-11-06 21:51:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:31,702 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:51:31,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:31,728 INFO L225 Difference]: With dead ends: 9242 [2021-11-06 21:51:31,729 INFO L226 Difference]: Without dead ends: 9238 [2021-11-06 21:51:31,733 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:51:31,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9238 states. [2021-11-06 21:51:32,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9238 to 9238. [2021-11-06 21:51:32,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9238 states, 8804 states have (on average 1.3115629259427533) internal successors, (11547), 9091 states have internal predecessors, (11547), 94 states have call successors, (94), 62 states have call predecessors, (94), 63 states have return successors, (177), 90 states have call predecessors, (177), 94 states have call successors, (177) [2021-11-06 21:51:32,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9238 states to 9238 states and 11818 transitions. [2021-11-06 21:51:32,255 INFO L78 Accepts]: Start accepts. Automaton has 9238 states and 11818 transitions. Word has length 40 [2021-11-06 21:51:32,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:32,255 INFO L470 AbstractCegarLoop]: Abstraction has 9238 states and 11818 transitions. [2021-11-06 21:51:32,256 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:51:32,256 INFO L276 IsEmpty]: Start isEmpty. Operand 9238 states and 11818 transitions. [2021-11-06 21:51:32,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 21:51:32,257 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:32,257 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] [2021-11-06 21:51:32,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 21:51:32,258 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:51:32,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:32,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1126219092, now seen corresponding path program 1 times [2021-11-06 21:51:32,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:32,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798509182] [2021-11-06 21:51:32,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:32,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:32,442 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:51:32,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:32,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798509182] [2021-11-06 21:51:32,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798509182] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:32,442 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:32,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:32,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171493133] [2021-11-06 21:51:32,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:32,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:32,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:32,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:32,444 INFO L87 Difference]: Start difference. First operand 9238 states and 11818 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 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:51:32,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:32,803 INFO L93 Difference]: Finished difference Result 9238 states and 11818 transitions. [2021-11-06 21:51:32,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:32,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 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 42 [2021-11-06 21:51:32,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:32,831 INFO L225 Difference]: With dead ends: 9238 [2021-11-06 21:51:32,831 INFO L226 Difference]: Without dead ends: 9234 [2021-11-06 21:51:32,836 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:51:32,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9234 states. [2021-11-06 21:51:33,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9234 to 9234. [2021-11-06 21:51:33,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9234 states, 8802 states have (on average 1.311406498523063) internal successors, (11543), 9087 states have internal predecessors, (11543), 94 states have call successors, (94), 62 states have call predecessors, (94), 63 states have return successors, (177), 90 states have call predecessors, (177), 94 states have call successors, (177) [2021-11-06 21:51:33,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 11814 transitions. [2021-11-06 21:51:33,163 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 11814 transitions. Word has length 42 [2021-11-06 21:51:33,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:33,163 INFO L470 AbstractCegarLoop]: Abstraction has 9234 states and 11814 transitions. [2021-11-06 21:51:33,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 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:51:33,163 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 11814 transitions. [2021-11-06 21:51:33,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-06 21:51:33,164 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:33,164 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:51:33,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 21:51:33,164 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting team_del_slaveErr0ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:51:33,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:33,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1320663299, now seen corresponding path program 1 times [2021-11-06 21:51:33,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:33,165 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101988293] [2021-11-06 21:51:33,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:33,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:33,461 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:51:33,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:33,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101988293] [2021-11-06 21:51:33,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101988293] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:33,462 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:33,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:33,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781342561] [2021-11-06 21:51:33,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:33,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:33,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:33,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:33,464 INFO L87 Difference]: Start difference. First operand 9234 states and 11814 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:33,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:33,873 INFO L93 Difference]: Finished difference Result 10885 states and 13644 transitions. [2021-11-06 21:51:33,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:51:33,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:51:33,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:33,899 INFO L225 Difference]: With dead ends: 10885 [2021-11-06 21:51:33,900 INFO L226 Difference]: Without dead ends: 10883 [2021-11-06 21:51:33,906 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:51:33,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10883 states. [2021-11-06 21:51:34,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10883 to 9248. [2021-11-06 21:51:34,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9248 states, 8813 states have (on average 1.3110178145920799) internal successors, (11554), 9099 states have internal predecessors, (11554), 97 states have call successors, (97), 64 states have call predecessors, (97), 63 states have return successors, (180), 90 states have call predecessors, (180), 97 states have call successors, (180) [2021-11-06 21:51:34,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9248 states to 9248 states and 11831 transitions. [2021-11-06 21:51:34,263 INFO L78 Accepts]: Start accepts. Automaton has 9248 states and 11831 transitions. Word has length 43 [2021-11-06 21:51:34,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:34,263 INFO L470 AbstractCegarLoop]: Abstraction has 9248 states and 11831 transitions. [2021-11-06 21:51:34,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:51:34,264 INFO L276 IsEmpty]: Start isEmpty. Operand 9248 states and 11831 transitions. [2021-11-06 21:51:34,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-06 21:51:34,264 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:34,264 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] [2021-11-06 21:51:34,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 21:51:34,265 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:51:34,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:34,265 INFO L85 PathProgramCache]: Analyzing trace with hash 35883184, now seen corresponding path program 1 times [2021-11-06 21:51:34,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:34,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847138788] [2021-11-06 21:51:34,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:34,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:34,410 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:51:34,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:34,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847138788] [2021-11-06 21:51:34,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847138788] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:34,410 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:34,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:34,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300211951] [2021-11-06 21:51:34,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:34,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:34,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:34,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:34,412 INFO L87 Difference]: Start difference. First operand 9248 states and 11831 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 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:51:34,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:34,621 INFO L93 Difference]: Finished difference Result 9248 states and 11831 transitions. [2021-11-06 21:51:34,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:34,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2021-11-06 21:51:34,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:34,642 INFO L225 Difference]: With dead ends: 9248 [2021-11-06 21:51:34,642 INFO L226 Difference]: Without dead ends: 9244 [2021-11-06 21:51:34,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:51:34,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9244 states. [2021-11-06 21:51:34,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9244 to 9244. [2021-11-06 21:51:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9244 states, 8811 states have (on average 1.3108614232209739) internal successors, (11550), 9095 states have internal predecessors, (11550), 97 states have call successors, (97), 64 states have call predecessors, (97), 63 states have return successors, (180), 90 states have call predecessors, (180), 97 states have call successors, (180) [2021-11-06 21:51:34,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9244 states to 9244 states and 11827 transitions. [2021-11-06 21:51:34,965 INFO L78 Accepts]: Start accepts. Automaton has 9244 states and 11827 transitions. Word has length 44 [2021-11-06 21:51:34,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:34,965 INFO L470 AbstractCegarLoop]: Abstraction has 9244 states and 11827 transitions. [2021-11-06 21:51:34,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 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:51:34,966 INFO L276 IsEmpty]: Start isEmpty. Operand 9244 states and 11827 transitions. [2021-11-06 21:51:34,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-06 21:51:34,966 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:34,966 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:51:34,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 21:51:34,967 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:51:34,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:34,967 INFO L85 PathProgramCache]: Analyzing trace with hash 124673812, now seen corresponding path program 1 times [2021-11-06 21:51:34,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:34,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773906418] [2021-11-06 21:51:34,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:34,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:35,109 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:51:35,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:35,109 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773906418] [2021-11-06 21:51:35,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773906418] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:35,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:35,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:35,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127911078] [2021-11-06 21:51:35,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:35,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:35,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:35,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:35,111 INFO L87 Difference]: Start difference. First operand 9244 states and 11827 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 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:51:35,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:35,318 INFO L93 Difference]: Finished difference Result 9244 states and 11827 transitions. [2021-11-06 21:51:35,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:35,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 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:51:35,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:35,340 INFO L225 Difference]: With dead ends: 9244 [2021-11-06 21:51:35,340 INFO L226 Difference]: Without dead ends: 9240 [2021-11-06 21:51:35,345 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:51:35,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9240 states. [2021-11-06 21:51:35,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9240 to 9240. [2021-11-06 21:51:35,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9240 states, 8809 states have (on average 1.3107049608355092) internal successors, (11546), 9091 states have internal predecessors, (11546), 97 states have call successors, (97), 64 states have call predecessors, (97), 63 states have return successors, (180), 90 states have call predecessors, (180), 97 states have call successors, (180) [2021-11-06 21:51:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9240 states to 9240 states and 11823 transitions. [2021-11-06 21:51:35,665 INFO L78 Accepts]: Start accepts. Automaton has 9240 states and 11823 transitions. Word has length 46 [2021-11-06 21:51:35,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:35,665 INFO L470 AbstractCegarLoop]: Abstraction has 9240 states and 11823 transitions. [2021-11-06 21:51:35,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 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:51:35,666 INFO L276 IsEmpty]: Start isEmpty. Operand 9240 states and 11823 transitions. [2021-11-06 21:51:35,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-06 21:51:35,666 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:35,667 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:51:35,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 21:51:35,667 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:51:35,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:35,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1394156751, now seen corresponding path program 1 times [2021-11-06 21:51:35,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:35,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488916523] [2021-11-06 21:51:35,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:35,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:35,893 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:51:35,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:35,893 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488916523] [2021-11-06 21:51:35,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488916523] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:35,894 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:35,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:51:35,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089289146] [2021-11-06 21:51:35,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:35,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:35,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:35,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:35,896 INFO L87 Difference]: Start difference. First operand 9240 states and 11823 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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:51:38,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:38,595 INFO L93 Difference]: Finished difference Result 14053 states and 17556 transitions. [2021-11-06 21:51:38,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:51:38,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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:51:38,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:38,624 INFO L225 Difference]: With dead ends: 14053 [2021-11-06 21:51:38,624 INFO L226 Difference]: Without dead ends: 14043 [2021-11-06 21:51:38,630 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:51:38,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14043 states. [2021-11-06 21:51:38,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14043 to 9525. [2021-11-06 21:51:38,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9525 states, 9098 states have (on average 1.3098483183117169) internal successors, (11917), 9376 states have internal predecessors, (11917), 97 states have call successors, (97), 64 states have call predecessors, (97), 63 states have return successors, (180), 90 states have call predecessors, (180), 97 states have call successors, (180) [2021-11-06 21:51:38,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9525 states to 9525 states and 12194 transitions. [2021-11-06 21:51:38,916 INFO L78 Accepts]: Start accepts. Automaton has 9525 states and 12194 transitions. Word has length 46 [2021-11-06 21:51:38,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:38,916 INFO L470 AbstractCegarLoop]: Abstraction has 9525 states and 12194 transitions. [2021-11-06 21:51:38,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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:51:38,916 INFO L276 IsEmpty]: Start isEmpty. Operand 9525 states and 12194 transitions. [2021-11-06 21:51:38,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-06 21:51:38,917 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:38,917 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:51:38,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 21:51:38,918 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:51:38,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:38,918 INFO L85 PathProgramCache]: Analyzing trace with hash -446879241, now seen corresponding path program 1 times [2021-11-06 21:51:38,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:38,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719689379] [2021-11-06 21:51:38,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:38,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:39,057 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:51:39,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:39,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719689379] [2021-11-06 21:51:39,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719689379] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:39,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:39,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:39,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179860580] [2021-11-06 21:51:39,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:39,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:39,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:39,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:39,059 INFO L87 Difference]: Start difference. First operand 9525 states and 12194 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 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:51:39,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:39,411 INFO L93 Difference]: Finished difference Result 9525 states and 12194 transitions. [2021-11-06 21:51:39,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:39,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 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:51:39,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:39,425 INFO L225 Difference]: With dead ends: 9525 [2021-11-06 21:51:39,425 INFO L226 Difference]: Without dead ends: 9521 [2021-11-06 21:51:39,427 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:51:39,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9521 states. [2021-11-06 21:51:39,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9521 to 9521. [2021-11-06 21:51:39,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9521 states, 9096 states have (on average 1.3096965699208443) internal successors, (11913), 9372 states have internal predecessors, (11913), 97 states have call successors, (97), 64 states have call predecessors, (97), 63 states have return successors, (180), 90 states have call predecessors, (180), 97 states have call successors, (180) [2021-11-06 21:51:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9521 states to 9521 states and 12190 transitions. [2021-11-06 21:51:39,675 INFO L78 Accepts]: Start accepts. Automaton has 9521 states and 12190 transitions. Word has length 48 [2021-11-06 21:51:39,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:39,675 INFO L470 AbstractCegarLoop]: Abstraction has 9521 states and 12190 transitions. [2021-11-06 21:51:39,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 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:51:39,676 INFO L276 IsEmpty]: Start isEmpty. Operand 9521 states and 12190 transitions. [2021-11-06 21:51:39,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-06 21:51:39,676 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:39,676 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:51:39,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 21:51:39,677 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:51:39,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:39,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1724295106, now seen corresponding path program 1 times [2021-11-06 21:51:39,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:39,677 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013609813] [2021-11-06 21:51:39,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:39,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:39,793 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:51:39,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:39,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013609813] [2021-11-06 21:51:39,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013609813] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:39,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:39,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:51:39,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481360720] [2021-11-06 21:51:39,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:39,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:39,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:39,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:39,795 INFO L87 Difference]: Start difference. First operand 9521 states and 12190 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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:51:40,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:40,313 INFO L93 Difference]: Finished difference Result 14480 states and 18360 transitions. [2021-11-06 21:51:40,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:51:40,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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:51:40,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:40,340 INFO L225 Difference]: With dead ends: 14480 [2021-11-06 21:51:40,341 INFO L226 Difference]: Without dead ends: 14462 [2021-11-06 21:51:40,346 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:51:40,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14462 states. [2021-11-06 21:51:40,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14462 to 9543. [2021-11-06 21:51:40,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9543 states, 9118 states have (on average 1.3089493309936389) internal successors, (11935), 9394 states have internal predecessors, (11935), 97 states have call successors, (97), 64 states have call predecessors, (97), 63 states have return successors, (180), 90 states have call predecessors, (180), 97 states have call successors, (180) [2021-11-06 21:51:40,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9543 states to 9543 states and 12212 transitions. [2021-11-06 21:51:40,874 INFO L78 Accepts]: Start accepts. Automaton has 9543 states and 12212 transitions. Word has length 48 [2021-11-06 21:51:40,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:40,875 INFO L470 AbstractCegarLoop]: Abstraction has 9543 states and 12212 transitions. [2021-11-06 21:51:40,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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:51:40,875 INFO L276 IsEmpty]: Start isEmpty. Operand 9543 states and 12212 transitions. [2021-11-06 21:51:40,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-06 21:51:40,876 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:40,876 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:51:40,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 21:51:40,876 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:51:40,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:40,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1724354688, now seen corresponding path program 1 times [2021-11-06 21:51:40,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:40,877 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267810102] [2021-11-06 21:51:40,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:40,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:41,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:51:41,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:41,036 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267810102] [2021-11-06 21:51:41,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267810102] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:41,036 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:41,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:51:41,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409947438] [2021-11-06 21:51:41,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:51:41,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:41,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:51:41,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:51:41,037 INFO L87 Difference]: Start difference. First operand 9543 states and 12212 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 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:51:41,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:41,578 INFO L93 Difference]: Finished difference Result 21358 states and 27272 transitions. [2021-11-06 21:51:41,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 21:51:41,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 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:51:41,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:41,605 INFO L225 Difference]: With dead ends: 21358 [2021-11-06 21:51:41,606 INFO L226 Difference]: Without dead ends: 11833 [2021-11-06 21:51:41,632 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 21:51:41,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11833 states. [2021-11-06 21:51:42,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11833 to 9503. [2021-11-06 21:51:42,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9503 states, 9087 states have (on average 1.30758226037196) internal successors, (11882), 9354 states have internal predecessors, (11882), 97 states have call successors, (97), 64 states have call predecessors, (97), 63 states have return successors, (180), 90 states have call predecessors, (180), 97 states have call successors, (180) [2021-11-06 21:51:42,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9503 states to 9503 states and 12159 transitions. [2021-11-06 21:51:42,030 INFO L78 Accepts]: Start accepts. Automaton has 9503 states and 12159 transitions. Word has length 48 [2021-11-06 21:51:42,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:42,030 INFO L470 AbstractCegarLoop]: Abstraction has 9503 states and 12159 transitions. [2021-11-06 21:51:42,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 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:51:42,031 INFO L276 IsEmpty]: Start isEmpty. Operand 9503 states and 12159 transitions. [2021-11-06 21:51:42,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-06 21:51:42,031 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:42,031 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] [2021-11-06 21:51:42,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 21:51:42,032 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:51:42,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:42,032 INFO L85 PathProgramCache]: Analyzing trace with hash 46452027, now seen corresponding path program 1 times [2021-11-06 21:51:42,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:42,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207135433] [2021-11-06 21:51:42,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:42,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:42,155 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:51:42,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:42,156 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207135433] [2021-11-06 21:51:42,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207135433] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:42,156 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:42,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:42,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903879314] [2021-11-06 21:51:42,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:42,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:42,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:42,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:42,157 INFO L87 Difference]: Start difference. First operand 9503 states and 12159 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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:51:42,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:42,716 INFO L93 Difference]: Finished difference Result 18988 states and 24470 transitions. [2021-11-06 21:51:42,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:51:42,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2021-11-06 21:51:42,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:42,763 INFO L225 Difference]: With dead ends: 18988 [2021-11-06 21:51:42,763 INFO L226 Difference]: Without dead ends: 18984 [2021-11-06 21:51:42,773 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:51:42,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18984 states. [2021-11-06 21:51:43,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18984 to 18424. [2021-11-06 21:51:43,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18424 states, 17848 states have (on average 1.3116315553563425) internal successors, (23410), 18127 states have internal predecessors, (23410), 194 states have call successors, (194), 128 states have call predecessors, (194), 126 states have return successors, (532), 180 states have call predecessors, (532), 194 states have call successors, (532) [2021-11-06 21:51:43,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18424 states to 18424 states and 24136 transitions. [2021-11-06 21:51:43,516 INFO L78 Accepts]: Start accepts. Automaton has 18424 states and 24136 transitions. Word has length 50 [2021-11-06 21:51:43,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:43,517 INFO L470 AbstractCegarLoop]: Abstraction has 18424 states and 24136 transitions. [2021-11-06 21:51:43,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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:51:43,517 INFO L276 IsEmpty]: Start isEmpty. Operand 18424 states and 24136 transitions. [2021-11-06 21:51:43,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 21:51:43,518 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:43,518 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:51:43,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 21:51:43,518 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:51:43,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:43,519 INFO L85 PathProgramCache]: Analyzing trace with hash -645564047, now seen corresponding path program 1 times [2021-11-06 21:51:43,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:43,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470920554] [2021-11-06 21:51:43,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:43,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:43,646 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:51:43,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:43,647 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470920554] [2021-11-06 21:51:43,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470920554] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:43,648 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:43,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 21:51:43,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300877064] [2021-11-06 21:51:43,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:51:43,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:43,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:51:43,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:51:43,651 INFO L87 Difference]: Start difference. First operand 18424 states and 24136 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 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:51:44,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:44,381 INFO L93 Difference]: Finished difference Result 36698 states and 48582 transitions. [2021-11-06 21:51:44,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:51:44,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 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:51:44,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:44,430 INFO L225 Difference]: With dead ends: 36698 [2021-11-06 21:51:44,430 INFO L226 Difference]: Without dead ends: 18292 [2021-11-06 21:51:44,507 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:51:44,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18292 states. [2021-11-06 21:51:45,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18292 to 18292. [2021-11-06 21:51:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18292 states, 17742 states have (on average 1.3044752564536128) internal successors, (23144), 17995 states have internal predecessors, (23144), 194 states have call successors, (194), 128 states have call predecessors, (194), 126 states have return successors, (532), 180 states have call predecessors, (532), 194 states have call successors, (532) [2021-11-06 21:51:45,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18292 states to 18292 states and 23870 transitions. [2021-11-06 21:51:45,478 INFO L78 Accepts]: Start accepts. Automaton has 18292 states and 23870 transitions. Word has length 51 [2021-11-06 21:51:45,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:45,478 INFO L470 AbstractCegarLoop]: Abstraction has 18292 states and 23870 transitions. [2021-11-06 21:51:45,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 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:51:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 18292 states and 23870 transitions. [2021-11-06 21:51:45,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-06 21:51:45,479 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:45,479 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] [2021-11-06 21:51:45,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 21:51:45,480 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:51:45,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:45,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1691398367, now seen corresponding path program 1 times [2021-11-06 21:51:45,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:45,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881769183] [2021-11-06 21:51:45,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:45,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:45,608 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:51:45,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:45,608 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881769183] [2021-11-06 21:51:45,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881769183] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:45,609 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:45,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:45,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453880008] [2021-11-06 21:51:45,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:45,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:45,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:45,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:45,610 INFO L87 Difference]: Start difference. First operand 18292 states and 23870 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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:51:46,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:46,427 INFO L93 Difference]: Finished difference Result 18292 states and 23870 transitions. [2021-11-06 21:51:46,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:46,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2021-11-06 21:51:46,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:46,462 INFO L225 Difference]: With dead ends: 18292 [2021-11-06 21:51:46,463 INFO L226 Difference]: Without dead ends: 18288 [2021-11-06 21:51:46,471 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:51:46,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18288 states. [2021-11-06 21:51:47,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18288 to 18288. [2021-11-06 21:51:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18288 states, 17740 states have (on average 1.3043968432919955) internal successors, (23140), 17991 states have internal predecessors, (23140), 194 states have call successors, (194), 128 states have call predecessors, (194), 126 states have return successors, (532), 180 states have call predecessors, (532), 194 states have call successors, (532) [2021-11-06 21:51:47,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18288 states to 18288 states and 23866 transitions. [2021-11-06 21:51:47,391 INFO L78 Accepts]: Start accepts. Automaton has 18288 states and 23866 transitions. Word has length 52 [2021-11-06 21:51:47,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:47,392 INFO L470 AbstractCegarLoop]: Abstraction has 18288 states and 23866 transitions. [2021-11-06 21:51:47,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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:51:47,392 INFO L276 IsEmpty]: Start isEmpty. Operand 18288 states and 23866 transitions. [2021-11-06 21:51:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-06 21:51:47,395 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:47,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] [2021-11-06 21:51:47,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 21:51:47,396 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:51:47,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:47,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1936866531, now seen corresponding path program 1 times [2021-11-06 21:51:47,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:47,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896214650] [2021-11-06 21:51:47,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:47,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:47,537 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:51:47,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:47,538 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896214650] [2021-11-06 21:51:47,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896214650] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:47,538 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:47,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:51:47,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475569615] [2021-11-06 21:51:47,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:51:47,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:47,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:51:47,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:51:47,540 INFO L87 Difference]: Start difference. First operand 18288 states and 23866 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:51:48,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:51:48,322 INFO L93 Difference]: Finished difference Result 18288 states and 23866 transitions. [2021-11-06 21:51:48,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:51:48,323 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:51:48,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:51:48,356 INFO L225 Difference]: With dead ends: 18288 [2021-11-06 21:51:48,357 INFO L226 Difference]: Without dead ends: 18284 [2021-11-06 21:51:48,364 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:51:48,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18284 states. [2021-11-06 21:51:48,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18284 to 18284. [2021-11-06 21:51:48,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18284 states, 17738 states have (on average 1.304318412447852) internal successors, (23136), 17987 states have internal predecessors, (23136), 194 states have call successors, (194), 128 states have call predecessors, (194), 126 states have return successors, (532), 180 states have call predecessors, (532), 194 states have call successors, (532) [2021-11-06 21:51:49,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18284 states to 18284 states and 23862 transitions. [2021-11-06 21:51:49,039 INFO L78 Accepts]: Start accepts. Automaton has 18284 states and 23862 transitions. Word has length 54 [2021-11-06 21:51:49,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:51:49,039 INFO L470 AbstractCegarLoop]: Abstraction has 18284 states and 23862 transitions. [2021-11-06 21:51:49,039 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:51:49,039 INFO L276 IsEmpty]: Start isEmpty. Operand 18284 states and 23862 transitions. [2021-11-06 21:51:49,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 21:51:49,040 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:51:49,040 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:51:49,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 21:51:49,041 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting team_del_slaveErr1ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:51:49,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:51:49,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2023175410, now seen corresponding path program 1 times [2021-11-06 21:51:49,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:51:49,041 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112296451] [2021-11-06 21:51:49,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:51:49,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:51:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:49,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-06 21:51:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:51:49,280 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:51:49,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:51:49,281 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112296451] [2021-11-06 21:51:49,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112296451] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:51:49,281 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:51:49,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 21:51:49,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893758709] [2021-11-06 21:51:49,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 21:51:49,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:51:49,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 21:51:49,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-06 21:51:49,282 INFO L87 Difference]: Start difference. First operand 18284 states and 23862 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:52:05,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:52:05,530 INFO L93 Difference]: Finished difference Result 29818 states and 38686 transitions. [2021-11-06 21:52:05,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-06 21:52:05,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2021-11-06 21:52:05,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:52:05,638 INFO L225 Difference]: With dead ends: 29818 [2021-11-06 21:52:05,638 INFO L226 Difference]: Without dead ends: 29816 [2021-11-06 21:52:05,650 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-06 21:52:05,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29816 states. [2021-11-06 21:52:06,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29816 to 23393. [2021-11-06 21:52:06,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23393 states, 22672 states have (on average 1.3008115737473536) internal successors, (29492), 22965 states have internal predecessors, (29492), 226 states have call successors, (226), 128 states have call predecessors, (226), 269 states have return successors, (856), 317 states have call predecessors, (856), 226 states have call successors, (856) [2021-11-06 21:52:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23393 states to 23393 states and 30574 transitions. [2021-11-06 21:52:06,713 INFO L78 Accepts]: Start accepts. Automaton has 23393 states and 30574 transitions. Word has length 57 [2021-11-06 21:52:06,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:52:06,714 INFO L470 AbstractCegarLoop]: Abstraction has 23393 states and 30574 transitions. [2021-11-06 21:52:06,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:52:06,714 INFO L276 IsEmpty]: Start isEmpty. Operand 23393 states and 30574 transitions. [2021-11-06 21:52:06,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-06 21:52:06,719 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:52:06,720 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:52:06,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 21:52:06,720 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:52:06,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:52:06,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1608571207, now seen corresponding path program 1 times [2021-11-06 21:52:06,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:52:06,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118419917] [2021-11-06 21:52:06,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:52:06,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:52:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:52:06,853 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:52:06,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:52:06,854 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118419917] [2021-11-06 21:52:06,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118419917] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:52:06,854 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:52:06,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:52:06,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654065136] [2021-11-06 21:52:06,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:52:06,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:52:06,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:52:06,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:52:06,856 INFO L87 Difference]: Start difference. First operand 23393 states and 30574 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:52:08,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:52:08,895 INFO L93 Difference]: Finished difference Result 45818 states and 60686 transitions. [2021-11-06 21:52:08,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:52:08,895 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:52:08,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:52:08,999 INFO L225 Difference]: With dead ends: 45818 [2021-11-06 21:52:08,999 INFO L226 Difference]: Without dead ends: 45814 [2021-11-06 21:52:09,015 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:52:09,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45814 states. [2021-11-06 21:52:10,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45814 to 45232. [2021-11-06 21:52:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45232 states, 44016 states have (on average 1.3027535441657578) internal successors, (57342), 44377 states have internal predecessors, (57342), 452 states have call successors, (452), 256 states have call predecessors, (452), 538 states have return successors, (2485), 634 states have call predecessors, (2485), 452 states have call successors, (2485) [2021-11-06 21:52:11,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45232 states to 45232 states and 60279 transitions. [2021-11-06 21:52:11,154 INFO L78 Accepts]: Start accepts. Automaton has 45232 states and 60279 transitions. Word has length 56 [2021-11-06 21:52:11,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:52:11,154 INFO L470 AbstractCegarLoop]: Abstraction has 45232 states and 60279 transitions. [2021-11-06 21:52:11,154 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:52:11,154 INFO L276 IsEmpty]: Start isEmpty. Operand 45232 states and 60279 transitions. [2021-11-06 21:52:11,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-06 21:52:11,155 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:52:11,156 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:52:11,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 21:52:11,156 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:52:11,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:52:11,156 INFO L85 PathProgramCache]: Analyzing trace with hash -350622197, now seen corresponding path program 1 times [2021-11-06 21:52:11,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:52:11,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748528615] [2021-11-06 21:52:11,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:52:11,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:52:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:52:11,293 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:52:11,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:52:11,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748528615] [2021-11-06 21:52:11,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748528615] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:52:11,294 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:52:11,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:52:11,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117820002] [2021-11-06 21:52:11,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:52:11,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:52:11,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:52:11,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:52:11,296 INFO L87 Difference]: Start difference. First operand 45232 states and 60279 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:52:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:52:13,118 INFO L93 Difference]: Finished difference Result 45232 states and 60279 transitions. [2021-11-06 21:52:13,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:52:13,119 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:52:13,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:52:13,218 INFO L225 Difference]: With dead ends: 45232 [2021-11-06 21:52:13,219 INFO L226 Difference]: Without dead ends: 45228 [2021-11-06 21:52:13,247 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:52:13,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45228 states. [2021-11-06 21:52:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45228 to 45228. [2021-11-06 21:52:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45228 states, 44014 states have (on average 1.3027218612259734) internal successors, (57338), 44373 states have internal predecessors, (57338), 452 states have call successors, (452), 256 states have call predecessors, (452), 538 states have return successors, (2485), 634 states have call predecessors, (2485), 452 states have call successors, (2485) [2021-11-06 21:52:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45228 states to 45228 states and 60275 transitions. [2021-11-06 21:52:15,556 INFO L78 Accepts]: Start accepts. Automaton has 45228 states and 60275 transitions. Word has length 58 [2021-11-06 21:52:15,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:52:15,557 INFO L470 AbstractCegarLoop]: Abstraction has 45228 states and 60275 transitions. [2021-11-06 21:52:15,557 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:52:15,557 INFO L276 IsEmpty]: Start isEmpty. Operand 45228 states and 60275 transitions. [2021-11-06 21:52:15,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-06 21:52:15,558 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:52:15,558 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:52:15,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 21:52:15,559 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:52:15,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:52:15,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1939807441, now seen corresponding path program 1 times [2021-11-06 21:52:15,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:52:15,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767870343] [2021-11-06 21:52:15,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:52:15,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:52:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:52:15,724 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:52:15,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:52:15,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767870343] [2021-11-06 21:52:15,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767870343] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:52:15,724 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:52:15,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:52:15,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820426809] [2021-11-06 21:52:15,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:52:15,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:52:15,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:52:15,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:52:15,726 INFO L87 Difference]: Start difference. First operand 45228 states and 60275 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:52:17,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:52:17,727 INFO L93 Difference]: Finished difference Result 45228 states and 60275 transitions. [2021-11-06 21:52:17,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:52:17,728 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:52:17,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:52:17,825 INFO L225 Difference]: With dead ends: 45228 [2021-11-06 21:52:17,825 INFO L226 Difference]: Without dead ends: 45224 [2021-11-06 21:52:17,850 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:52:17,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45224 states. [2021-11-06 21:52:19,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45224 to 45224. [2021-11-06 21:52:19,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45224 states, 44012 states have (on average 1.3026901754067073) internal successors, (57334), 44369 states have internal predecessors, (57334), 452 states have call successors, (452), 256 states have call predecessors, (452), 538 states have return successors, (2485), 634 states have call predecessors, (2485), 452 states have call successors, (2485) [2021-11-06 21:52:20,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45224 states to 45224 states and 60271 transitions. [2021-11-06 21:52:20,140 INFO L78 Accepts]: Start accepts. Automaton has 45224 states and 60271 transitions. Word has length 60 [2021-11-06 21:52:20,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:52:20,141 INFO L470 AbstractCegarLoop]: Abstraction has 45224 states and 60271 transitions. [2021-11-06 21:52:20,141 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:52:20,141 INFO L276 IsEmpty]: Start isEmpty. Operand 45224 states and 60271 transitions. [2021-11-06 21:52:20,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 21:52:20,142 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:52:20,142 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:52:20,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 21:52:20,143 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting team_port_delErr16ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:52:20,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:52:20,143 INFO L85 PathProgramCache]: Analyzing trace with hash 418046289, now seen corresponding path program 1 times [2021-11-06 21:52:20,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:52:20,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107396242] [2021-11-06 21:52:20,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:52:20,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:52:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:52:20,245 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:52:20,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:52:20,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107396242] [2021-11-06 21:52:20,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107396242] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:52:20,246 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:52:20,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:52:20,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206921032] [2021-11-06 21:52:20,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:52:20,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:52:20,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:52:20,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:52:20,248 INFO L87 Difference]: Start difference. First operand 45224 states and 60271 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:52:22,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:52:22,942 INFO L93 Difference]: Finished difference Result 90454 states and 122493 transitions. [2021-11-06 21:52:22,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:52:22,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (2), 1 states have call predecessors, (2), 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:52:22,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:52:23,066 INFO L225 Difference]: With dead ends: 90454 [2021-11-06 21:52:23,067 INFO L226 Difference]: Without dead ends: 45248 [2021-11-06 21:52:23,408 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:52:23,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45248 states. [2021-11-06 21:52:25,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45248 to 45236. [2021-11-06 21:52:25,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45236 states, 44022 states have (on average 1.302621416564445) internal successors, (57344), 44381 states have internal predecessors, (57344), 452 states have call successors, (452), 256 states have call predecessors, (452), 540 states have return successors, (2488), 634 states have call predecessors, (2488), 452 states have call successors, (2488) [2021-11-06 21:52:25,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45236 states to 45236 states and 60284 transitions. [2021-11-06 21:52:25,805 INFO L78 Accepts]: Start accepts. Automaton has 45236 states and 60284 transitions. Word has length 62 [2021-11-06 21:52:25,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:52:25,806 INFO L470 AbstractCegarLoop]: Abstraction has 45236 states and 60284 transitions. [2021-11-06 21:52:25,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:52:25,806 INFO L276 IsEmpty]: Start isEmpty. Operand 45236 states and 60284 transitions. [2021-11-06 21:52:25,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 21:52:25,807 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:52:25,807 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:52:25,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-06 21:52:25,808 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting team_port_delErr16ASSERT_VIOLATIONERROR_FUNCTION === [__team_options_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, __team_options_registerErr1ASSERT_VIOLATIONERROR_FUNCTION, ##fun~$Pointer$~TO~VOIDErr0ASSERT_VIOLATIONERROR_FUNCTION (and 288 more)] === [2021-11-06 21:52:25,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:52:25,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1227392915, now seen corresponding path program 1 times [2021-11-06 21:52:25,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:52:25,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305091734] [2021-11-06 21:52:25,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:52:25,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:52:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:52:25,945 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:52:25,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:52:25,945 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305091734] [2021-11-06 21:52:25,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305091734] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:52:25,946 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:52:25,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:52:25,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591291370] [2021-11-06 21:52:25,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:52:25,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:52:25,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:52:25,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:52:25,947 INFO L87 Difference]: Start difference. First operand 45236 states and 60284 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)